A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Complexity of Circumscriptive Inference in Post's Lattice
[chapter]

2009
*
Lecture Notes in Computer Science
*

Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which allows to conclude that the facts derivable from a given knowledge base are all facts that satisfy a given property. In this paper, we study the computational complexity of several formalizations of inference in propositional circumscription for the case that the knowledge base is described by a propositional theory

doi:10.1007/978-3-642-04238-6_25
fatcat:nclnbcn5q5hanhknwawmkifzai