The following pages link to Matings in matrices (Q3668887):
Displaying 18 items.
- A deductive solution for plan generation (Q578927) (← links)
- On connections and higher-order logic (Q908896) (← links)
- Automated inferencing (Q1070835) (← links)
- Constraint satisfaction from a deductive viewpoint (Q1103421) (← links)
- Linearity and plan generation (Q1108814) (← links)
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- IeanCOP: lean connection-based theorem proving (Q1404981) (← links)
- Generating plans in linear logic. I: Actions as proofs (Q1802077) (← links)
- Generating plans in linear logic. II: A geometry of conjunctive actions (Q1802078) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- A Non-clausal Connection Calculus (Q3010371) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708) (← links)
- Automatic theorem proving. II (Q3793764) (← links)
- Parallel inference algorithms for the connection method on systolic arrays (Q4844581) (← links)
- From Schütte’s Formal Systems to Modern Automated Deduction (Q5013905) (← links)
