Detecting non-provable goals
From MaRDI portal
Publication:5210774
DOI10.1007/3-540-58156-1_16zbMath1433.68538OpenAlexW1803345792MaRDI QIDQ5210774
Publication date: 21 January 2020
Published in: Automated Deduction — CADE-12 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58156-1_16
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of substitutions and unifications
- Controlling recursive inference
- Theorem proving with abstraction
- An analysis of loop checking mechanisms for logic programs
- SETHEO: A high-performance theorem prover
- Resolution methods for the decision problem
- Satisfiability of the smallest binary program
- Deriving descriptions of possible values of program variables by means of abstract interpretation
- Detecting non-provable goals
- A Machine-Oriented Logic Based on the Resolution Principle
- Mechanical Theorem-Proving by Model Elimination