We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Abstract. We initiate a purely algebraic study of Ehrhard and Regnier’s resource λ-calculus, by introducing three equational classes of algebras: resource combinatory algebras, ...
: Entities in engineering design databases need to evolve in both structure and behavior. Such a need is not well addressed by object-oriented data models based on the class concep...
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...