Clause Elimination for SAT and QSAT

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative programming paradigms through which real-world instances of various computationally hard problems can be effi...

Celý popis

Podrobná bibliografia

Vydané v:	The Journal of artificial intelligence research Ročník 53; s. 127 - 168
Hlavní autori:	Heule, Marijn, Järvisalo, Matti, Lonsing, Florian, Seidl, Martina, Biere, Armin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Francisco AI Access Foundation 01.01.2015
Predmet:	Artificial intelligence Boolean Boolean algebra Canonical forms Declarative programming Empirical analysis Polynomials Redundancy Simplification Solvers
ISSN:	1076-9757, 1076-9757, 1943-5037
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!