Bidirectional Answer Set Programs with Function Symbols

Current Answer Set Programming (ASP) solvers largely build on logic programming without function symbols. This limitation makes ASP decidable, but greatly complicates the modeling of indefinite time, recursive data structures (e.g., lists), and infinite processes and objects in general. Recent research thus aims at finding decidable fragments of ASP with function symbols and studying their complexity. We identify bidirectional ASP programs as an expressive such fragment that is useful, e.g., for reasoning about actions involving both the future and the past. We tightly characterize the computational complexity of bidirectional programs and of some of their subclasses, addressing the main reasoning tasks. Our results also imply that the recently introduced FDNC programs can be extended by inverse predicates while retaining decidability, but computational costs are unavoidably higher.

[1]  Piero A. Bonatti,et al.  On Finitely Recursive Programs , 2007, ICLP.

[2]  Gerhard Winkler,et al.  Image analysis, random fields and dynamic Monte Carlo methods: a mathematical introduction , 1995, Applications of mathematics.

[3]  Sebastian Thrun,et al.  A Probabilistic On-Line Mapping Algorithm for Teams of Mobile Robots , 2001, Int. J. Robotics Res..

[4]  Anand Rangarajan,et al.  A new point matching algorithm for non-rigid registration , 2003, Comput. Vis. Image Underst..

[5]  Kurt Konolige,et al.  Incremental mapping of large cyclic environments , 1999, Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375).

[6]  Sebastian Thrun,et al.  Learning Hierarchical Object Maps of Non-Stationary Environments with Mobile Robots , 2002, UAI.

[7]  Michael Bosse,et al.  Calibrated, Registered Images of an Extended Urban Area , 2003, International Journal of Computer Vision.

[8]  Giovambattista Ianni,et al.  Computable Functions in ASP: Theory and Implementation , 2008, ICLP.

[9]  Michael I. Miller,et al.  Landmark matching on brain surfaces via large deformation diffeomorphisms on the sphere , 1999, Medical Imaging.

[10]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[11]  T. Stephenson.  Image analysis , 1992, Nature.

[12]  E. Groves.  A Dissertation ON , 1928 .

[13]  Arthur B. Markman,et al.  Knowledge Representation , 1998 .

[14]  Peter Szolovits,et al.  What Is a Knowledge Representation? , 1993, AI Mag..

[15]  Lawrence H. Staib,et al.  Shape-based 3D surface correspondence using geodesics and local geometry , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[16]  Jan Chomicki,et al.  Finite representation of infinite query answers , 1993, TODS.

[17]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[18]  Nathaniel E. Helwig,et al.  An Introduction to Linear Algebra , 2006 .

[19]  Victor W. Marek,et al.  The Stable Models of a Predicate Logic Program , 1994, J. Log. Program..

[20]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[21]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

[22]  Tommi Syrjänen.  Omega-Restricted Logic Programs , 2001, LPNMR.

[23]  Isabelle Herlin,et al.  Surface Matching with Large Deformations and Arbitrary Topology: A Geodesic Distance Evolution Scheme on a 3-Manifold , 2000, ECCV.

[24]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[25]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[27]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[28]  Evangelos E. Milios,et al.  Globally Consistent Range Scan Alignment for Environment Mapping , 1997, Auton. Robots.

[29]  Nicholas Ayache,et al.  3D-2D Projective Registration of Free-Form Curves and Surfaces , 1997, Comput. Vis. Image Underst..

[30]  Thomas Eiter,et al.  \mathbbFDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols , 2007, LPAR.