Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Mathematical optimization / Logic in computer science / Boolean satisfiability problem / Electronic design automation / NP-complete / 2-satisfiability / NP / Theoretical computer science / Computational complexity theory / Applied mathematics


Artificial Intelligence–120 www.elsevier.com/locate/artint Compiling problem specifications into SAT ✩ Marco Cadoli a,∗ , Andrea Schaerf b a Dipartimento di Informatica e Sistemistica, Università di
Add to Reading List

Document Date: 2008-12-11 12:42:15

Open Document

File Size: 252,42 KB

Share Result on Facebook

City

P ROLOG / Berlin / Roma / Udine / /

Company

Elsevier B.V. / /

Country

Italy / /

/

Event

Product Recall / Product Issues / /

IndustryTerm

real-world applications / search space / search problems / /

OperatingSystem

L3 / /

Person

Marco Cadoli / Andrea Schaerf / /

Position

queen / translator / head / model / or not / Corresponding author / /

Product

state of the art / /

ProgrammingLanguage

PROLOG / DATALOG / C++ / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

cryptography / artificial intelligence / SAT technology / /

URL

http /

SocialTag