Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Many sorted logic=unsorted logic+control?
Proceedings of Expert Systems '86, The 6Th Annual Technical Conference on Research and development in expert systems III
A more expressive formulation of many sorted logic
Journal of Automated Reasoning
Presburger arithmetic with unary predicates is P11 complete
Journal of Symbolic Logic
The Euclidean definition of the functions div and mod
ACM Transactions on Programming Languages and Systems (TOPLAS)
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
AI Communications - CASC
THF0 --- The Core of the TPTP Language for Higher-Order Logic
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
(LIA) - Model Evolution with Linear Integer Arithmetic Constraints
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Handbook of Practical Logic and Automated Reasoning
Handbook of Practical Logic and Automated Reasoning
A many-sorted calculus based on resolution and paramodulation
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Superposition modulo linear arithmetic SUP(LA)
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Journal of Automated Reasoning
The TPTP world - infrastructure for automated reasoning
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Model Evolution with equality - Revised and implemented
Journal of Symbolic Computation
The CADE-23 Automated Theorem Proving System Competition - CASC-23
AI Communications
Integrating linear arithmetic into superposition calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The CADE-23 Automated Theorem Proving System Competition - CASC-23
AI Communications
Hierarchic superposition with weak abstraction
CADE'13 Proceedings of the 24th international conference on Automated Deduction
TFF1: the TPTP typed first-order form with rank-1 polymorphism
CADE'13 Proceedings of the 24th international conference on Automated Deduction
A qualitative comparison of the suitability of four theorem provers for basic auction theory
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has been extended to include a typed first-order logic, which in turn has enabled the integration of arithmetic. This paper describes these developments.