<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Abstract algebra / Boolean algebra / Algebraic structures / Constraint programming / Electronic design automation / Formal methods / Boolean satisfiability problem / DPLL algorithm / Conjunctive normal form / Propositional calculus
Date: 2012-08-02 20:25:03
Mathematics
Algebra
Abstract algebra
Boolean algebra
Algebraic structures
Constraint programming
Electronic design automation
Formal methods
Boolean satisfiability problem
DPLL algorithm
Conjunctive normal form
Propositional calculus

Add to Reading List

Source URL: www.kestrel.edu

Download Document from Source Website

File Size: 469,00 KB

Share Document on Facebook

Similar Documents

Theoretical computer science / Mathematical logic / Mathematics / Logic programming / Logic in computer science / Automated theorem proving / Formal methods / Unification / Lambda calculus / Constraint logic programming / Conjunctive normal form

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

DocID: 1qJex - View Document

Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / NP-complete problems / Boolean algebra / Electronic design automation / Algebraic logic / Tseytin transformation / Boolean satisfiability problem / Conjunctive normal form / Canonical normal form

Microsoft Word - IBSdoc

DocID: 1qERD - View Document

Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / Boolean algebra / Logic programming / Automated planning and scheduling / Formal methods / Situation calculus / Planning Domain Definition Language / Boolean satisfiability problem / Conjunctive normal form

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

DocID: 1qzAi - View Document

Computational complexity theory / Theory of computation / Theoretical computer science / NP-complete problems / Complexity classes / Logic in computer science / Finite model theory / Parameterized complexity / Resolution / Exponential time hypothesis / Boolean satisfiability problem / Conjunctive normal form

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

DocID: 1qorC - View Document