Combining instance generation and resolution
From MaRDI portal
Recommendations
- Inst-Gen -- a modular approach to instantiation-based automated reasoning
- iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
- Partial instantiation methods for inference in first-order logic
- New methods for computing inferences in first order logic
- scientific article; zbMATH DE number 3871320
Cites work
- scientific article; zbMATH DE number 5305114 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 976360 (Why is no real title available?)
- scientific article; zbMATH DE number 1903355 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Machine-Oriented Logic Based on the Resolution Principle
- A machine program for theorem-proving
- Automatic Theorem Proving With Renamable and Semantic Resolution
- Encoding First Order Proofs in SAT
- Logic-based decision support. Mixed integer model formulation
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
- Partial instantiation methods for inference in first-order logic
- Resolution theorem proving
- SMELS: Satisfiability Modulo Equality with Lazy Superposition
- The TPTP problem library. CNF release v1. 2. 1
- The model evolution calculus as a first-order DPLL method
- iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
Cited in
(5)- A combined superposition and model evolution calculus
- SMELS: satisfiability modulo equality with lazy superposition
- Comparing instance generation methods for automated reasoning
- New methods for computing inferences in first order logic
- Inst-Gen -- a modular approach to instantiation-based automated reasoning
This page was built for publication: Combining instance generation and resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655208)