Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

IJCAI
2007

favoriteEmaildiscussreport

164views Artificial Intelligence» more IJCAI 2007»

A Faithful Integration of Description Logics with Logic Programming

13 years 5 months ago

A Faithful Integration of Description Logics with Logic Programming

Download www.ijcai.org

Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so achieving a seamless integration is not trivial. In this paper, we introduce hybrid MKNF knowledge bases that faithfully integrate DLs with LP using the logic of Minimal Knowledge and Negation as Failure (MKNF) [Lifschitz, 1991]. We also give reasoning algorithms and tight data complexity bounds for several interesting fragments of our logic.

Boris Motik, Riccardo Rosati

Real-time Traffic

Artificial Intelligence | Data Complexity Bounds | IJCAI 2007 | Logic Programming | MKNF Knowledge Bases |

claim paper

Related Content

» Description logic programs combining logic programs with description logic

» Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mapp...

» Loop Formulas for Description Logic Programs

» Integrating Semantic Web Reasoning and Answer Set Programming

» Unrestricted AndParallel Execution of Logic Programs with Dependency Directed Backtracking

» Exploiting Conjunctive Queries in Description Logic Programs

» Integrating Ontology Languages and Answer Set Programming

» Tractable Reasoning with DLPrograms over Datalogrewritable Description Logics

» Provably faithful evaluation of polynomials

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	IJCAI
Authors	Boris Motik, Riccardo Rosati

Comments (0)