Tractable approximate deduction for OWL
From MaRDI portal
Publication:274420
DOI10.1016/j.artint.2015.10.004zbMath1352.68233OpenAlexW2273684054MaRDI QIDQ274420
Jeff Z. Pan, Yuting Zhao, Yuan Ren
Publication date: 22 April 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2164/8741
Related Items (2)
Extensions of unification modulo ACUI ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data complexity of query answering in description logics
- Decidability of SHIQ with complex role inclusion axioms
- A four-valued semantics for terminological logics
- On the complexity of entailment in propositional multivalued logics
- EXPtime tableaux for ALC
- Tractable reasoning via approximation
- Optimizing terminological reasoning for expressive description logics
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- $\mathcal{EL}$ -ifying Ontologies
- Efficient description logic reasoning in Prolog: The DLog system
- Hypertableau Reasoning for Description Logics
- Hard examples for resolution
- Knowledge compilation and theory approximation
- Practical reasoning for very expressive description logics
- Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
- Advances in Artificial Intelligence – SBIA 2004
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
This page was built for publication: Tractable approximate deduction for OWL