» » Constraint Satisfaction in Logic Programming

Download Constraint Satisfaction in Logic Programming fb2

by Pascal Van Hentenryck

  • ISBN: 0262081814
  • Category: Technology
  • Author: Pascal Van Hentenryck
  • Subcategory: Computer Science
  • Other formats: txt docx docx lit
  • Language: English
  • Publisher: The MIT Press; First Edition edition (March 23, 1989)
  • Pages: 240 pages
  • FB2 size: 1942 kb
  • EPUB size: 1678 kb
  • Rating: 4.6
  • Votes: 816
Download Constraint Satisfaction in Logic Programming fb2

Van Hentenryck proposes a new approach to solving discrete combinatorial problems using these techniques.

Pascal Van Hentenryck. Van Hentenryck proposes a new approach to solving discrete combinatorial problems using these techniques.

Constraint Satisfactio. by Pascal van Hentenryck.

constraint solving and constraint entailment). Pascal Van Hentenryck Constraint satisfaction using constraint logic programming. constraint solving and constraint entailment).

Constraint satisfaction using constraint logic programming. P Van Hentenryck, H Simonis, M Dincbas. B Le Charlier, P Van Hentenryck. Artificial intelligence 58 (1-3), 113-159, 1992.

Thomas Graf, Pascal Van Hentenryck, Claudine Pradelles, Laurent Zimmer, Simulation of hybrid circuits in constraint logic . Representations of the all different Predicate of Constraint Satisfaction in Integer Programming, INFORMS Journal on Computing, . 3 ., . 6-103, May 2001.

Thomas Graf, Pascal Van Hentenryck, Claudine Pradelles, Laurent Zimmer, Simulation of hybrid circuits in constraint logic programming, Proceedings of the 11th international joint conference on Artificial intelligence, . 2-77, August 20-25, 1989, Detroit, Michigan. Yves Caseau, François Laburthe, Solving various weighted matching problems with constraints, Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming, October 29-November 01, 1997, Linz, Austria.

Main article: Constraint logic programming. A constraint logic program is a logic program that contains constraints in the bodies of clauses. Van Hentenryck, Pascal (1989). Constraint Satisfaction in Logic Programming. ISBN 978-0-262-08181-8. As an example, the clause A(X):-X 0,B(X) is a clause containing the constraint X 0 in the body. Constraints can also be present in the goal.

Pascal Van Hentenryck - 1994. Computational Molecular Biology: A Promising Application Using Logic Programming and Constraint Logic Programming. Manuel Hermenegildo, Jaan Penjam & International Conference on Algebraic and Logic Programming - 1994. J. Cohen - 1999 - In P. Brezillon & P. Bouquet (ed., Lecture Notes in Artificial Intelligence. Frédéric Benhamou & Alain Colmerauer - 1993.

Pascal Van Hentenryck is an A. Russell Chandler III Chair and Professor .

He received a Test of Time Award (20 years) from the Association of Logic Programming and numerous best paper awards, including at IJCAI and AAAI.

This book tackles classic problems from operations research and circuit design using a logic programming language embedding consistency techniques, a paradigm emerging from artificial intelligence research. Van Hentenryck proposes a new approach to solving discrete combinatorial problems using these techniques. Logic programming serves as a convenient language for stating combinatorial problems, but its "generate and test" paradigm leads to inefficient programs. Van Hentenryck's approach preserves one of the most useful features of logic programming - the duality of its semantics - yet allows a short development time for the programs while preserving most of the efficiency of special purpose programs written in a procedural language. Embedding consistency techniques in logic programming allows for ease and flexibility of programming and short development time because constraint propagation and tree-search programming are abstracted away from the user. It also enables logic programs to be executed efficiently as consistency techniques permit an active use of constraints to remove combinations of values that cannot appear in a solution Van Hentenryck presents a comprehensive overview of this new approach from its theoretical foundations to its design and implementation, including applications to real life combinatorial problems. The ideas introduced in Constraint Satisfaction in Logic Programming have been used successfully to solve more than a dozen practical problems in operations research and circuit design, including disjunctive scheduling, warehouse location, cutting stock car sequencing, and microcode labeling problems. Pascal Van Hentenryck is a member of the research staff at the European Computer Industry Research Centre. Constraint Satisfaction in Logic Programming is based on research for the Centre's CHIP project. As an outgrowth of this project, a new language (CHIP) that will include consistency techniques has been developed for commercial use. The book is included in the Logic Programming series edited by Ehud Shapiro.

Related to Constraint Satisfaction in Logic Programming fb2 books: