A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Rational Closure for Defeasible Description Logics
[chapter]
2010
Lecture Notes in Computer Science
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means of a simple method in the context of propositional logic. We then propose an application of our approach to rational closure in the field of Description Logics, an important knowledge representation formalism, and provide a simple decision procedure for this case.
doi:10.1007/978-3-642-15675-5_9
fatcat:hgqs6zxorjcqvaoldfe4e5xgmq