Decidability of SHIQ with complex role inclusion axioms

DOI10.1016/j.artint.2004.06.002zbMath1086.68129OpenAlexW2119478850WikidataQ56988851 ScholiaQ56988851MaRDI QIDQ814639

Ian Horrocks, Ulrike Sattler

Publication date: 7 February 2006

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

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

zbMATH Keywords

Automated reasoningDescription logicsTableau algorithm

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (19)

Tractable approximate deduction for OWL ⋮ Representing ontologies using description logics, description graphs, and rules ⋮ Modular materialisation of Datalog programs ⋮ Reasoning within intuitionistic fuzzy rough description logics ⋮ The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm ⋮ Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics ⋮ A framework for intuitionistic grammar logics ⋮ Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \) ⋮ Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ An Extension of Complex Role Inclusion Axioms in the Description Logic $\mathcal{SROIQ}$ ⋮ A Tableau Calculus for Regular Grammar Logics with Converse ⋮ Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs ⋮ CTL\(^\ast\) with graded path modalities ⋮ ExpTime tableau decision procedures for regular grammar logics with converse ⋮ Reasoning within expressive fuzzy rough description logics ⋮ Deciding regular grammar logics with converse through first-order logic ⋮ HermiT: an OWL 2 reasoner ⋮ Decidability of SHIQ with complex role inclusion axioms

Uses Software

• Racer

Cites Work

• Attributive concept descriptions with complements
• Decidability of SHIQ with complex role inclusion axioms
• On the expressivity of feature logics with negation, functional uncertainty, and sort equations
• PSPACE Reasoning for Graded Modal Logics
• The Complexity of Regularity in Grammar Logics and Related Modal Logics
• The undecidability of the domino problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of SHIQ with complex role inclusion axioms