Anti-prenexing and Prenexing for Modal Logics

Efficient proof methods for normal modal logics are highly desirable, as such logical systems have been widely used in computer science to represent complex situations. Resolution-based methods are often designed to deal with formulae in a normal form and the efficiency of the method (also) relies o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Nalon, Cláudia, Dixon, Clare
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Logical, boolean and switching functions Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!