Abstract
There are several well known possibilities which constrained clauses (= c-clauses, for short) provide in addition to standard clauses. In particular, many (even infinitely many) standard clauses can be represented by a single c-clause. Hence, many parallel inference steps on standard clauses can be encoded in a single inference step on c-clauses. The aim of this work is to investigate another possibility offered by constrained clauses: We shall try to combine resolution based decision procedures with constrained clause logic in order to increase the expressive power of the resulting decision classes. Therefore, there are two questions on which this paper focuses:
-
1.
In what sense do constrained clauses actually provide additional expressive power in comparison with standard clauses? The answer given here is that only constraints made up from conjunctions of disequations constitute a genuine extension w.r.t. standard clauses.
-
2.
Is it possible to extend decision classes of standard clauses by the use of constrained clauses? The main result of this work is a positive answer to this question, namely a theorem which shows that standard clause classes decidable by certain resolution refinements remain decidable even if they are extended by constraints consisting of conjunctions of disequations.
In order to prove the termination of our decision procedures on constrained clauses, some kind of compactness theorem for unification problems will be derived, thus extending a related result from [9].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Comon, P. Lescanne: Equational Problems and Disunification, Journal of Symbolic Computation, Vol 7, pp. 371–425, (1989).
R. Caferra, N. Peltier: Decision Procedures using Model Building Techniques, Proceedings of CSL’95, LNCS 1092, pp.130–144, Springer (1996).
R. Caferra, N. Zabel: Extending Resolution for Model Construction, Proceedings of Logics in AI-JELIA’90, LNAI 478, pp. 153–169, Springer (1991).
N. Dershowitz, Z. Manna: Proving Termination with Multiset Orderings, in Communications of the ACM, Vol 22, No 8, pp. 465–475 (1979).
C. Fermüller, A. Leitsch, T. Tammet, N. Zamov: Resolution Methods for the Decision Problem. LNAI 679, Springer (1993).
R. Kowalski, P.J. Hayes: Semantic Trees in Automated Theorem Proving, in Machine Intelligence 4, pp. 87–101 (1969).
A. Leitsch: The Resolution Calculus, Texts in Theoretical Computer Science, Springer (1997).
J.-L. Lassez, K. Marriott: Explicit Representation of Terms defined by Counter Examples, Journal of Automated Reasoning, Vol 3, pp. 301–317 (1987).
J.-L. Lassez, M.J. Maher, K. Marriott: Unification Revisited, Foundations of Logic and Functional Programming, LNCS 306, pp. 67–113, Springer (1986).
R. Pichler: Completeness and Redundancy in Constrained Clause Logic, in Proceedings of FTP’98 (Int. Workshop on First-Order Theorem Proving), Technical Report E1852-GS-981 of Technische UniversitätWien, pp. 193–203, available from http://www.logic.at/ftp98, Vienna (1998).
J.A. Robinson: A machine oriented logic based on the resolution principle, Journal of the ACM, Vol 12, No 1, pp. 23–41 (1965).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pichler, R. (2000). Extending Decidable Clause Classes via Constraints. In: Caferra, R., Salzer, G. (eds) Automated Deduction in Classical and Non-Classical Logics. FTP 1998. Lecture Notes in Computer Science(), vol 1761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46508-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-46508-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67190-9
Online ISBN: 978-3-540-46508-9
eBook Packages: Springer Book Archive