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

DOI10.1016/J.ARTINT.2014.01.002MaRDI QIDQ490523zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

treewidthparameterized complexitydescription logics

Mathematics Subject Classification ID

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

Recommendations

• Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions
• Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \)
• An overview of tableau algorithms for description logics
• Description Logics
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

Cites work

• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Automated Reasoning
• Combining superposition, sorts and splitting
• Deciding regular grammar logics with converse through first-order logic
• EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
• Graph minors. III. Planar tree-width
• Hypertableau reasoning for description logics
• Modal languages and bounded fragments of predicate logic
• Resolution decision procedures
• Resolution theorem proving
• The DL-Lite Family and Relations
• The Description Logic Handbook
• Theory and Applications of Satisfiability Testing
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

Cited in

(9)

• A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic
• Fixed-parameter tractability of disjunction-free default reasoning
• Effective method for detecting error causes from incoherent biological ontologies
• OWL reasoning: subsumption test hardness and modularity
• scientific article; zbMATH DE number 6902582 (Why is no real title available?)
• A Modal-Layered Resolution Calculus for K
• Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \)
• Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions
• Tractable reasoning using logic programs with intensional concepts

Describes a project that uses

Uses Software

• Pellet
• FaCT++
• E Theorem Prover

This page was built for publication: Consequence-based and fixed-parameter tractable reasoning in description logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490523)