Abstract
The guarded fragment of first order logic, defined in [1], has attracted much attention recently due to the fact that it is decidable and several interesting modal logics can be translated into it. Guarded clauses, defined by de Nivelle in [7], are a generalization of guarded formulas in clausal form. In [7], it is shown that the class of guarded clause sets is decidable by saturation under ordered resolution.
In this work, we deal with guarded clauses that are Horn clauses. We introduce the notion of primitive guarded Horn clause: A guarded Horn clause is primitive iff it is either ground and its body is empty, or it contains exactly one body literal which is flat and linear, and its head literal contains a non-ground functional term. Then, we show that every satisfiable and finite set of guarded Horn clauses S can be transformed into a finite set of primitive guarded Horn clauses S′ such that the least Herbrand models of S and S′ coincide on predicate symbols that occur in S.
This transformation is done in the following way: first, de Nivelle’s saturation procedure is applied on the given set S, and certain clauses are extracted form the resulting set. Then, a resolution based technique that introduces new predicate symbols is used in order to obtain the set S′. Our motivation for the presented method is automated model building.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hajnal Andréka, Johan van Benthem, and István Nemeti. Modal languages and bounded fragments of predicate logic. Research Report ML-96-03, ILLC, 1996.
Ch. Bourely, R. Caferra, and N. Peltier. A method for building models automatically. Experiments with an extension of Otter. In Proceedings of CADE-12, pages 72–86. Springer, 1994. LNAI 814.
Michael Dierkes. Model building for guarded horn clauses. Research report, LEIBNIZ-IMAG Laboratory, 1999. Available via http://www-leibniz.imag.fr/ATINF/Michael.Dierkes/articles/mbghc.ps.gz.
C.G. Fermüller and A. Leitsch. Decision procedures and model building in equational clause logic. Journal of the IGPL, 6(1):17–41, 1998.
Christian Fermüller and A. Leitsch. Hyperresolution and automated model building. Journal of Logic and Computation, 6(2):173–203, 1996.
H. Ganzinger and H. de Nivelle. A superposition decision procedure for the guarded fragment with equality. In Proc. 14th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.
Hans de Nivelle. Resolution decides the guarded fragment. Research Report CT-1998-01, ILLC, 1998.
Hans de Nivelle. A resolution decision procedure for the guarded fragment. In Automated Deduction-CADE-15, volume 1421 of LNCS, 1998.
Nicolas Peltier. Nouvelles Techniques pour la Construction de Modèles finis ou infinis en Déduction Automatique. PhD thesis, Institut National Polytechnique de Grenoble, 1997.
J. Slaney. Finder (finite domain enumerator): Notes and guides. Technical report, Australian National University Automated Reasoning Project, Canberra, 1992.
Tanel Tammet. Using resolution for deciding solvable classes and building finite models. In Baltic Computer Science, pages 33–64. Springer, LNCS 502, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dierkes, M. (1999). Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 1999. Lecture Notes in Computer Science(), vol 1705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48242-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-48242-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66492-5
Online ISBN: 978-3-540-48242-0
eBook Packages: Springer Book Archive