Classic heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree, or an acyclic graph (AO*). In this paper, we...
In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT plan...
We explore a framework for argumentation (based on classical logic) in which an argument is a pair where the first item in the pair is a minimal cons...
In this paper we will show that certain networks called 'inhibition nets' may be regarded as cognitive agents drawing nonmonotonic inferences. It wil...
Given a propositional theory T and a proposition q, a sufficient condition of q is one that will make q true under T, and a necessary condition of q...
