<--- Back to Details
First PageDocument Content
Theoretical computer science / Constraint programming / Computational complexity theory / Software engineering / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / DPLL algorithm / Constraint satisfaction / Solver
Date: 2010-07-15 03:14:22
Theoretical computer science
Constraint programming
Computational complexity theory
Software engineering
Logic in computer science
Electronic design automation
Formal methods
NP-complete problems
Boolean satisfiability problem
DPLL algorithm
Constraint satisfaction
Solver

SAT Encodings Sugar Examples Demo Summary . .

Add to Reading List

Source URL: bach.istc.kobe-u.ac.jp

Download Document from Source Website

File Size: 552,42 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