L. Georgieva, U. Hustadt, R. A. Schmidt (2001b): ``Computational space efficiency and minimal model generation for guarded formulae.'' In R. Nieuwenhuis and A. Voronkov, editors, Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2001) [Havana, Cuba, 3-7 December 2001], pp. 85-99. LNAI 2250, Springer 2001.
Abstract, BibTeX, PDF (© Springer).

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 fragments 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. [an error occurred while processing this directive]