We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
We discuss the problem of generating text that preserves certain ambiguities, a capability that is useful in applications such as machine translation. We show that it is relativel...
We explore the expressive power of a recently developed qualitative region-based geometry and apply it to the problem of representing and reasoning about the motion of rigid bodie...
Brandon Bennett, Anthony G. Cohn, Paolo Torrini, S...
We present a general algorithm for synthesizing state invariants that speed up automated planners and have other applications in reasoning about change. Invariants are facts that ...
A serious shortcoming of many Description Logic based knowledge representation systems is the inadequacy of their query languages. In this paper we present a novel technique that ...