Skip to search formSkip to main contentSkip to account menu

Model elimination

Model Elimination is the name attached to a pair of proof procedures invented by Donald W. Loveland, the first of which was published in 1968 in the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Automated theorem provingLogic programmingMethod of analytic tableauxProlog

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
C-Clause Calculi and Refutation Search in First-Order Classical Logic
The paper describes an approach to the construction of a resolution-type technique basing on a certain generalization of the… 
2012
2012
Socratic Trees
The method of Socratic proofs (SP-method) simulates the solving of logical problem by pure questioning. An outcome of an… 
2001
2001
The Design and Implementation of a Compositional Competition-Cooperation Parallel ATP System
Key concerns in the development of more powerful ATP systems are to provide breadth of coverage – an ability to solve a large… 
1998
1998
On the Relationship Between Non-Horn Magic Sets and Relevancy Testing
Model-generation based theorem provers such as SATCHMO and MGTP suffer from a combinatorial explosion of the search space caused… 
1998
1998
Model Elimination with Simplification and its Application to Software Verification
Software verification is known to be a notoriously difficult application area for automated theorem provers. Consequently, this… 
1996
1996
Bottom-Up Query Evaluation in Extended Deductive Databases
Semantics Many concrete semantics have been defined by selecting either a specific model of every logic program (such as the well… 
1996
1996
A Translation of Model Elimination Proofs into a Structured Natural Deduction
Model Elimination is a frequently used calculus in automated theorem proving (ATP). Powerful implementations are available… 
Review
1996
Review
1996
Saturation-Based Theorem Proving: Past Successes and Future Potential (Abstract)
Saturation means to compute the closure of a given set of formulas under a given set of inference rules. Resolution, Knuth/Bendix… 
1994
1994
Model elimination without contrapositives and its application to PTTP
We give modifications of model elimination that do not necessitate the use of contrapositives. These restart model elimination… 
1993
1993
Refinements and Extensions of Model Elimination
In this paper we present new refinements and extensions of the model elimination calculus. These refinements offer a smaller… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)