Consequence-based and fixed-parameter tractable reasoning in description logics

DOI10.1016/j.artint.2014.01.002zbMath1334.68211OpenAlexW2092795970WikidataQ56988536 ScholiaQ56988536MaRDI QIDQ490523

František Simančík, Boris Motik, Ian Horrocks

Publication date: 27 August 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2014.01.002

zbMATH Keywords

treewidthdescription logicsparameterized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items

A Modal-Layered Resolution Calculus for K ⋮ Effective method for detecting error causes from incoherent biological ontologies ⋮ Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \)

Uses Software

• Pellet
• FaCT++
• E Theorem Prover

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
• Graph minors. III. Planar tree-width
• Modal languages and bounded fragments of predicate logic
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Deciding regular grammar logics with converse through first-order logic
• The DL-Lite Family and Relations
• Hypertableau Reasoning for Description Logics
• Automated Reasoning
• The Description Logic Handbook
• Theory and Applications of Satisfiability Testing
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth