A relevance restriction strategy for automated deduction

Artificial Intelligence

Volumn 144, Issue 1-2, 2003, Pages 59-93

  Plaisted, David A ^a   Yahya, Adnan ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b BIRZEIT UNIVERSITY   (Palestine)

Author keywords

Relevance; Relevance metrics; Sorted inference; Theorem proving

Indexed keywords

AUTOMATION; COMPUTATIONAL METHODS; SET THEORY; THEOREM PROVING;

RELEVANCE METRICS;

ARTIFICIAL INTELLIGENCE;

EID: 0037371961     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00368-5     Document Type: Article

References (27)

1. Baader F., Calvanese D., McGuinness D., Nardi D., Patel-Schneider P.F. The Description Logic Handbook: Theory, Implementation and Applications. 2002;Cambridge University Press, Cambridge.
2. Baumgartner P. FDPLL - A first-order Davis-Putnam-Logemann-Loveland procedure. Proceedings of 17th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence. 1831:2000;200-219 Springer, Berlin.
3. Berners-Lee T., Hendler J., Lassila O. The semantic web. Scientific American. 284:(5):2001;34-43.
4. Bry F., Yahya A. Positive unit hyper-resolution tableaux and their application to minimal model generation. J. Automat. Reason. 25:(1):2000;35-82.
5. Chang C.L., Lee K.C.T. Symbolic Logic and Mechanical Theorem Proving. 1973;Academic Press, New York.
6. Fuchs M. Relevancy-based lemma selection for model elimination using lazy tableaux enumeration. Proceedings ECAI-98, Brighton, UK. 1998;346-350.
7. Fuchs M., Fuchs D. Abstraction-based relevancy testing for model elimination. Ganzinger H. Proceedings of 16th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence. 1632:1999;344-358 Springer, Berlin.
8. Jefferson S., Plaisted D. Implementation of an improved relevance criterion. IEEE 1984, Proceedings of the First Conference on Artificial Intelligence Applications. 1984;476-482 IEEE Computer Society Press.
9. Lenat D., Guha R. Building Large Knowledge-Based Systems. 1990;Addison-Wesley, Reading, MA.
10. Letz R., Stenz G. DCTP - A disconnection calculus theorem prover - system abstract. Goré R., Leitsch A., Nipkow T. Automated Reasoning, First International Joint Conference (IJCAR) Proceedings, Siena, Italy. Lecture Notes in Comput. Sci. 2083:2001;381-385 Springer, Berlin.
11. Lloyd J.W. Foundations of Logic Programming. 2nd Edition:1987;Springer, Heidelberg.
12. Loveland D.W. Automated Theorem Proving: A Logical Basis. 1978;North Holland, Amsterdam.
13. Loveland D.W. Mechanical theorem-proving by model elimination. J. ACM. 15:(2):1968;236-251.
14. Loveland D.W., Reed D., Wilson D. SATCHMORE: SATCHMO with RElevancy. J. Automat. Reason. 14:1995;325-351.
15. D.W. Loveland, A. Yahya, SATCHMOREBID: SATCHMO(RE) with BIDirectional Relevancy, New Generation Computing, to appear.
16. Manthey R., Bry F. SATCHMO: A theorem prover implemented in Prolog. Lusk E., Overbeek R. Proceedings of the 9th International Conference on Automated Deduction. 1988;415-434 Springer, Berlin.
17. Nerode A., Shore R. Logic for Applications. 1993;Springer, Berlin.
18. Ohta Y., Inoue K., Hasegawa R. On the relationship between non-Horn magic sets and relevance testing. Proceedings of 15th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence. 1421:1998;333-348 Springer, Berlin.
19. D. Plaisted, Theorem proving and semantic trees, Ph.D. Thesis, Stanford University, 1976.
20. Plaisted D. An efficient relevance criterion for mechanical theorem proving. Proceedings of the First Annual National Conference on Artificial Intelligence, Stanford University. 1980;79-83 AAAI.
21. Plaisted D. Theorem proving with abstraction. Artificial Intelligence. 16:(1):1981;47-108.
22. Plaisted D., Zhu Y. Ordered semantic hyperlinking. J. Automat. Reason. 25:(3):2000;167-217.
23. Ramsay A. Generating relevant models. J. Automat. Reason. 7:1991;359-368.
24. Reif W., Schellhorn G. Theorem proving in large theories. Bibel W., Schmitt P.H. Automated Deduction - A Basis for Applications, Vol. III: Applications. 1998;225-241 Kluwer Academic, Dordrecht.
25. R. Veroff, Reasoning at multiple levels of abstraction, Technical Report TR-CS-2000-50, Department of Computer Science, University of New Mexico, Los Alamos, NM, 2000.
26. R. Veroff, Personal communication, July 2002.
27. Yahya A. Duality for goal-driven query processing in disjunctive deductive databases. J. Automat. Reason. 28:(1):2002;1-34.