Deductive Planning with Temporal Constraints
نویسندگان
چکیده
Temporal Action Logic is a well established logical formalism for reasoning about action and change using an explicit time representation that makes it suitable for applications that involve complex temporal reasoning. We take advantage of constraint satisfaction technology to facilitate such reasoning through temporal constraint networks. Extensions are introduced that make generation of action sequences possible, thus paving the road for interesting applications in deductive planning. The extended formalism is encoded as a logic program that is able to realize a least commitment strategy that generates partial order plans in the context of both qualitative and quantitative temporal constraints.
منابع مشابه
A Reified Temporal Logic For Nonlinear Planning
Deductive planning treats planning as a reasoning process within a formal logic. Several formal logics have been applied in various deductive planning systems, but none is completely satisfactory and widely accepted by planning researchers. Almost all the formal logics applied in deductive planning are proposed for more general purpose than planning. Usually, the more general and the more expre...
متن کاملConstraint Logic Planning
Deductive planning provides a rigorous approach for planning, such that the capabilities and limitations of the planning systems can be clearly deened. However, most of the deductive planners suuer from the frame problem and they are linear planners. This report presents a novel nonlinear deductive planning framework: constraint logic planning. Procedurally speaking, nonlinear planning is an ac...
متن کاملDeductive Planning and Plan Reuse in a Command Language Environment
In this paper we introduce a deductive planning system currently being develop ed as the kernel of an intelligent help system. It consists of a deductive planner and a plan reuse component and with that provides planning from first as well as planning from second principles . Both components rely upon an interval-based temporal logic. The deductive formalisms realizing plan formation from forma...
متن کاملTemporal Deductive Databases: Data Manipulation and Consistency
The notion of deductive database is generalized by extending the rst-order language, used to formulate facts, rules and constraints, to a rst-order language involving time operators. A deductive database based on such an extended language is called temporal. In this paper, we rst introduce two additional time operators, one to reference past tenses, the other to reference future tenses. Then, t...
متن کاملDeductive Planning and Composite Actions in Temporal Action Logic
Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. We introduce a translation from a subset of Temporal Action Lo...
متن کامل