@inproceedings{78d81375bf3e4449a957b84f33f9fe50,
title = "Propositional calculus problems in CHIP",
abstract = "This paper describes how to model and solve boolean satisfiability problems with the constraint logic programming language CHIP. Although CHIP has not been developed as a specialised propositional calculus prover, it can solve these problems quite efficiently. Several different methods of describing satisfiability problems in CHIP are presented and compared. This flexibility of modelling is a major advantage of CHIP over closed problem solvers. We have evaluated various sets of benchmarks taken from [31] [16] [21]. With one exception, CHIP performs as well or better as specialised programs on these examples. We also shortly discuss an alternative modeling technique using finite domain variables not restricted to 0/1 values.",
author = "H. Simonis and M. Dincbas",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1990.; 2nd International Conference on Algebraic and Logic Programming, 1990 ; Conference date: 01-10-1990 Through 03-10-1990",
year = "1990",
doi = "10.1007/3-540-53162-9\_39",
language = "English",
isbn = "9783540531623",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "189--203",
editor = "Helene Kirchner and Wolfgang Wechler",
booktitle = "Algebraic and Logic Programming - 2nd International Conference, Proceedings",
address = "Germany",
}