Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes

  title={Defeasible Inclusions in Low-Complexity DLs: Preliminary Notes},
  author={Piero A. Bonatti and Marco Faella and Luigi Sauro},
In first-order logic, a theory T1 is considered stronger than another theory T2 if every formula derived from T2 is also derived from T1. Such an order relation is useful to know relative value between different theories. In the context of default logic, a theory contains default information as well as definite information. To order default theories, it is necessary to assess the information content of a default theory. To this end, we introduce a multi-valued interpretation of default theories… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 19 extracted citations

Defeasible Inclusions in Low-Complexity DLs

J. Artif. Intell. Res. • 2011
View 5 Excerpts
Highly Influenced

EL with default attributes and overriding

View 7 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 23 references

Classical negation in logic programs and disjunctive databases

New Generation Computing • 1991
View 3 Excerpts
Highly Influenced

Non-monotonic learning

View 3 Excerpts
Highly Influenced

Logics for Authorization and Security.

Logics for Emerging Applications of Databases • 2003

Pushing the EL envelope The instance problem and the most specific concept in the description logic EL w . r . t . terminological cycles with descriptive semantics

S. Brandt, C. Lutz
Proc . of the 26 th Annual German Conference on AI , KI 2003 , volume 2821 of Lecture Notes in Computer Science • 2003

scription logics of minimal knowledge and negation as failure

D. Nardi, R. Rosati
ACM Trans . Comput . Log . • 2002