ALE defeasible description logic

Authors:
Pakornpong Pothipruk;Guido Governatori
Affiliations:
School of ITEE, University of Queensland, Australia;School of ITEE, University of Queensland, Australia
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 4
Cited 0

Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Representation results for defeasible logic

ACM Transactions on Computational Logic (TOCL)
Propositional defeasible logic has linear complexity

Theory and Practice of Logic Programming
A formal ontology reasoning with individual optimization: a realization of the semantic web

WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of Semantic Web strengths is the ability to address incomplete knowledge. However, at present, it cannot handle incomplete knowledge directly. Also, it cannot handle non-monotonic reasoning. In this paper, we extend $\mathcal{ALC^{-}}$ Defeasible Description Logic with existential quantifier, i.e., $\mathcal{ALE}$ Defeasible Description Logic. Also, we modify some parts of the logic, resulting in an increasing efficiency in its reasoning.