A Temporal Logic for Planning under Uncertainty

Dealing with uncertainty in the context of planning has been an active research subject in AI. Addressing the case when uncertainty evolves over time can be difficult. In this work, we provide a solution to this problem by proposing a temporal logic to reason about quantities and probability. For this logic, we provide a PSPACE SAT algorithm together with a complete calculus. The algorithm enables us to perform planning under uncertainty via SAT, extending a technique used for classic planning. We can show that any obtained plan will have certain properties (desired or undesired). The calculus can also be used to derive the impossibility of a plan, given a set of specifications.

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

[2]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[3]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[4]  Rohit Parikh,et al.  A Decision Procedure for the Propositional µ-Calculus , 1983, Logic of Programs.

[5]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[6]  Ronald Fagin,et al.  A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[7]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

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

[9]  Ronald Fagin,et al.  Reasoning about knowledge and probability , 1988, JACM.

[10]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[11]  Igor Walukiewicz,et al.  Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[12]  Igor Walukiewicz,et al.  Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..

[13]  Amílcar Sernadas,et al.  Reasoning About Quantum Systems , 2004, JELIA.

[14]  Ronen I. Brafman,et al.  Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..

[15]  António Pacheco,et al.  Probabilistic Situation Calculus , 2001, Annals of Mathematics and Artificial Intelligence.

[16]  Frank Ciesinski,et al.  On Probabilistic Computation Tree Logic , 2004, Validation of Stochastic Systems.

[17]  P. Mateus,et al.  Exogenous Semantics Approach to Enriching Logics , 2005 .

[18]  Blai Bonet,et al.  Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and Its Application to MDPs , 2006, ICAPS.

[19]  Amílcar Sernadas,et al.  Weakly complete axiomatization of exogenous quantum propositional logic , 2005, Inf. Comput..

[20]  Jan Kretínský,et al.  The Satisfiability Problem for Probabilistic CTL , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[21]  F. Teichteil-Königsbuch,et al.  RFF : A Robust , FF-Based MDP Planning Algorithm for Generating Policies with Low Probability of Failure , 2008 .

[22]  Jussi Rintanen,et al.  Planning as satisfiability: Heuristics , 2012, Artif. Intell..