Journal of Logic Programming
Minimal belief and negation as failure
Artificial Intelligence
A comparative study of open default theories
Artificial Intelligence
Limited reasoning in first-order knowledge bases with full introspection
Artificial Intelligence
A Uniform Tableaux Method for Nonmonotonic Modal Logics
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Non-first-order features in concept languages
AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence
Reasoning with minimal belief and negation as failure: algorithms and complexity
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
Complete and Incomplete Knowledge in Logical Information Systems
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Towards First-Order Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
The description logic handbook
Position paper: a comparison of two modelling paradigms in the Semantic Web
Proceedings of the 15th international conference on World Wide Web
A comparison of two modelling paradigms in the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
Semantic matchmaking as non-monotonic reasoning: a description logic approach
Journal of Artificial Intelligence Research
The complexity of circumscription in description logic
Journal of Artificial Intelligence Research
Defeasible inclusions in low-complexity DLs: preliminary notes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ALC + T: a Preferential Extension of Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Reasoning with minimal belief and negation as failure: algorithms and complexity
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Rational closure for defeasible description logics
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
EL with default attributes and overriding
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Epistemic querying of OWL knowledge bases
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Negation, opposition, and possibility in logical concept analysis
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Defeasible inclusions in low-complexity DLs
Journal of Artificial Intelligence Research
On the complexity of EL with defeasible inclusions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
ALC + T: a Preferential Extension of Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
A non-monotonic Description Logic for reasoning about typicality
Artificial Intelligence
| Hi-index | 0.00 |
We present Autoepistemic Description Logics (ADLs), in which the language of Description Logics is augmented with modal operators interpreted according to the nonmonotonic logic MKNF. We provide decision procedures for query answering in two very expressive ADLs. We show their representational features by addressing defaults, integrity constraints, role and concept closure. Hence, ADLs provide a formal characterization of a wide variety of nonmonotonic features commonly available in frame-based systems and needed in the development of practical applications.