Corpus ID: 221244

Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs

@inproceedings{Claen2014ExploringTB,
  title={Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs},
  author={Jens Cla{\ss}en and M. Liebenberg and G. Lakemeyer and Benjamin Zarrie{\ss}},
  booktitle={AAAI},
  year={2014}
}
The action programming language GOLOG has been found useful for the control of autonomous agents such as mobile robots. In scenarios like these, tasks are often open-ended so that the respective control programs are non-terminating. Before deploying such programs on a robot, it is often desirable to verify that they meet certain requirements. For this purpose, Clasen and Lake-meyer recently introduced algorithms for the verification of temporal properties of GOLOG programs. However, given the… Expand
On the Decidability of Verifying LTL Properties of Golog Programs
TLDR
This paper shows that for a fragment of the GOLOG language defined on top of the decidable logic C, the verification problem for linear time temporal properties becomes decidable, which extends earlier results to a more expressive fragments of the input formalism. Expand
Verifying CTL* Properties of GOLOG Programs over Local-Effect Actions
TLDR
This paper extends earlier results to identify a large, non-trivial fragment of the formalism where verification is decidable of GOLOG, and considers properties expressed in a first-order variant of the branching-time temporal logic CTL*. Expand
Chair for Automata Theory LTCS – Report On the Decidability of Verifying LTL Properties of Golog Programs ( Extended Version )
Golog is a high-level action programming language for controlling autonomous agents such as mobile robots. It is defined on top of a logic-based action theory expressed in the Situation Calculus.Expand
Symbolic Verification of Golog Programs with First-Order BDDs
TLDR
This work reports on efforts on implementing a verification algorithm for GOLOG based on fixpoint computations, a graph representation of program executions, and a symbolic representation of the state space, using a firstorder variant of OBDDs for compactly representing formulas. Expand
Non-terminating processes in the situation calculus
TLDR
This paper describes a situation calculus approach to expressing and proving properties of non-terminating programs expressed in Golog, a high level logic programming language for modeling and implementing dynamical systems. Expand
Decidable Verification of Golog Programs over Non-Local Effect Actions
TLDR
This paper introduces two new, more general classes of action theories that allow for context-sensitive, non-local, unbounded effects, i.e. actions that may affect an unbounded number of possibly unnamed objects in a state-dependent fashion. Expand
Verifying ConGolog Programs on Bounded Situation Calculus Theories
TLDR
This work reformulates the transition semantics of ConGolog to keep the bindings of "pick variables" into a separate variable environment whose size is naturally bounded by the number of variables. Expand
Situation Calculus Meets Description Logics
TLDR
This chapter highlights some of the main results and insights obtained during the collaboration between Franz Baader and Gerhard Lakemeyer in the area of decidable verification of Golog programs. Expand
Description Logic, Theory Combination, and All That
TLDR
This paper introduces a novel form of clause abstraction, a core component in the hierarchic superposition calculus for transforming clauses into a form needed for internal operation, and argues for the benefits of the resulting calculus and provides two new completeness results. Expand
Progression and Verification of Situation Calculus Agents with Bounded Beliefs
TLDR
This paper first examines progression, which captures belief state update resulting from actions in the situation calculus, and shows that, for bounded action theories, progression, and hence belief states, can always be represented as a bounded first-order logic theory. Expand
...
1
2
...

References

SHOWING 1-10 OF 40 REFERENCES
On the Decidability of Verifying LTL Properties of Golog Programs
TLDR
This paper shows that for a fragment of the GOLOG language defined on top of the decidable logic C, the verification problem for linear time temporal properties becomes decidable, which extends earlier results to a more expressive fragments of the input formalism. Expand
A Logic for Non-Terminating Golog Programs
TLDR
It is shown how properties of non-terminating programs can be formulated in the logic and, for a subset of it, how existing ideas from symbolic model checking in temporal logic can be applied to automatically verify program properties. Expand
Verification of Golog Programs over Description Logic Actions
TLDR
This paper introduces a variant of Golog where basic actions are defined using such a DL-based formalism, and shows that the verification problem for such programs is decidable. Expand
Planning and Verification in the agent language Golog
TLDR
This thesis proposes an integration of Golog and planning where planning subtasks encountered during the execution of a Golog program are referred to a PDDL planner, thus combining Golog’s expressiveness with the efficiency of modern planners. Expand
GOLOG: A Logic Programming Language for Dynamic Domains
TLDR
A new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied axioms about the preconditions and effects of actions and the initial state of the world is proposed. Expand
Verifying Properties of Infinite Sequences of Description Logic Actions
TLDR
This paper abstracts from the actual execution sequences of a non-terminating program by considering infinite sequences of actions defined by a Buchi automaton, and assumes that the logic underlying the action formalism is a decidable description logic rather than full first-order predicate logic. Expand
Symbolic Model Checking: 10^20 States and Beyond
TLDR
It is shown how the novel mu-calculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satisfiability of linear-time temporal logic formulas, strong and weak observational equivalence of finite transition systems, and language containment of finite omega -automata. Expand
ConGolog, a concurrent programming language based on the situation calculus
TLDR
A formal definition in the situation calculus of such a programming language is presented and illustrated with some examples that includes facilities for prioritizing the execution of concurrent processes, interrupting the execution when certain conditions become true, and dealing with exogenous actions. Expand
Situation Calculus Based Programs for Representing and Reasoning about Game Structures
TLDR
A logical framework for specifying these types of problems/games based on the situation calculus and ConGolog is developed, which incorporates game-theoretic path quantifiers as in ATL. Expand
Logic-based robot control in highly dynamic domains
TLDR
The robot programming and planning language Readylog, a Golog dialect, is presented, which was developed to support the decision making of robots acting in dynamic real-time domains, such as robotic soccer. Expand
...
1
2
3
4
...