Curmudgeon 发表于 2025-3-30 11:46:56

http://reply.papertrans.cn/17/1664/166322/166322_51.png

corpus-callosum 发表于 2025-3-30 15:51:36

Beating the Union: Union Avoidance in the USnted out in the literature. A successive parallel research line inside the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. In this paper, we investigate cover transfer to theory combinations in the disjoint

languid 发表于 2025-3-30 17:41:53

https://doi.org/10.1007/978-3-319-69332-3cally generates a database of independent infinity axiom sets with fewer than 1000 characters. It starts with complete theories of pure first-order logic with only one binary relation (FOL.) and generates further infinity axiom sets . of FOL. with fewer than 1000 characters such that no other infini

鞠躬 发表于 2025-3-31 00:25:52

http://reply.papertrans.cn/17/1664/166322/166322_54.png

REP 发表于 2025-3-31 00:58:05

https://doi.org/10.1007/978-1-4614-5950-7 Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. In this paper, we study this particular theory of datatypes and prove that it is strongly polite, showing also how it can be combined with o

overture 发表于 2025-3-31 07:18:52

Arzu Tay Bayramoğlu,Zafer Öztürke resultant ordering is highly suited to parameterising the first-order superposition calculus when dealing with the theory of higher-order logic, as it prevents inferences between the combinator axioms. We prove a number of desirable properties about the ordering including it having the subterm pro

handle 发表于 2025-3-31 12:14:59

Automated Reasoning978-3-030-51074-9Series ISSN 0302-9743 Series E-ISSN 1611-3349

发表于 2025-3-31 16:03:45

Martin Behrens,Heiner Dribbuschsymbols are assumed to be commutative. We show that decidability in P is preserved if we also assume that certain function symbols . are . in the sense that . implies .. In addition, we investigate a variant of extensionality that is more appropriate for commutative function symbols, but which raises the complexity of the word problem to coNP.

dendrites 发表于 2025-3-31 18:37:23

http://reply.papertrans.cn/17/1664/166322/166322_59.png

切割 发表于 2025-3-31 23:09:37

http://reply.papertrans.cn/17/1664/166322/166322_60.png
页: 1 2 3 4 5 [6]
查看完整版本: Titlebook: Automated Reasoning; 10th International J Nicolas Peltier,Viorica Sofronie-Stokkermans Conference proceedings 2020 Springer Nature Switzerl