Corpus ID: 16441175

A Logic for Non-Terminating Golog Programs

@inproceedings{Claen2008ALF,
  title={A Logic for Non-Terminating Golog Programs},
  author={Jens Cla{\ss}en and G. Lakemeyer},
  booktitle={KR},
  year={2008}
}
Typical Golog programs for robot control are non-terminating. Analyzing such programs so far requires meta-theoretic arguments involving complex fix-point constructions. In this paper we propose a logic based on the situation calculus variant ES, which includes elements from branching time, dynamic and process logics and where the meaning of programs is modelled as possibly infinite sequences of actions. We show how properties of non-terminating programs can be formulated in the logic and, for… 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
Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs
TLDR
This paper shows how decidability can be obtained by suitably restricting the underlying base logic, the effect axioms for primitive actions, and the use of actions within GOLOG programs, and shows that dropping these restrictions immediately leads to undecidability of the verification problem. Expand
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
TLDR
This paper introduces a logic that allows to express properties of Golog programs using operators from temporal logics while retaining the full first-order expressiveness of 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
A Logic for Specifying Metric Temporal Constraints for Golog Programs
TLDR
Based on ES and ESG, modal variants of the Situation Calculus, the logic t-ESG is proposed, a logic which allows the specification of metric temporal constraints for Golog programs and a comparison to ESG is provided and it is shown that Metric Temporal Logic (MTL) can be embedded into t- ESG. 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
On the Complexity of Verifying Timed Golog Programs over Description Logic Actions ( Extended Version )
Golog programs allow to model complex behaviour of agents by combining primitive actions defined in a Situation Calculus theory using imperative and non-deterministic programming language constructs.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
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
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
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
A hoare-style proof system for robot programs
TLDR
This paper presents a novel Hoare-style proof system for partial correctness of Golog programs, and proves total soundness of the proof system, and relative completeness of a subsystem of it for procedureless GOLOG programs. Expand
A model checker for verifying ConGolog programs
TLDR
This work in progress on a model checker for verifying ConGolog programs, which applies the techniques from XSB tabling and the µ-calculus, to overcome the challenge of verifying complex non-terminating programs, in a terminating time. 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
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
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
TLDR
This paper extends automata-theoretic LTL model-checked to reasoning about a class of multiple-valued logics, and shows that model-checking over FTOs is reducible to classical model- checking, and thus can be implemented in SPIN. Expand
Precondition Control and the Progression Algorithm
TLDR
A procedure is introduced for extracting conditions which can then be evaluated on plan prefixes for enforcing search control and it is shown that these conditions eliminate exactly the same planprefixes as the Progression algorithm of the TLPlan system. Expand
Semantics for a useful fragment of the situation calculus
TLDR
It is argued that the fragment of the situation calculus represented by ES is rich enough to handle the basic action theories defined by Reiter as well as Golog and it is shown that in the full second-order version of ES, almost all of the scenario calculus can be accommodated. Expand
Model checking procedures for infinite state systems
  • N. Bogunovic, E. Pek
  • Computer Science
  • 13th Annual IEEE International Symposium and Workshop on Engineering of Computer-Based Systems (ECBS'06)
  • 2006
TLDR
This paper has used abstract state space and NuSMV tool to verify safety properties of infinite state mutual exclusion protocols and has shown that the restricted class is expressive enough to specify basic safety properties. Expand
Property Persistence in the Situation Calculus
TLDR
An algorithm for reducing universally quantified situation calculus queries to a form more amenable to automated reasoning is developed, including checking for goal impossibility and reasoning about knowledge with partial observability of actions. Expand
...
1
2
3
...