We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Recognition of complex activities from surveillance video requires detection and temporal ordering of its constituent "atomic" events. It also requires the capacity to ro...