The integration of knowledge bases in classical first-order logic (and in particular of ontologies in various description logics) with rule languages rooted in logic programming is receiving considerable attention in the context of current efforts around Semantic-Web languages. Towards this integration we introduce fol-programs, which combine logic programs under the answer set and the wellfounded semantics with first-order logic knowledge bases and which generalize dl-programs, a closely related approach combining description logics with rules. Therefore, we define a syntax and a semantics for fol-programs, namely we define minimal model, strong answer set, weak answer set and well-founded semantics for fol-programs, to properly generalize the semantics of ordinary logic programs to fol-programs. We then show computational properties of fol-programs and prove that fol-programs are more expressive than dl-programs. Finally, we present our implementation of the well-founded semantics of fol-programs based on the deductive database engine Ontobroker and the automated theorem prover for first-order logic Vampire and discuss representative reasoning experiments on it.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
The integration of knowledge bases in classical first-order logic (and in particular of ontologies in various description logics) with rule languages rooted in logic programming is receiving considerable attention in the context of current efforts around Semantic-Web languages. Towards this integration we introduce fol-programs, which combine logic programs under the answer set and the wellfounded semantics with first-order logic knowledge bases and which generalize dl-programs, a closely related approach combining description logics with rules. Therefore, we define a syntax and a semantics for fol-programs, namely we define minimal model, strong answer set, weak answer set and well-founded semantics for fol-programs, to properly generalize the semantics of ordinary logic programs to fol-programs. We then show computational properties of fol-programs and prove that fol-programs are more expressive than dl-programs. Finally, we present our implementation of the well-founded semantics of fol-programs based on the deductive database engine Ontobroker and the automated theorem prover for first-order logic Vampire and discuss representative reasoning experiments on it.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerEUR 5,91 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerAnbieter: Buchpark, Trebbin, Deutschland
Zustand: Hervorragend. Zustand: Hervorragend | Seiten: 116 | Sprache: Englisch | Produktart: Bücher. Artikel-Nr. 4438586/1
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9783639033250_new
Anzahl: Mehr als 20 verfügbar
Anbieter: moluna, Greven, Deutschland
Kartoniert / Broschiert. Zustand: New. The integration of knowledge bases in classical first-order logic (and in particular of ontologies in various description logics) with rule languages rooted in logic programming is receiving considerable attention in the context of current efforts around Se. Artikel-Nr. 4951180
Anzahl: Mehr als 20 verfügbar