Abstract
It is shown that positive hyperresolution can be used as decision procedure for solvable classes of Horn clause sets. Rather than by quantifier prefixes or by propositional features these classes are characterized by variable occurrence — and term depth properties. Special attention is given to a subclass of the Horn clause implication problem, which can be represented as consistency problem; to decide ∀C→∀D, ( ∀C denotes the universal closoure of C, C is a Horn clause, D is an arbitrary clause ) we apply hyperresolution to the clause form of ∀C∧⌍∀D. Special techniques can be used in handling such implication clause forms, because there is only one rule, ground unit facts and ground unit goals. The sharp boundary between solvable and unsolvable classes is illustrated, and a complexity analysis of some classes is given.
Preview
Unable to display preview. Download preview PDF.
References
C. L. Chang & R. C. T. Lee: Symbolic Logic and Mechanical Theorem Proving, Academic Press 1973.
B. Dreben & W. D. Goldfarb: The Decision Problem — Solvable Classes of Quantificational Formulas, Addison Wesley 1979.
C.Fermüller: Deciding some Horn Clause Sets by Resolution, to appear in the Yearbook of the Kurt Gödel Society 1989.
M. R. Garey & D. S. Johnson: Computers and Intractability; Freeman & Comp., San Francisco, 1979.
G. Gottlob: Subsumption and Implication, Information Processing Letters 24 (1987), 109–111.
W. H. Joyner jr.: Resolution Strategies as Decision Procedures, JACM Vol 23 No. 3, (July 1976), 398–417.
A. Leitsch: Implication Algorithms for Classes of Horn Clauses, Statistik, Informatik + Oekonomie, Springer Verl. Berlin, Heidelberg, 1988, 172–189.
A.Leitsch, G.Gottlob: Deciding Horn Clause Implication by Ordered Semantic Resolution, to appear in Proc. Intern. Symp. Computational Intelligence 89, Elsevier 1989.
H.R. Lewis: Unsolvable Classes of Quantificational Formulas, Addison Wesley 1979.
D. Loveland: Automated Theorem Proving — A Logical Basis, North Holland Publ. Comp. 1978.
A. Martelli, U. Montanari: An Efficient Unification Algorithm, ACM Transactions on Programming Languages and Systems, Vol. 4 No. 2, (April 1982).
J. Siekmann: Universal Unification, 7th International Conference on Automated Deduction, LNCS 170(1984),1–42.
M. Schmidt-Schauss: Implication of Clauses is Undecidable, Theoretical Computer Science 59 (1988), 287–296.
S. Stenlund: Combinators, λ-Terms and Proof Theory, Reidel Publ. Comp. 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leitsch, A. (1990). Deciding Horn classes by hyperresolution. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_42
Download citation
DOI: https://doi.org/10.1007/3-540-52753-2_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52753-4
Online ISBN: 978-3-540-47137-0
eBook Packages: Springer Book Archive