Display program code

autogen_fulladder.pl : Auto-generated full-adder handler
Automatically generated handler for a full-adder.
Note: Prolog shows some warnings about singleton variables because file was auto-generated.

How to use:
A full-adder sums three one-bit numbers A, B and Cin, and outputs a two-bit number with Cout as most-significant and S as least-significant bit, i.e., A+B+C = 2*Cout+S.
A full-adder with input bits A, B and carry Cin, and output bits sum S and carry Cout is represented as fulladder(A,B,Cin,S,Cout).

See also:
S Abdennadher, C Rigotti. Automatic generation of CHR constraint solvers. Theory and Practice of Logic Programming, 2005.

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

Select example query: 

WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007