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

(2 + f(n))-SAT and its propertiesYUNLEI ZHAO; XIAOTIE DENG; LEE, C. H et al.Discrete applied mathematics. 2004, Vol 136, Num 1, pp 3-11, issn 0166-218X, 9 p.Article

Reductions for non-clausal theorem provingAGUILERA, G; DE GUZMAN, I. P; OJEDA-ACIEGO, M et al.Theoretical computer science. 2001, Vol 266, Num 1-2, pp 81-112, issn 0304-3975Article

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

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

Local consistencies in SATBESSIERE, Christian; HEBRARD, Emmanuel; WALSH, Toby et al.Lecture notes in computer science. 2004, pp 299-314, issn 0302-9743, isbn 3-540-20851-8, 16 p.Conference Paper

CTL⁺ is complete for double exponential timeJOHANNSEN, Jan; LANGE, Martin.Lecture notes in computer science. 2003, pp 767-775, issn 0302-9743, isbn 3-540-40493-7, 9 p.Conference Paper

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

Improved exact algorithms for Max-SatJIANER CHEN; KANJ, Iyad A.Discrete applied mathematics. 2004, Vol 142, Num 1-3, pp 17-27, issn 0166-218X, 11 p.Article

Bounded fixed-parameter tractability: The case 2^poly(k)WEYER, Mark.Lecture notes in computer science. 2004, pp 49-60, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

Logics for approximate reasoning: Approximating classical logic from aboveFINGER, Marcelo; WASSERMANN, Renata.Lecture notes in computer science. 2002, pp 21-30, issn 0302-9743, isbn 3-540-00124-7, 10 p.Conference Paper

Pruning processes and a new characterization of convex geometriesARDILA, Federico; MANEVA, Elitza.Discrete mathematics. 2009, Vol 309, Num 10, pp 3083-3091, issn 0012-365X, 9 p.Article

Solution to the satisfiability problem using a complete Grover search with trapped ionsYANG, Wan-Li; HUA WEI; FEI ZHOU et al.Journal of physics. B. Atomic, molecular and optical physics (Print). 2009, Vol 42, Num 14, issn 0953-4075, 145503.1-145503.8Article

OPTSAT : A tool for solving SAT related optimization problemsGIUNCHIGLIA, Enrico; MARATEA, Marco.Lecture notes in computer science. 2006, pp 485-489, issn 0302-9743, isbn 3-540-39625-X, 1Vol, 5 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

The complexity of finding small triangulations of convex 3-polytopesBELOW, Alexander; DE LOERA, Jesus A; RICHTER-GEBERT, Jürgen et al.Journal of algorithms (Print). 2004, Vol 50, Num 2, pp 134-167, issn 0196-6774, 34 p.Conference Paper

A simple algorithm for Mal'tsev constraintsBULATOV, Andrei; DALMAU, Victor.SIAM journal on computing (Print). 2007, Vol 36, Num 1, pp 16-27, issn 0097-5397, 12 p.Article

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

On the finite satisfiability problem for the guarded fragment with transitivitySZWAST, Wieslaw; TENDERA, Lidia.Lecture notes in computer science. 2005, pp 307-321, issn 0302-9743, isbn 3-540-30553-X, 1Vol, 15 p.Conference Paper

On selection strategies for the DPLL algorithmIRGENS, Morten; HAVENS, William S.Lecture notes in computer science. 2004, pp 277-291, issn 0302-9743, isbn 3-540-22004-6, 15 p.Conference Paper

Full dynamic substitutability by SAT encodingPRESTWICH, Steven.Lecture notes in computer science. 2004, pp 512-526, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

Average running time analysis of an algorithm to calculate the size of the union of Cartesian productsSUZUKI, Susumu; IBARAKI, Toshihide.Discrete mathematics. 2003, Vol 273, Num 1-3, pp 211-220, issn 0012-365X, 10 p.Conference Paper

Atomic set constraints with projectionCHARATONIK, Witold; TALBOT, Jean-Marc.Lecture notes in computer science. 2002, pp 311-325, issn 0302-9743, isbn 3-540-43916-1, 15 p.Conference Paper

Towards fewer parameters for SAT clause weighting algorithmsTHORNTON, John; PULLAN, Wayne; TERRY, Justin et al.Lecture notes in computer science. 2002, pp 569-578, issn 0302-9743, isbn 3-540-00197-2, 10 p.Conference Paper

Reasoning about cardinal directions between extended objects: The NP-hardness resultLIU, Weiming; LI, Sanjiang.Artificial intelligence (General ed.). 2011, Vol 175, Num 18, pp 2155-2169, issn 0004-3702, 15 p.Article