A Non-clausal Connection Calculus
From MaRDI portal
Publication:3010371
DOI10.1007/978-3-642-22119-4_18zbMath1333.03004OpenAlexW1537870154MaRDI QIDQ3010371
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22119-4_18
Related Items
The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics, Incremental variable splitting, The 9th IJCAR Automated Theorem Proving System Competition – CASC-J9, Machine learning guidance for connection tableaux, nanoCoP: A Non-clausal Connection Prover, From Schütte’s Formal Systems to Modern Automated Deduction, The possibilistic Horn non-clausal knowledge bases
Uses Software
Cites Work
- Linearity and regularity with negation normal form
- Liberalized variable splitting
- A structure-preserving clause form translation
- IeanCOP: lean connection-based theorem proving
- Restricting backtracking in connection calculi
- Matings in matrices
- Theorem Proving via General Matings
- Automated Reasoning with Analytic Tableaux and Related Methods
- A Machine-Oriented Logic Based on the Resolution Principle
- Mechanical Theorem-Proving by Model Elimination
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item