Theory and applications of satisfiability testing (SAT 2006)Biere, Armin; Gomes, Carla P.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-37206-7, 1Vol, XII-438 p, isbn 3-540-37206-7Conference Proceedings

Improved approximation algorithms for MAX NAE-SAT and MAX SATAVIDOR, Adi; BERKOVITCH, Ido; ZWICK, Uri et al.Lecture notes in computer science. 2006, pp 27-40, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

A scalable algorithm for minimal unsatisfiable core extractionDERSHOWITZ, Nachum; HANNA, Ziyad; NADEL, Alexander et al.Lecture notes in computer science. 2006, pp 36-41, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 6 p.Conference Paper

Satisfiability Modulo Theories: Introduction and ApplicationsDE MOURA, Leonardo; BJØRNER, Nikolaj.Communications of the ACM. 2011, Vol 54, Num 9, pp 69-77, issn 0001-0782, 9 p.Article

Effective preprocessing in SAT through variable and clause eliminationEEN, Niklas; BIERE, Armin.Lecture notes in computer science. 2005, pp 61-75, issn 0302-9743, isbn 3-540-26276-8, 15 p.Conference Paper

Boolean Satisfiability From Theoretical Hardness to Practical SuccessMALIK, Sharad; LINTAO ZHANG.Communications of the ACM. 2009, Vol 52, Num 8, pp 76-82, issn 0001-0782, 7 p.Article

Categorisation of clauses in conjunctive normal forms : Minimally unsatisfiable sub-clause-sets and the lean kernelKULLMANN, Oliver; LYNCE, Ines; MARQUES-SILVA, Joao et al.Lecture notes in computer science. 2006, pp 22-35, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 14 p.Conference Paper

A new set of algebraic benchmark problems for SAT solversMEIER, Andreas; SORGE, Volker.Lecture notes in computer science. 2005, pp 459-466, issn 0302-9743, isbn 3-540-26276-8, 8 p.Conference Paper

Solving weighted MAX-SAT via global equilibrium searchSHYLO, Oleg V; PROKOPYEV, Oleg A; SHYLO, Vladimir P et al.Operations research letters. 2008, Vol 36, Num 4, pp 434-438, issn 0167-6377, 5 p.Article

On the parameterized complexity of exact satisfiability problemsKNEIS, Joachim; MOLLE, Daniel; RICHTER, Stefan et al.Lecture notes in computer science. 2005, pp 568-579, issn 0302-9743, isbn 3-540-28702-7, 12 p.Conference Paper

Local search for unsatisfiabilityPRESTWICH, Steven; LYNCE, Ines.Lecture notes in computer science. 2006, pp 283-296, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 14 p.Conference Paper

How many solutions does a sat instance have?PARI, Pushkin R; LIN YUAN; GANG QU et al.IEEE International Symposium on Circuits and Systems. 2004, pp 209-212, isbn 0-7803-8251-X, 4 p.Conference Paper

APPSSAT : Approximate probabilistic planning using stochastic satisfiabilityMAJERCIK, Stephen M.International journal of approximate reasoning. 2007, Vol 45, Num 2, pp 402-419, issn 0888-613X, 18 p.Conference Paper

Searching while keeping a trace : The evolution from satisfiability to knowledge compilationDARWICHE, Adnan.Lecture notes in computer science. 2006, pp 4-20, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 17 p.Conference Paper

sharpSAT : Counting models with advanced component caching and implicit BCPTHURLEY, Marc.Lecture notes in computer science. 2006, pp 424-429, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 6 p.Conference Paper

An algorithm for the SAT problem for formulae of linear lengthWAHLSTRÖM, Magnus.Lecture notes in computer science. 2005, pp 107-118, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

On finding all minimally unsatisfiable subformulasLIFFITON, Mark H; SAKALLAH, Karem A.Lecture notes in computer science. 2005, pp 173-186, issn 0302-9743, isbn 3-540-26276-8, 14 p.Conference Paper

Using heuristics to find minimal unsatisfiable subformulas in satisfiability problemsDESROSIERS, Christian; GALINIER, Philippe; HERTZ, Alain et al.Journal of combinatorial optimization. 2009, Vol 18, Num 2, pp 124-150, issn 1382-6905, 27 p.Article

The inequality-satisfiability problemHOCHBAUM, Dorit S; MORENO-CENTENO, Erick.Operations research letters. 2008, Vol 36, Num 2, pp 229-233, issn 0167-6377, 5 p.Article

Nelson-oppen, shostak and the extended canonizer : A family picture with a newbornRANISE, Silvio; RINGEISSEN, Christophe; TRAN, Duc-Khanh et al.Lecture notes in computer science. 2005, pp 372-386, issn 0302-9743, isbn 3-540-25304-1, 15 p.Conference Paper

Deciding satisfiability of positive second order joinability formulaeLIMET, Sebastien; PILLOT, Pierre.Lecture notes in computer science. 2006, pp 15-29, issn 0302-9743, isbn 3-540-48281-4, 1Vol, 15 p.Conference Paper

Preliminary report on input cover number as a metric for propositional resolution proofsVAN GELDER, Allen.Lecture notes in computer science. 2006, pp 48-53, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 6 p.Conference Paper

SMT-COMP : Satisfiability modulo theories competitionBARRETT, Clark; DE MOURA, Leonardo; STUMP, Aaron et al.Lecture notes in computer science. 2005, pp 20-23, issn 0302-9743, isbn 3-540-27231-3, 4 p.Conference Paper

Reconstruction of binary matrices from absorbed projectionsBALOGH, E; KUBA, A; DEL LUNGO, A et al.Lecture notes in computer science. 2002, pp 392-403, issn 0302-9743, isbn 3-540-43380-5Conference Paper

Generation of oriented matroids using satisfiability solversSCHEWE, Lars.Lecture notes in computer science. 2006, pp 216-218, issn 0302-9743, isbn 3-540-38084-1, 1Vol, 3 p.Conference Paper