A complete semantic back chaining proof system
From MaRDI portal
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- A Semantically Guided Deductive System for Automatic Theorem Proving
- A Simplified Format for the Model Elimination Theorem-Proving Procedure
- Automatic Theorem Proving With Renamable and Semantic Resolution
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- Hierarchical deduction
- scientific article; zbMATH DE number 3774914 (Why is no real title available?)
- scientific article; zbMATH DE number 3343519 (Why is no real title available?)
- scientific article; zbMATH DE number 3185223 (Why is no real title available?)
- Non-Horn clause logic programming without contrapositives
- Using sophisticated models in resolution theorem proving
Cited in
(3)
This page was built for publication: A complete semantic back chaining proof system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488519)