Article | REF: H3158 V1

Logic programming with constraints

Author: Laurent TRILLING

Publication date: May 10, 1998

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

2. Constraints in Prolog III

Here we look at the following constraint domains available in Prolog III: lists, rationals and Booleans.

The other area, that of trees, is covered in [1] . It should be noted, however, that the equational vision very early on led to the question: what is the solution, in terms of trees, of the equation X = f(1, X)? Prolog II already provided the answer: a rational infinite tree. This type of tree, which allows finite graphs to be represented as objects in their own right (first-class citizens), is still very much under wraps. But we're betting it won't stay that way.

2.1 Constraints on lists

The intensive use of lists led to the introduction of a specialized field....

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Software technologies and System architectures

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Constraints in Prolog III