Detecting non-provable goals
From MaRDI portal
Publication:5210774
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- An analysis of loop checking mechanisms for logic programs
- Controlling recursive inference
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Detecting non-provable goals
- scientific article; zbMATH DE number 4110158 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1348461 (Why is no real title available?)
- scientific article; zbMATH DE number 516986 (Why is no real title available?)
- scientific article; zbMATH DE number 194631 (Why is no real title available?)
- Mechanical Theorem-Proving by Model Elimination
- Properties of substitutions and unifications
- Resolution methods for the decision problem
- Satisfiability of the smallest binary program
- SETHEO: A high-performance theorem prover
- Theorem proving with abstraction
Cited in
(3)
This page was built for publication: Detecting non-provable goals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210774)