(Enter summary)
Abstract: Theory resolution constitutes a set of complete procedures for incorporating theories into a
resolution theorem-proving program, thereby making it unnecessary to resolve directly upon
axioms of the theory. This can greatly reduce the length of proofs and the size of the search
space. Theory resolution effects a beneficial division of labor, improving the performance
of the theorem prover and increasing the applicability of the specialized reasoning procedures.
Total theory resolution utilizes a ... (Update)
Cited by: More
Strategies for Focusing Structure-Based Theorem Proving - Amir, McIlraith (2001)
(Correct)
Linear and Unit-Resulting Refutations for Horn Theories - Baumgartner (1995)
(Correct)
A Tableau Calculus for Integrating First-Order Reasoning with .. - Cantone, Zarba (2000)
(Correct)
Active bibliography (related documents): More All
0.8: Deduction Systems Based on Resolution - Norbert Eisinger, Hans Jürgen.. (1991)
(Correct)
0.5: A Prolog Technology Theorem Prover: Implementation by an Extended .. - Stickel (1987)
(Correct)
0.5: Natural Language Based Inference Procedures applied to.. - Givan, McAllester.. (1991)
(Correct)
Similar documents based on text: More All
0.2: The Path-Indexing Method for Indexing Terms - Mark Stickel Artificial (1989)
(Correct)
0.0: The Economics of the Gift - Ven (2000)
(Correct)
0.0: A First-Order Horn-Clause Abductive System And Its Use In Plan.. - Ng, Mooney (1992)
(Correct)
Related documents from co-citation: More All
22: A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
20: Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
19: Foundations of Logic Programming (context) - Lloyd - 1987
BibTeX entry: (Update)
Stickel, M.E.: 1985, Automated deduction by theory resolution. Journal of Automated Reasoning, 1:333--356. http://citeseer.ist.psu.edu/stickel85automated.html More
@inproceedings{ stickel85automated,
author = "Mark J. Stickel",
title = "Automated Deduction by Theory Resolution",
booktitle = "{IJCAI} 85, Proceedings of the Ninth International Joint Conference on Artificial Intelligence",
publisher = "Morgan Kaufmann",
address = "Los Altos, California",
editor = "Arivind Joshi",
pages = "455--458",
year = "1985",
url = "citeseer.ist.psu.edu/stickel85automated.html" }
Citations (may not include all citations):
1044
Maintaining knowledge about temporal intervals (context) - Allen - 1983
410
Principles of Artificial Intelligence (context) - Nilsson - 1980
309
Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
186
Automated Theorem Proving: A Logical Basis (context) - Loveland - 1978
154
Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
142
Automated Theorem Proving (context) - Bibel - 1982
121
Deciding combinations of theories (context) - Shostak - 1984
114
Building-in equational theories (context) - Plotkin - 1972
73
Theorem proving via general matings (context) - Andrews - 1981
71
Krypton: a functional approach to knowledge representation (context) - Brachman, Fikes et al. - 1983
43
A many-sorted calculus based on resolution and paramodulatio.. (context) - Walther - 1983
26
resolution: extension of resolution to include the equality .. (context) - Morris - 1969
26
A linear format for resolution with merging and a new techni.. (context) - Anderson, Bledsoe - 1970
24
Variable elimination and chaining in a resolution-based prov.. (context) - Bledsoe, Hines - 1980
17
A mechanical solution of Schubert's steamroller by many-sort.. (context) - Walther - 1984
17
Competence in knowledge representation (context) - Brachman, Levesque - 1982
16
The linked inference principle (context) - Wos, Veroff et al. - 1984
15
Universal unification (context) - Siekmann - 1984
14
A Deduction Model of Belief and Its Logics (context) - Konolige - 1984
13
Special relations in automated deduction (context) - Manna, Waldinger
10
Automated Reasoning (context) - Wos, Overbeek et al. - 1984
7
resolution: theorem-proving with compiled axioms (context) - Dixon - 1973
7
Resolution by unification and equality (context) - Digricoli - 1979
6
Theory resolution: building in nonequational theories (context) - Stickel - 1983
6
Knowledge representation languages and predicate calculus: h.. (context) - Rich - 1982
4
Unification in many-sorted theories (context) - Walther - 1984
3
Another generalization of resolution (context) - Harrison, Rubin - 1978
3
A nonclausal connection-graph resolution theorem-proving pro.. (context) - Stickel - 1982
3
Special issue on knowledge representation (context) - Brachman, Smith - 1980
2
A portable environment for research in automated reasoning (context) - Lusk, Overbeek - 1984
2
Improving the expressiveness of many sorted logic (context) - Cohn - 1983
2
A note concerning the axiomatization of Schubert's steamroll.. (context) - Cohn - 1984
2
An approach to acquiring and applying knowledge (context) - Haas, Hendrix - 1980
1
Mechanizing a Particularly Expressive Many Sorted Logic (context) - Cohn - 1983
1
The interaction between assertional and terminological knowl.. (context) - Pigman - 1984
1
Experiments with an automatic theorem-prover having partial .. (context) - Slagle, Norton - 1973
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ai.sri.com/~stickel/): More
Interpretation as Abduction - Hobbs, Stickel, Appelt, Martin (1990)
(Correct)
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure - Uribe, Stickel (1994)
(Correct)
Implementing the Davis-Putnam Method - Zhang, Stickel (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC