Prefixed Resolution: A Resolution Method for Modal and Description Logics

de Nivelle, Hans; Areces, Carlos; de Rijke, Maarten

Datensatz

DATENSATZ AKTIONENEXPORT

Zur Ablage hinzufügen

Lokale TagsFreigabegeschichteDetailsÜbersicht

Freigegeben

Konferenzbeitrag

Prefixed Resolution: A Resolution Method for Modal and Description Logics

MPG-Autoren

/persons/resource/persons44298

de Nivelle, Hans
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen

Es sind keine externen Ressourcen hinterlegt

Volltexte (beschränkter Zugriff)

Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.

Volltexte (frei zugänglich)

Es sind keine frei zugänglichen Volltexte in PuRe verfügbar

Ergänzendes Material (frei zugänglich)

Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar

Zitation

de Nivelle, H., Areces, C., & de Rijke, M. (1999). Prefixed Resolution: A Resolution Method for Modal and Description Logics. In H. Ganzinger (Ed.), Proceedings of the 16th International Conference on Automated Deduction (CADE-16) (pp. 187-201). Berlin, Germany: Springer.

Zitierlink: https://hdl.handle.net/11858/00-001M-0000-000F-367E-A

Zusammenfassung

We provide a resolution-based proof procedure for modal and description logics that improves on previous proposals in a number of important ways. First, it avoids translations into large undecidable logics, and works directly on modal or description logic formulas instead. Second, by using labeled formulas, it avoids the complexities of earlier propositional resolution-based methods for modal logic. Third, it provides a method for manipulating so-called assertional information in the description-logic setting. And fourth, we believe that it combines ideas from the method of prefixes used in tableaux and resolution in such a way that some of the heuristics and optimizations devised in either field are applicable.