Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
We describe a new approach to default reasoning, based on a principle of indi erence among possible worlds. We interpret default rules as extreme statistical statements, thus obta...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
In this paper, we present an action language which is called AP oss in order to perform reasoning about actions under uncertainty. This language is based on a possibilistc logic pr...
Juan Carlos Nieves, Mauricio Osorio, Ulises Cort&e...