clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving

Authors:
Philippe Codognet;Daniel Diaz
Affiliations:
-;-
Venue:
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Year:
1994

Citing 0
Cited 3

A Comparative Study of Eight Constraint Programming LanguagesOver the Boolean and Finite Domains

Constraints
Defeasible Constraint Solving over the Booleans

IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
An interval constraint system for lattice domains

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract