Deduction in ontologies via ASP

Terrance Swift

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Ontologies have become an important methodology for representing knowledge, particularly for allowing agents to interchange knowledge over the world-wide-web. From an abstract point of view, an ontology can be seen as a theory about a set of classes. The language underlying the ontology may or may not be decidable; if it is, it is often called a description logic, and the problem of determining whether one description logic formula implies (or subsumes) another is fundamental to deduction in ontologies. This paper models description logics as first-order theories, and employs model-theoretic techniques to determine properties of various description logics. These properties are used to design efficient engines to generate Answer Set Programs that perform deduction in ontologies. This approach contrasts to tableaux theorem proving techniques that are more commonly used. The resulting system serves as an experimental platform to explore the combination of logic-programming based techniques for non-monotonic reasoning and constraint handling with description-logic based deduction. Specifically, we use ASP to create a small but powerful theorem prover for the description logic ALCQI. While ALCQI is P-space complete, our deduction engine requires exponential space in the worst case. However experiments show that its time is roughly comparable to the one of the best tableaux-based engined, DLP [1], even though DLP is written for a simpler description logic, ALCN 1.

Original languageEnglish (US)
Title of host publicationLogic Programming and Nonmonotonic Reasoning
EditorsIlkka Niemela, Vladimir Lifschitz
PublisherSpringer Verlag
Pages275-288
Number of pages14
ISBN (Electronic)354020721X, 9783540207214
StatePublished - Jan 1 2004
Event7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004 - Fort Lauderdale, United States
Duration: Jan 6 2004Jan 8 2004

Publication series

NameLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume2923
ISSN (Print)0302-9743

Other

Other7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004
CountryUnited States
CityFort Lauderdale
Period1/6/041/8/04

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Swift, T. (2004). Deduction in ontologies via ASP. In I. Niemela, & V. Lifschitz (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 275-288). (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science); Vol. 2923). Springer Verlag.