Reasoning Using Knots

  • Thomas Eiter
  • Magdalena Ortiz
  • Mantas Šimkus
Conference paper

DOI: 10.1007/978-3-540-89439-1_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5330)
Cite this paper as:
Eiter T., Ortiz M., Šimkus M. (2008) Reasoning Using Knots. In: Cervesato I., Veith H., Voronkov A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science, vol 5330. Springer, Berlin, Heidelberg

Abstract

The deployment of Description Logics (DLs) and Answer Set Programming (ASP), which are well-known knowledge representation and reasoning formalisms, to a growing range of applications has created the need for novel reasoning algorithms and methods. Recently, knots have been introduced as a tool to facilitate reasoning tasks in extensions of ASP with functions symbols. They were then also fruitfully applied for query answering in Description Logics, hinging on the forest-shaped model property of knowledge bases. This paper briefly reviews the knot idea at a generic level and recalls some of the results obtained with them. It also discusses features of knots and relations to other reasoning techniques, and presents issues for further research.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Thomas Eiter
    • 1
  • Magdalena Ortiz
    • 1
  • Mantas Šimkus
    • 1
  1. 1.Institute of Information SystemsVienna University of Technology 

Personalised recommendations