<--- Back to Details
First PageDocument Content
Automated theorem proving / Boolean algebra / NP-complete problems / Constraint programming / Logic in computer science / Boolean satisfiability problem / Davis–Putnam algorithm / Satisfiability / Unit propagation / Theoretical computer science / Mathematics / Computational complexity theory
Date: 2013-07-29 01:10:58
Automated theorem proving
Boolean algebra
NP-complete problems
Constraint programming
Logic in computer science
Boolean satisfiability problem
Davis–Putnam algorithm
Satisfiability
Unit propagation
Theoretical computer science
Mathematics
Computational complexity theory

Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345

Add to Reading List

Source URL: www.cse.unsw.edu.au

Download Document from Source Website

File Size: 620,87 KB

Share Document on Facebook

Similar Documents

LTE / Technology / Mobile technology / Wireless / Software-defined radio / Mobile telecommunications / ENodeB / System Architecture Evolution / Telecommunications / E-UTRA / User equipment / Mobility management

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

DocID: 1xUdh - View Document

PDF Document

DocID: 1xSrV - View Document

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

DocID: 1vleR - View Document

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995

DocID: 1v7SC - View Document

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

DocID: 1v72L - View Document