Share This Author
A Logic for Non-Terminating Golog Programs
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.
A Situation-Calculus Semantics for an Expressive Fragment of PDDL
An alternative semantics for an expressive fragment of PDDL within the situation calculus is proposed, which is purely declarative, making it amenable to an analysis in terms of logical entailments and facilitates the comparison with and mapping to other formalisms that are defined on top of the same logic, such as the agent control language Golog.
Verification of Knowledge-Based Programs over Description Logic Actions
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 is considered, and a corresponding new DL-based action language is introduced that allows for representing both physical and sensing actions.
Foundations for Knowledge-Based Programs using ES
This paper shows that, by moving to a new situation calculus recently proposed by Lakemeyer and Levesque, one cannot only reconstruct Reiter's foundations for knowledge-based programs but can significantly go beyond them, which includes removing the above restrictions and more.
Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs
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.
Towards an Integration of Golog and Planning
An integration of Golog and planning is proposed in the sense that planning problems, formulated as part of a Golog program, are solved by a modern planner during the execution of the program.
Decidable Verification of Golog Programs over Non-Local Effect Actions
This paper presents a new, more general class of action theories (called acyclic) that allows 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.
Verifying CTL* Properties of GOLOG Programs over Local-Effect Actions
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*.
Planning and Verification in the agent language Golog
- Jens Claßen
- Computer Science
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.
Platas—Integrating Planning and the Action Language Golog
- Jens Claßen, G. Röger, G. Lakemeyer, B. Nebel
- Computer ScienceKI - Künstliche Intelligenz
- 1 February 2012
The theoretical foundation is laid by a mapping between the planning language Pddl and the Situation Calculus, which is underlying Golog, together with a study of how these formalisms relate in terms of expressivity.