• Publications
  • Influence
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
A Situation-Calculus Semantics for an Expressive Fragment of PDDL
TLDR
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. 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
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
Towards an Integration of Golog and Planning
TLDR
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. Expand
Foundations for Knowledge-Based Programs using ES
TLDR
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. 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
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
Platas—Integrating Planning and the Action Language Golog
TLDR
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. 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
...