CLP(B), Boolean Unification

1987

• Wolfram Büttner, Helmut Simonis: Embedding Boolean Expressions into Logic Programming. J. Symb. Comput. 4(2): 191-205(1987)

1988

• Ursula Martin, Tobias Nipkow: Unification in Boolean Rings. J. Autom. Reasoning 4(4): 381-396(1988)

1989

• Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß: Unification in Boolean Rings and Abelian Groups. J. Symb. Comput. 8(5): 449-477(1989)
• Ursula Martin, Tobias Nipkow: Boolean Unification - The Story So Far. J. Symb. Comput. 7(3/4): 275-293(1989)

1991

• Mats Carlsson: Boolean Constraints in SICStus Prolog. SICS technical report T91:09, 1991, Postscript
• Jean-Luc Massat: Using Local Consistency Techniques to Solve Boolean Constraints. WCLP 1991: 223-235
• Antoine Rauzy: Using Enumerative Methods for Boolean Unification. WCLP 1991: 237-251
• Satoshi Menju, Kô Sakai, Yosuke Sato, Akira Aiba: A Study on Boolean Constraint Solvers. WCLP 1991: 253-267
• Helmut Simonis, Mehmet Dincbas: Propositional Calculus Problems in CHIP. WCLP 1991: 269-285
• Alfonso San Miguel Aguirre: How to Use Symmetries in Boolean Constraint Solving. WCLP 1991: 287-306
• Frédéric Benhamou: Boolean Algorithms in Prolog III. WCLP 1991: 307-325
• Alexander Bockmayr: Logic Programming with Pseudo-Boolean Constraints. WCLP 1991: 327-350

1993

• Philippe Codognet, Daniel Diaz: Boolean Constraint Solving Using clp(FD). ILPS 1993: 525-539
• Greg Sidebottom: Implementing CLP(IB) Using the Connection Theorem Proving Method and a Clause Management System. J. Symb. Comput. 15(1): 27-48(1993)

1994

• Philippe Codognet, Daniel Diaz: clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving. PLILP 1994: 244-260
• Antoine Rauzy: Notes on the Design of an Open Boolean Solver. ICLP 1994: 354-368

Related Topcis

• Binary Decision Diagrams (BDDs)
• CHIP