ABSTRACT
In this chapter we present the definitions and complexity proofs for Deterministic Constraint Logic, both the bounded and unbounded varieties. We also briefly discuss some potential real-world applications of Deterministic Constraint Logic for building reversible computers.
