Resolution-Based Reasoning for Ontologies

Boris Motik ()
Additional contact information
Boris Motik: University of Manchester

A chapter in Handbook on Ontologies, 2009, pp 529-550 from Springer

Abstract: Summary We overview the algorithms for reasoning with description logic (DL) ontologies based on resolution. These algorithms often have worst-case optimal complexity, and, by relying on vast experience in building resolution theorem provers, they can be implemented efficiently. Furthermore, we present a resolution-based algorithm that reduces a DL knowledge base into a disjunctive datalog program, while preserving the set of entailed facts. This reduction enables the application of optimization techniques from deductive databases, such as magic sets, to reasoning in DLs. This approach has proven itself in practice on ontologies with relatively small and simple TBoxes, but large ABoxes.

Keywords: Disjunctive Datalog Programs; Large ABoxes; Simple TBox; Magic Sets; Description Logics (DL) (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ihichp:978-3-540-92673-3_24

Ordering information: This item can be ordered from
http://www.springer.com/9783540926733

DOI: 10.1007/978-3-540-92673-3_24

Access Statistics for this chapter

More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().