ID: cs/0506005

Programming Finite-Domain Constraint Propagators in Action Rules

June 2, 2005

View on ArXiv

Similar papers 2

On the Cooperation of the Constraint Domains H, R and FD in CFLP

April 14, 2009

86% Match
S. Estévez-Martín, T. Hortalá-González, Rodríguez-Artalejo, Vado-Vírseda R. del, ... , Fernández A. J.
Programming Languages
Symbolic Computation

This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of different constraint domains equipped with their respective solvers, relying on a so-called Constraint Functional Logic Programming (CFLP) scheme. The implementation has been developed on ...

Find SimilarView on arXiv

Finite Domain Bounds Consistency Revisited

December 6, 2004

85% Match
Chiu Wo Choi, Warwick Harvey, ... , Stuckey Peter J.
Artificial Intelligence
Logic in Computer Science

A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propagators for arithmetic constraints and several global constraints in the finite integer domain. However, there has been some confusion in the definition of bounds ...

Find SimilarView on arXiv

The Ciao clp(FD) Library. A Modular CLP Extension for Prolog

January 31, 2013

85% Match
Emilio Jesús Gallego Arias, Rémy Haemmerlé, ... , Morales José F.
Programming Languages

We present a new free library for Constraint Logic Programming over Finite Domains, included with the Ciao Prolog system. The library is entirely written in Prolog, leveraging on Ciao's module system and code transformation capabilities in order to achieve a highly modular design without compromising performance. We describe the interface, implementation, and design rationale of each modular component. The library meets several design goals: a high level of modularity, allo...

Find SimilarView on arXiv

Autonomous Agents Coordination: Action Languages meet CLP(FD) and Linda

October 4, 2011

85% Match
Agostino Dovier, Andrea Formisano, Enrico Pontelli
Logic in Computer Science
Artificial Intelligence
Programming Languages

The paper presents a knowledge representation formalism, in the form of a high-level Action Description Language for multi-agent systems, where autonomous agents reason and act in a shared environment. Agents are autonomously pursuing individual goals, but are capable of interacting through a shared knowledge repository. In their interactions through shared portions of the world, the agents deal with problems of synchronization and concurrency; the action language allows the ...

Find SimilarView on arXiv

A CHR-based Implementation of Known Arc-Consistency

August 24, 2004

85% Match
Marco Alberti, Marco Gavanelli, Evelina Lamma, ... , Milano Michela
Logic in Computer Science
Artificial Intelligence

In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring the whole domains of variables before the beginning of constraint propagation may cause waste of computation time, or even obsolescence of the acquired data at the time of use. For such cases, the Interactive Constraint Satisfaction Problem (ICSP) model has been proposed as an ...

Find SimilarView on arXiv

Proceedings of the 12th International Colloquium on Implementation of Constraint and LOgic Programming Systems

February 1, 2013

85% Match
Nicos Angelopoulos, Roberto Bagnara
Programming Languages
Artificial Intelligence

This volume contains the papers presented at CICLOPS'12: 12th International Colloquium on Implementation of Constraint and LOgic Programming Systems held on Tueseday September 4th, 2012 in Budapest. The program included 1 invited talk, 9 technical presentations and a panel discussion on Prolog open standards (open.pl). Each programme paper was reviewed by 3 reviewers. CICLOPS'12 continues a tradition of successful workshops on Implementations of Logic Programming Systems,...

Find SimilarView on arXiv

ECLiPSe - from LP to CLP

December 20, 2010

85% Match
Joachim Schimpf, Kish Shen
Programming Languages

ECLiPSe is a Prolog-based programming system, aimed at the development and deployment of constraint programming applications. It is also used for teaching most aspects of combinatorial problem solving, e.g. problem modelling, constraint programming, mathematical programming, and search techniques. It uses an extended Prolog as its high-level modelling and control language, complemented by several constraint solver libraries, interfaces to third-party solvers, an integrated de...

Find SimilarView on arXiv

Planning and Scheduling in Hybrid Domains Using Answer Set Programming

January 8, 2013

84% Match
Sandeep Chintabathina
Artificial Intelligence

In this paper we present an Action Language-Answer Set Programming based approach to solving planning and scheduling problems in hybrid domains - domains that exhibit both discrete and continuous behavior. We use action language H to represent the domain and then translate the resulting theory into an A-Prolog program. In this way, we reduce the problem of finding solutions to planning and scheduling problems to computing answer sets of A-Prolog programs. We cite a planning a...

Find SimilarView on arXiv

ACLP: Integrating Abduction and Constraint Solving

March 7, 2000

84% Match
Antonis Kakas
Artificial Intelligence

ACLP is a system which combines abductive reasoning and constraint solving by integrating the frameworks of Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). It forms a general high-level knowledge representation environment for abductive problems in Artificial Intelligence and other areas. In ACLP, the task of abduction is supported and enhanced by its non-trivial integration with constraint solving facilitating its application to complex problems. Th...

Find SimilarView on arXiv

Reformulation of Global Constraints in Answer Set Programming

August 30, 2010

84% Match
Christian Drescher, Toby Walsh
Logic in Computer Science

We show that global constraints on finite domains like all-different can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformulations offer a number of other advantages beyond providing the power of global propagators to answer set programming. For example, they provide other constraints with access to the state of the propagator by sharing variables. Such sharing can be used to improve propagation between constraints. Exp...

Find SimilarView on arXiv