Hyperresolution for Guarded Formulae. Georgieva, L., Hustadt, U., & Schmidt, R. A. In Baumgartner, P. & Zhang, H., editors, Proceedings of the Third International Workshop on First-Order Theorem Proving (FTP 2000) [St. Andrews, Scotland, 2-4 July 2000], volume 5/2000, of Fachberichte Informatik, pages 101-112, 2000. Institut für Informatik, Universität Koblenz-Landau.
Hyperresolution for Guarded Formulae [pdf]Paper  abstract   bibtex   
This paper investigates the use of hyperresolution as a decision procedure and model builder for guarded formulae. In general hyperresolution is not a decision procedure for the entire guarded fragment. However we show that there are natural fragements which can be decided by hyperresolution. In particular, we prove decidability of hyperresolution with or without splitting for the fragment GF1- and point out several ways of extending this fragment without loosing decidability. As hyperresolution is closely related to various tableaux methods the present work is also relevant for tableaux methods. We compare our approach to hypertableaux, and mention the relationship to other clausal classes which are decidable by hyperresolution.

Downloads: 0