» » Constraint Logic Programming: Selected Research

eBook Constraint Logic Programming: Selected Research epub

by Frédéric Benhamou,Alain Colmerauer

eBook Constraint Logic Programming: Selected Research epub
  • ISBN: 0262512106
  • Author: Frédéric Benhamou,Alain Colmerauer
  • Genre: Techno
  • Subcategory: Computer Science
  • Language: English
  • Publisher: The MIT Press (July 1, 2008)
  • Pages: 500 pages
  • ePUB size: 1478 kb
  • FB2 size 1902 kb
  • Formats lrf txt mobi doc


Constraint Logic Programming book.

Constraint Logic Programming book.

Constraint logic programming, the notion of computing with partial information, is becoming recognized as a way of dramatically . Frederic Benhamou, Alain Colmerauer.

This collection presents the best of current work on all aspects.

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. Computational Molecular Biology: A Promising Application Using Logic Programming and Constraint Logic Programming. J. Cohen - 1999 - In P. Brezillon & P. Bouquet (ed., Lecture Notes in Artificial Intelligence.

In: Calmet . Benhamou . Caprotti . Henocque . Sorge V. (eds) Artificial Intelligence, Automated Reasoning, and Symbolic Computation. AISC 2002, Calculemus 2002. Lecture Notes in Computer Science, vol 2385.

Constraint Satisfaction in Logic Programming.

Excellence Award, Principles and Practice of Constraint Programming in 2008.

Excellence Award, Principles and Practice of Constraint Programming in 2008 Death References. "Colmerauer, Alain (1941

WCLP 1991, Marseilles, France. MIT Press 1993, ISBN 0-262-02353-9.

Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is A(X,Y) :- X+Y 0, B(X), C(Y). In this clause, X+Y 0 is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming.

Constraint logic programming, the notion of computing with partial information, is becoming recognized as a way of dramatically improving on the current generation of programming languages. This collection presents the best of current work on all aspects of constraint logic programming languages, from theory through language implementation.Beginning in the mid-1980s constraint logic programming became a powerful and essential theoretical concept whose first practical application was the development of efficient programming languages based on Prolog. Benhamou and Colmerauer have taken care to illustrate the strong links between current research and existing CLP languages. The first part of the book focuses on significant theoretical studies that propose general models for constraint programming, and the two following parts develop current ideas on themes derived from these languages (numerical constraints, Booleans, and other finite domains). The concluding part on CLP language design gathers work on original constraints and on top-level implementation.Frédéric Benhamou is a Researcher in the Computer Science Department of the Faculté des Sciences de Luminy at the University of Marseilles, where Alain Colmerauer is Professor of Computer Science.

eBooks Related to Constraint Logic Programming: Selected Research
Contacts | Privacy Policy | DMCA
All rights reserved.
lycee-pablo-picasso.fr © 2016-2020