Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear...
The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...