Unification of concept terms in description logics
Journal of Symbolic Computation
Undecidability of the unification and admissibility problems for modal and description logics
ACM Transactions on Computational Logic (TOCL)
Usability Issues in Description Logic Knowledge Base Completion
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Semantic matchmaking as non-monotonic reasoning: a description logic approach
Journal of Artificial Intelligence Research
Explaining subsumption in description logics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Abductive matchmaking using description logics
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A tableaux-based method for computing least common subsumers for expressive description logics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Forgetting and uniform interpolation in large-scale description logic terminologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Effective query rewriting with ontologies over DBoxes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
OWL-DL as a power tool to model negotiation mechanisms with incomplete information
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Computing least common subsumers in description logics
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Automating competence management through non-standard reasoning
Engineering Applications of Artificial Intelligence
Semantic matchmaking and ranking: beyond deduction in retrieval scenarios
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a few. Although some reasoning services have been unified already (e.g., LCS and Most Specific Concept), the definition of non-standard problems and the computation that solve them are very different from each other. We propose to unify the definitions of non-standard services as special Second-order sentences in DLs; when the solution concepts are optimal with respect to some preferences, a fixpoint replaces the Second-order quantification. Moreover, we propose to combine the well-known Tableaux calculi for DLs with rules that compute substitutions of Concept Variables. We prove soundness and completeness of the combined calculus and we give a sufficient condition for termination, which covers some non-trivial cases.