A theoretical framework for consistency techniques in logic programming

Authors:
Fascal Van Hentenryck
Affiliations:
ECRC, Muenchen, West Germany
Venue:
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Year:
1987

Citing 7
Cited 1

Foundations of logic programming

Foundations of logic programming
Arc and path consistence revisited

Artificial Intelligence
Qualitative simulation

Artificial Intelligence
Login: A logic programming language with built-in inheritance

Journal of Logic Programming
Synthesizing constraint expressions

Communications of the ACM
Generating Semantic Descriptions From Drawings of Scenes With Shadows

Generating Semantic Descriptions From Drawings of Scenes With Shadows
A many-sorted resolution based on an extension of a first-order language

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2

The complexity of constraint satisfaction in prolog

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

While being a powerful paradigm for solving Constraint Satisfaction Problems (CSPs), Consistency Techniques (CTs) have never been taken into account during the design of declarative programming languages. This paper defines a theoretical framework for using CTs inside logic programming. Three inference rules are introduced and their formal properties are investigated. Also, computation rules are defined which are worth considering wrt the inference rules. As practical results, the programmer can write "generate & test" programs while the interpreter/compiler will use CTs for solving them (e.g forward checking or arc consistency). This makes logic programming not only a good language for stating CSPs but also an efficient tool for solving them as confirmed by our first experiences.