Towards a Decidable LogicWeb via Length-Bounded Derivations

LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form $prov(P,G,n)$ which is a success if a query $G$ can be proved from the web page...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kwon, Keehang, Kang, Daeseong
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Logic in Computer Science
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!