Back to Results
First PageMeta Content
Logic in computer science / Mathematical logic / Aachen / RWTH Aachen University / Termination analysis / Boolean satisfiability problem / NP-completeness / Algorithm / Rewriting


Aachen Department of Computer Science Technical Report SAT Encodings: From Constraint-Based Termination
Add to Reading List

Document Date: 2012-10-02 11:28:08


Open Document

File Size: 1,35 MB

Share Result on Facebook