{"type":"ScholarlyArticle","title":"A Theoretical Framework for Consistency Techniques in Logic Programming","authors":[{"name":"Pascal Van Hentenryck","slug":"pascal-van-hentenryck","given":"Pascal","family":"Van Hentenryck","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1987/1","pdf":"https://ijcai.org/proceedings/1987/0001.pdf","markdown":"https://ijcai.org/proceedings/1987/1.md","bibtex":"https://ijcai.org/proceedings/1987/bibtex/1","volume":{"slug":"1987","title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1987","url":"https://ijcai.org/proceedings/1987/","year":1987,"location":"Milan, Italy","dates":"","editors":"John McDermott","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Architectures and Languages","track":"Architectures and Languages","number":1,"pages":{"first":2,"last":7},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}