Deciding horn classes by hyperresolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 440 LNCS, Issue , 1990, Pages 225-241

  Leitsch, Alexander ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

COMPLEXITY ANALYSIS; CONSISTENCY PROBLEMS; DECISION PROCEDURE; HORN CLAUSE; HYPER-RESOLUTION; IMPLICATION PROBLEM; ONE-RULE; SHARP BOUNDARIES;

COMPUTER CIRCUITS;

EID: 85031160856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52753-2_42     Document Type: Conference Paper

References (14)

1. C. L. Chang & R. C. T. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press 1973.
2. B. Dreben & W. D. Goldfarb: The Decision Problem-Solvable Classes of Quantificational Formulas. Addison Wesley 1979.
3. C. Fermüller: Deciding some Horn Clause Sets by Resolution, to appear in the Yearbook of the Kurt Gödel Society 1989.
4. M. R Garry & D. S. Johnson: Computers and Intractability; Freeman & Comp. San Francisco. 1979.
5. G. Gottlob: Subsumption and Implication, Information Processing Letters 24 (1987). 109-111.
6. W. H. Joyner jr.: Resolution Strategies as Decision Procedures, JACM Vol 23 No. 3. (July 1970). 398-417.
7. A. Leitsch: Implication Algorithms for Classes of Horn Clauses. Statistik. Informatik + Oekonomie. Springer Verl. Berlin, Heidelberg, 1988, 172-189.
8. A. Leitsch, G. Gottlob: Deciding Horn Clause Implication by Ordered Semantic Resolution, to appear in Proc. Intern, Symp. Computational Intelligence 89, Elsevier 1989.
9. H. R. Lewis: Unsolvable Classes of Quantificational Formulas. Addison Wesley 1979.
10. D. Loveland: Automated Theorem Proving-A Logical Basis, North Holland Publ. Comp 1978.
11. A. Martelli, U. Montanan: An Efficient Unification Algorithm, ACM Transactions on Programming Languages and Systems. Vol. 4 No. 2, (April 1982).
12. J. Siekmann: Universal Unification. 7th International Conference on Automated Deduction. LNCS 170 (1984), 1-42.
13. M. Schmidt-Schauss: Implication of Clauses is undecidable, Theoretical Computer Science 59 (1988), 287-296.
14. S. Stenlund: Combinators,?-Terms and Proof Theory. Reidel Publ. Comp. 1971.