Exploiting conjunctive queries in description logic programs

DOI10.1007/s10472-009-9111-3zbMath1165.68499OpenAlexW2000353554WikidataQ57549137 ScholiaQ57549137MaRDI QIDQ1028641

Thomas Eiter, Giovambattista Ianni, Thomas Krennwallner, Roman Schindlauer

Publication date: 6 July 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9111-3

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (5)

Linking Open-World Knowledge Bases Using Nonmonotonic Rules ⋮ Combining answer set programming with description logics for the semantic web ⋮ Conflict-driven ASP solving with external sources ⋮ Inlining External Sources in Answer Set Programs ⋮ Realizing Default Logic over Description Logic Knowledge Bases

Uses Software

• Racer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data complexity of query answering in expressive description logics via tableaux
• Combining answer set programming with description logics for the semantic web
• Autoepistemic logic
• Partial deduction in disjunctive logic programming
• On the expressibility of stable logic programming
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• Logics in Artificial Intelligence
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Exploiting conjunctive queries in description logic programs