Verifying CTL* Properties of GOLOG Programs over Local-Effect Actions

@inproceedings{Zarrie2014VerifyingCP,
  title={Verifying CTL* Properties of GOLOG Programs over Local-Effect Actions},
  author={Benjamin Zarrie{\ss} and Jens Cla{\ss}en},
  booktitle={ECAI},
  year={2014}
}
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. Before a program is deployed onto an actual robot and executed in the physical world, it is desirable, if not crucial, to verify that it meets certain requirements (typically expressed through temporal formulas) and thus indeed exhibits the desired behaviour. However, due to the high (first-order… 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 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
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
Decidable Verification of Knowledge-Based Programs over Description Logic Actions with Sensing
TLDR
This extended abstract considers the class of so-called knowledge-based programs, which are suited for more realistic scenarios where the agent possesses only incomplete information about its surroundings and has to use sensing in order to acquire additional knowledge at run-time. 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
Verification of Knowledge-Based Programs over Description Logic Actions
TLDR
This paper considers a setting where an agent is equipped with a Description Logic knowledge base providing general domain knowledge and an incomplete description of the initial situation, and introduces a corresponding new DL-based action language that allows for representing both physical and sensing actions. 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
First-order μ-calculus over generic transition systems and applications to the situation calculus
TLDR
It is shown that, when the dynamic system stores only a bounded number of objects in each state, a finite abstraction can be constructed that is faithful for μ L, yielding decidability of verification, and notably implies that first-order ltl cannot be captured by μ L. Expand
On First-Order μ-Calculus over Situation Calculus Action Theories
TLDR
This paper considers μLa and μLp, the two variants of μ-calculus introduced in the literature for verification of data-aware processes, and proves decidability of verification of μLa properties over bounded action theories, using finite faithful abstractions. 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
...
1
2
...

References

SHOWING 1-10 OF 21 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
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
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
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 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
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
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
Integrating Description Logics and Action Formalisms: First Results
TLDR
This paper performs a detailed investigation of how the choice of the DL influences the complexity of the standard reasoning tasks executability and projection in the corresponding action formalism. Expand
Description Logic Knowledge and Action Bases
TLDR
This work addresses verification of temporal properties expressed in a variant of first-order µ-calculus with quantification across states and shows decidability of verification, under a suitable restriction inspired by the notion of weak acyclicity in data exchange. Expand
A description logic based situation calculus
  • Y. Gu, M. Soutchanski
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2010
TLDR
It is shown that the regression operator in this modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers can be defined similarly to regression in Reiter’s version ofThe situation calculus. Expand
...
1
2
3
...