Proof Search for the First-Order Connection Calculus in Maude
From MaRDI portal
Recommendations
- Connection calculus theorem proving with multiple built-in theories
- MleanCoP: a connection prover for first-order modal logic
- Frontiers of Combining Systems
- Automated Reasoning with Analytic Tableaux and Related Methods
- scientific article; zbMATH DE number 834568
- scientific article; zbMATH DE number 1348467
- -calculus model checking in Maude
- scientific article; zbMATH DE number 1882047
- M-calculus -- a sequent method for automatic theorem proving
- scientific article; zbMATH DE number 4170865
Cites work
- An approach to a systematic theorem proving procedure in first-order logic
- Automated Reasoning with Analytic Tableaux and Related Methods
- Automated Reasoning with Analytic Tableaux and Related Methods
- Conditional rewriting logic as a unified model of concurrency
- Connections in nonclassical logics
- Deduction, strategies, and rewriting
- scientific article; zbMATH DE number 194631 (Why is no real title available?)
- IeanCOP: lean connection-based theorem proving
- Maude: specification and programming in rewriting logic
- Reflection in conditional rewriting logic
- Refutations by Matings
- The tableaux work bench
- The TPTP problem library. CNF release v1. 2. 1
This page was built for publication: Proof Search for the First-Order Connection Calculus in Maude
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179137)