The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
There is a need for agent systems that can scale to realworld applications, yet retain the clean semantic underpinning of more formal agent frameworks. We describe the SRI Procedu...
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Symbolic reasoning is a well understood and effective approach to handling reasoning over formally represented knowledge; however, simple symbolic inference systems necessarily sl...
Matthew E. Taylor, Cynthia Matuszek, Pace Reagan S...