We present a simple and concise semantics for temporal planning. Our semantics are developed and formalised in the logic of the interactive theorem prover Isabelle/HOL. We derive from those semantics a validation algorithm for temporal planning and show, using a formal proof in Isabelle/HOL, that this validation algorithm implements our semantics. We experimentally evaluate our verified validation algorithm and show that it is practical
Although satisfiability checking is known to be an effective approach in classical planning, it has ...
We describe a verification framework for I/O automata in Isabelle. It includes a temporal logic, pro...
A class of interval-based temporal languages for uniformly representing and reasoning about actions ...
We present a simple and concise semantics for temporal planning. Our semantics are developed and for...
Temporal planning is an active research area of Artificial Intelligence because of its many applicat...
Within the timeline-based framework, planning problems are modeled as sets of independent, but inter...
One kind of temporal reasoning is temporal projection---the computation of the consequences of a set...
A class of interval-based temporal languages for uniformly representing and reasoning about actions ...
Timeline-based planners have been shown quite successful in addressing real world problems. Neverthe...
In this paper we present a theory for reasoning about actions which is based on Dynamic Linear Time ...
Timeline-based planning techniques have demonstrated wide application possibilities in heterogeneous...
The synthesis of flexible temporal plans has demonstrated wide applications possibilities in heterog...
Formal verification of hardware and software systems in-volves proving or disproving the correctness...
A formal language for representing and reasoning about time, actions and plans in a uniform way is p...
The attention for the area of formal methods has significantly increased in AI over last years. The ...
Although satisfiability checking is known to be an effective approach in classical planning, it has ...
We describe a verification framework for I/O automata in Isabelle. It includes a temporal logic, pro...
A class of interval-based temporal languages for uniformly representing and reasoning about actions ...
We present a simple and concise semantics for temporal planning. Our semantics are developed and for...
Temporal planning is an active research area of Artificial Intelligence because of its many applicat...
Within the timeline-based framework, planning problems are modeled as sets of independent, but inter...
One kind of temporal reasoning is temporal projection---the computation of the consequences of a set...
A class of interval-based temporal languages for uniformly representing and reasoning about actions ...
Timeline-based planners have been shown quite successful in addressing real world problems. Neverthe...
In this paper we present a theory for reasoning about actions which is based on Dynamic Linear Time ...
Timeline-based planning techniques have demonstrated wide application possibilities in heterogeneous...
The synthesis of flexible temporal plans has demonstrated wide applications possibilities in heterog...
Formal verification of hardware and software systems in-volves proving or disproving the correctness...
A formal language for representing and reasoning about time, actions and plans in a uniform way is p...
The attention for the area of formal methods has significantly increased in AI over last years. The ...
Although satisfiability checking is known to be an effective approach in classical planning, it has ...
We describe a verification framework for I/O automata in Isabelle. It includes a temporal logic, pro...
A class of interval-based temporal languages for uniformly representing and reasoning about actions ...
DOI
Add to ORKG