<--- Back to Details
First PageDocument Content
Constraint programming / Automated theorem proving / Logic in computer science / Boolean algebra / NP-complete problems / Boolean satisfiability problem / DPLL algorithm / Davis–Putnam algorithm / Conjunctive normal form / Theoretical computer science / Mathematics / Applied mathematics
Date: 2010-05-28 11:06:43
Constraint programming
Automated theorem proving
Logic in computer science
Boolean algebra
NP-complete problems
Boolean satisfiability problem
DPLL algorithm
Davis–Putnam algorithm
Conjunctive normal form
Theoretical computer science
Mathematics
Applied mathematics

Add to Reading List

Source URL: www.math.cmu.edu

Download Document from Source Website

File Size: 139,11 KB

Share Document on Facebook

Similar Documents

Logic in computer science / Boolean algebra / Constraint programming / Electronic design automation / Formal methods / Boolean satisfiability problem / Solver / Satisfiability / Davis–Putnam algorithm / Theoretical computer science / Mathematics / Applied mathematics

Compilation of Planning to SAT Yiqiao Wang 1 Motivation

DocID: 15yug - View Document

Mathematics / Model theory / Constraint programming / Boolean algebra / Skolem normal form / Davis–Putnam algorithm / First-order logic / Resolution / Vampire / Mathematical logic / Logic / Automated theorem proving

A First-Order Davis-Putnam-Logemann-Loveland Procedure Peter Baumgartner + Some slides from "First Order Theorem Proving" Tutorial

DocID: 14SLy - View Document

Constraint programming / Logic in computer science / Boolean algebra / Automated theorem proving / Mathematical logic / Boolean satisfiability problem / DPLL algorithm / Local search / Davis–Putnam algorithm / Theoretical computer science / Applied mathematics / Mathematics

A New Approach to Model Counting Wei Wei and Bart Selman Department of Computer Science Cornell University Ithaca, NY 14853

DocID: 14pbM - View Document

Theoretical computer science / Resolution / Unit propagation / Conjunctive normal form / Literal / Backtracking / Inequality / Davis–Putnam algorithm / Automated theorem proving / Mathematics / Mathematical logic

Overview SAT Solving and its Relationship to CSPs ‫ ڗ‬Tremendous gains have been achieved over the

DocID: 13DzJ - View Document

Mathematical logic / Constraint programming / Formal methods / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Unit propagation / Resolution / Davis–Putnam algorithm / Theoretical computer science / Mathematics / Automated theorem proving

Enhancing Davis Putnam with Extended Binary Clause Reasoning Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario Canada, M5S 1A4

DocID: 11Xfp - View Document