Least Commitment on Variable Binding in Presence of Incomplete Knowledge

  title={Least Commitment on Variable Binding in Presence of Incomplete Knowledge},
  author={Rosy Barruffi and Evelina Lamma and Paola Mello and Michela Milano},
Constraint Satisfaction techniques have been recognized to be effective tools for increasing the efficiency of least commitment planners. We focus on least commitment on variable binding. A constraint based approach for this issue has been previously proposed by Yang and Chan [21]. In this setting, the planning problem is mapped onto a Constraint Satisfaction Problem. Its variables represent domain objects and are defined on a finite domain of values; constraints remove inconsistent values from… 
Interactive Constraints for Plan Construction and Execution
This work proposes a solution where a planner and an executing component are able to face dynamic changes in order to retrieve knowledge on the environment only when needed, thus delaying as much as possible data acquisition and minimizing, at the same time, data to be managed.
A Constraint Handling Rules Implementation for Known-Arc-Consistency in Interactive Constraint Satisfaction Problems
A two sorted CLP language to express and solve ICSPs, and its implementation in the Constraint Handling Rules (CHR) language, a declarative language particularly suitable for high level implementation of constraint solvers.
Dealing with incomplete knowledge on CLP(FD) variable domains
This article extends the CLP(FD) language by combining it with a new sort (called Incrementally specified Sets, I-Set), and describes a propagation algorithm based on known domain elements, and theoretically compare it with arc-consistency.
From eager to lazy constrained data acquisition: A general framework
An extension of the widely used CSP model, called Interactive Constraint Satisfaction Problem (ICSP) model is introduced which is parametric in the number of acquisitions performed at each step and some applications which can benefit from the proposed solution are discussed.
A CHR-based implementation of known arc-consistency
This paper shows how a solver for the two sorted CLP language, defined in previous work, has been implemented in the Constraint Handling Rules (CHR) language, a declarative language particularly suitable for high level implementation of constraint solvers.
Planning and Execution in Dynamic Environments
An architecture for planning and executing in complex and dynamic environments characterized by large amount of data, too wide and dynamic to be completely stored and maintained up-to-date is presented.
Exploiting Constraints for Domain Managing in CLP(FD)
A CLP language that treats domains as first-class objects, and allows the definition of domains through constraints in a CLP(FD) environment is introduced, and operations and properties on variables and domains are defined.
Performance Measurement of Interactive CSP SearchAlgorithms
This work shows how to esteem the eeciency of an ICSP solving algorithm, considering the computational eeort of both the subsystems and the communication cost, and shows that the total eeorts can be considered as a combination of four diierent counters that depend only on the given CSP problem.
A Multi-Agent Approach to Planning
The exploitation of the agent t e c hnology allows for an eecient and reliable distributed planning activity and is applied to a constraint-based planner called PlanNet (Planning for the Network) 1.
Cost-Driven Interactive CSP with Constraint Relaxation
We revisit the Interactive CSP framework (ICSP) and propose a new, somewhat more general model, which we call Cost-Driven Interactive CSP (CICSP). First, we extend the value acquisition by a more


Delaying Variable Binding Commitments in Planning
This paper presents an extension to the classical partial-order planners by associating every variable with a finite domain of values and applies constraint satisfaction routines to check for the consistency of variable bindings.
Dynamic Constraint Satisfaction Problems
This paper presents a language for expressing four types of activity constraints in terms of variable values and variables being considered, and describes an implemented algorithm that enables tight interaction between constraints about variable activity and constraints aboutVariable values.
Using Disjunctive orderings instead of Conflict Resolution in Partial order planning
An approach involving constraint propagation which allows incremental handling of disjunctive constraints and is shown how this approach can be easily implemented on top of UCPOP planner and empirical results demonstrating the utility of this idea are discussed.
An Introduction to Least Commitment Planning
A progression of least commitment planners is summarized, starting with one that handles the simple STRIPS representation and ending with UCPOP, a planner that manages actions with disjunctive precondition, conditional effects, and universal quantification over dynamic universes.
Constraint Propagation and Value Acquisition: Why we should do it Interactively
An Interactive Constraint Satisfaction Problem (ICSP) model is introduced as extension of the widely used CSP model, which retrieves variable domain values when needed during the resolution process by means of Interactiveconstraints, which retrieve (possibly consistent) information.
Planning for Contingencies: A Decision-based Approach
The explicit representation of decisions in Cassandra allows a coherent approach to the problems of contingent planning, and provides a solid base for extensions such as the use of diffierent decision-making procedures.
A Theory of Conflict Resolution in Planning
Deferred Planning and Sensor Use
This work considers problems where some crucial information is missing at plan time but can be obtained from sensors during execution through deferred planning, and presents early results of a comparative study of strategies for deciding which plan steps to defer.
Passive and active decision postponement in plan generation
In "least-commitment" decision making, decisions are postponed until constraints force them to be made; any decision made when it is not forced is an "early commitment." Partial-Order Causal Link
parcPlan: A Planning Architecture with Parallel Actions, Resources and Constraints
The generic planning architecture parcPLAN is described, which uses constraint-solving to perform both temporal and non-temporal reasoning, and performs well on large-scale planning and resource allocation problems.