On Progression and Query Evaluation in First-Order Knowledge Bases with Function Symbols

In a seminal paper, Lin and Reiter introduced the notion of progression of basic action theories. Unfortunately, progression is second-order in general. Recently, Liu and Lakemeyer improve on earlier results and show that for the local-effect and normal actions case, progression is computable but may lead to an exponential blow-up. Nevertheless, they show that for certain kinds of expressive first-order knowledge bases with disjunctive information, called proper, it is efficient. However, answering queries about the resulting state is still undecidable. In this paper, we continue this line of research and extend proper KBs to include functions. We prove that their progression wrt local-effect, normal actions, and range-restricted theories, is first-order definable and efficiently computable. We then provide a new logically sound and complete decision procedure for certain kinds of queries.

[1]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[2]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[3]  Hans Zantema,et al.  Generalizing DPLL and satisfiability for equalities , 2007, Inf. Comput..

[4]  Gerhard Lakemeyer,et al.  The logic of knowledge bases , 2000 .

[5]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[6]  Gerhard Lakemeyer.  Evaluation-Based Reasoning with Disjunctive Information in First-Order Knowledge Bases , 2002, KR.

[7]  Patrick Doherty,et al.  Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas , 2001, IJCAI.

[8]  R. Reiter,et al.  Forget It ! , 1994 .

[9]  Tricia Walker,et al.  Computer science , 1996, English for academic purposes series.

[10]  G. E. Hughes,et al.  An introduction to modal logic, 2e éd., 1 vol , 1973 .

[11]  Fangzhen Lin,et al.  How to Progress a Database , 1997, Artif. Intell..

[12]  Gerhard Lakemeyer,et al.  Point-based value iteration: an anytime algorithm for POMDPs , 2003, IJCAI 2003.

[13]  Hector J. Levesque,et al.  Progressing basic action theories with non-local effect actions , 2009 .

[14]  Gerhard Lakemeyer,et al.  A Logic of Limited Belief for Reasoning with Disjunctive Information , 2004, KR.

[15]  Bart Selman,et al.  Satisfiability Solvers , 2008, Handbook of Knowledge Representation.

[16]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[17]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.