A Theoretical Framework for Consistency Techniques in Logic Programming
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Architectures and Languages. Pages 2-7.
Abstract
While beina a powerful paradism for oolving Constraint Satisfaction Problem• (CSPs), Conoiotency Technique• (CTs) · have never been taken into account durins the desisn of declarat'lve proarammina lansuaseo . This paper defines ·a theoretical framework for using CT1 lnoide loRic programming . Three Inference rule• are introduced and their formal propertieo are inveotigated. Also, computation rule• are defined which are worth conaiderins wrt the Inference rules. As practical reouiWI , the progrllmmer can write "generate &. test" prosramo while the interpreter /compiler will use CTs for oolvin1 them (e .s forward checking or arc consiotency) . This make• Josie programmina not only a sood language for stating CSPo but aloo an efficient tool for oolvins them as confirmed by our firot experiences.
@inproceedings{ijcai1987p1,
title = {A Theoretical Framework for Consistency Techniques in Logic Programming},
author = {Van Hentenryck, Pascal},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {2--7},
year = {1987},
note = {Architectures and Languages},
url = {https://ijcai.org/proceedings/1987/1},
}
TY - CPAPER TI - A Theoretical Framework for Consistency Techniques in Logic Programming AU - Van Hentenryck, Pascal T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 2 EP - 7 UR - https://ijcai.org/proceedings/1987/1 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
