Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,468,569 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Automated theorem proving
Logic programming
Method of analytic tableaux
Prolog
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Socratic Trees
Dorota Leszczynska-Jasion
,
M. Urbanski
,
A. Wiśniewski
Studia Logica: An International Journal for…
2012
Corpus ID: 27894743
The method of Socratic proofs (SP-method) simulates the solving of logical problem by pure questioning. An outcome of an…
Expand
2001
2001
The Design and Implementation of a Compositional Competition-Cooperation Parallel ATP System
G. Sutcliffe
2001
Corpus ID: 18575924
Key concerns in the development of more powerful ATP systems are to provide breadth of coverage – an ability to solve a large…
Expand
1999
1999
Complexity Analysis of Propositional Resolution with Autarky Pruning
A. V. Gelder
Discrete Applied Mathematics
1999
Corpus ID: 18911598
1997
1997
The Undecidability of Simultaneous Rigid E-Unification with Two Variables
Margus Veanes
Kurt Gödel Colloquium
1997
Corpus ID: 1104759
Recently it was proved that the problem of simultaneous rigid E-unification, or SREU, is undecidable. Here we show that 4 rigid…
Expand
1996
1996
Bottom-Up Query Evaluation in Extended Deductive Databases
Stefan Brass
1996
Corpus ID: 17741617
Semantics Many concrete semantics have been defined by selecting either a specific model of every logic program (such as the well…
Expand
1996
1996
A Translation of Model Elimination Proofs into a Structured Natural Deduction
Andreas Wolf
1996
Corpus ID: 16373780
Model Elimination is a frequently used calculus in automated theorem proving (ATP). Powerful implementations are available…
Expand
1995
1995
Link Deletion in Model Elimination
Klaus Mayr
International Conference on Theorem Proving with…
1995
Corpus ID: 10214962
In this paper we investigate a powerful subsumption concept which can be used to prune the search space in model elimination. The…
Expand
Highly Cited
1976
Highly Cited
1976
Refutation Graphs
R. Shostak
Artificial Intelligence
1976
Corpus ID: 8640075
1976
1976
Analytic Resolution in Theorem Proving
D. Brand
Artificial Intelligence
1976
Corpus ID: 27645525
1974
1974
An Implementation of the Model Elimination Proof Procedure
S. Fleisig
,
D. Loveland
,
A. K. Smiley
,
D. Yarmush
JACM
1974
Corpus ID: 15686713
The model elimination (ME) and resolution algorithms for mechanical theorem-proving were implemented so as to maximize shared…
Expand
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)
ACCEPT & CONTINUE