Sciweavers

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

10

DEXAW
2003
IEEE

favoriteEmaildiscussreport

113views Database» more DEXAW 2003»

Integrating Ontology Languages and Answer Set Programming

13 years 9 months ago

Integrating Ontology Languages and Answer Set Programming

Download www.kr.tuwien.ac.at

We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an inﬁnite universe, without introducing function symbols. We show that this extension is still decidable, and can be used to simulate, on the one hand, answer set programming with a ﬁnite universe, and on the other hand, several expressive description logics (DLs), which can be seen as ontology languages. The integration leads to a “best of both worlds”: from the LP side it inherits a ﬂexible and intuitive representation of knowledge, whereas the DLs side provides the possibility to represent inﬁnite knowledge.

Stijn Heymans, Dirk Vermeir

Real-time Traffic

Answer Set Programming | Database | DEXAW 2003 | Disjunctive Logic Programs | Ontology Languages |

claim paper

Related Content

» Integrating Semantic Web Reasoning and Answer Set Programming

» Reformulating Temporal Action Logics in Answer Set Programming

» Integrating answer set programming and constraint logic programming

» LPForget A System of Forgetting in Answer Set Programming

» Merging and Aligning Ontologies in dlPrograms

» Reasoning about the Semantic Web using Answer Set Programming

» Towards an Integration of Answer Set and Constraint Solving

» Open answer set programming for the semantic web

» ASPPROLOG A System for Reasoning about Answer Set Programs in Prolog

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	DEXAW
Authors	Stijn Heymans, Dirk Vermeir

Comments (0)