Trees and finite satisfiability: proof of a conjecture of burgessBOOLOS, G.Notre Dame journal of formal logic. 1984, Vol 25, Num 3, pp 193-197, issn 0029-4527Article

Theory and applications of satisfiability testing (Santa Margherita Ligure, 5-8 May 2003, selected revised papers)Giunchiglia, Enrico; Tacchella, Armando.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-20851-8, XI, 530 p, isbn 3-540-20851-8Conference Proceedings

Read-once unit resolutionBÜNING, Hans Kleine; XISHUN ZHAO.Lecture notes in computer science. 2004, pp 356-369, issn 0302-9743, isbn 3-540-20851-8, 14 p.Conference Paper

Algorithms for guiding clausal temporal resolutionFERNANDEZ GAGO, M. Carmen; FISHER, Michael; DIXON, Clare et al.Lecture notes in computer science. 2002, pp 235-249, issn 0302-9743, isbn 3-540-44185-9, 15 p.Conference Paper

A simplified NP-complete satisfiability problemTOVEY, C. A.Discrete applied mathematics. 1984, Vol 8, Num 1, pp 85-89, issn 0166-218XArticle

The effect of nogood recording in DPLL-CBJ SAT algorithmsLYNCE, Ines; MARQUES-SILVA, Joao.Lecture notes in computer science. 2003, pp 144-158, issn 0302-9743, isbn 3-540-00986-8, 15 p.Conference Paper

Data dependency in the incomplete relational modelPARK, S; LEE, S; CHO, J et al.International journal on policy and information. 1984, Vol 8, Num 2, pp 73-82, issn 0251-1266Article

An efficient implementation of a joint generation algorithmBOROS, E; ELBASSIONI, K; GURVICH, V et al.Lecture notes in computer science. 2004, pp 114-128, issn 0302-9743, isbn 3-540-22067-4, 15 p.Conference Paper

Ten challenges redux: Recent progress in propositional reasoning and searchKAUTZ, Henry; SELMAN, Bart.Lecture notes in computer science. 2003, pp 1-18, issn 0302-9743, isbn 3-540-20202-1, 18 p.Conference Paper

Deciding hypergraph 2-colourability by H-resolutionLINIAL, N; TARSI, M.Theoretical computer science. 1985, Vol 38, Num 2-3, pp 343-347, issn 0304-3975Article

Decision procedures and expressiveness in the temporal logic of branching timeEMERSON, E. A; HALPERN, J. Y.Journal of computer and system sciences (Print). 1985, Vol 30, Num 1, pp 1-24, issn 0022-0000Article

The temporal logic of branching timeBEN-ARI, M; PNUELI, A; MANNA, Z et al.Acta informatica. 1983, Vol 20, Num 3, pp 207-226, issn 0001-5903Article

Stratified context unification is in PSPACESCHMIDT-SCHAUSS, Manfred.Lecture notes in computer science. 2001, pp 498-512, issn 0302-9743, isbn 3-540-42554-3Conference Paper

A proof engine approach to solving combinational design automation problemsANDERSSON, Gunnar; BJESSE, Per; COOK, Byron et al.Design automation conference. 2002, pp 725-730, isbn 1-58113-461-4, 6 p.Conference Paper

Counting satisfiable k-CNF formulasHARRIS, Mitchell A.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 765Conference Paper

The satisfiability problem for a class consisting of horn sentences and some non-horn sentences in proportional logicYAMASAKI, S; DOSHITA, S.Information and control. 1983, Vol 59, Num 1-3, pp 1-12, issn 0019-9958Article

An FPT algorithm for set splittingDEHNEL, Frank; FELLOWS, Michael R; ROSAMOND, Frances A et al.Lecture notes in computer science. 2003, pp 180-191, issn 0302-9743, isbn 3-540-20452-0, 12 p.Conference Paper

On uniform word problems involving bridging operators on distributive latticesSOFRONIE-STOKKERMANS, Viorica.Lecture notes in computer science. 2002, pp 235-250, issn 0302-9743, isbn 3-540-43929-3, 16 p.Conference Paper

An O (n²) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentencesARVIND, V; BISWAS, S.Information processing letters. 1987, Vol 24, Num 1, pp 67-69, issn 0020-0190Article

The complexity of the satisfiability problem for Krom formulasDENENBERG, L; LEWIS, H. R.Theoretical computer science. 1984, Vol 30, Num 3, pp 319-341, issn 0304-3975Article

Improved exact algorithms for MAX-SATJIANER CHEN; KANJ, Iyad A.Lecture notes in computer science. 2002, pp 341-355, issn 0302-9743, isbn 3-540-43400-3Conference Paper

On logical method for counting Dedekind numbersTOMBAK, Mati; ISOTAMM, Ain; TAMME, Tonu et al.Lecture notes in computer science. 2001, pp 424-427, issn 0302-9743, isbn 3-540-42487-3Conference Paper

A tableau calculus for combining non-disjoint theoriesZARBA, Calogero G.Lecture notes in computer science. 2002, pp 315-329, issn 0302-9743, isbn 3-540-43929-3, 15 p.Conference Paper

QuBE : A system for deciding quantified boolean formulas satisfiabilityGIUNCHIGLIA, Enrico; NARIZZANO, Massimo; TACCHELLA, Armando et al.Lecture notes in computer science. 2001, pp 364-369, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Solving satisfaibility in less than 2″ stepsMONIEN, B; SPECKENMEYER, E.Discrete applied mathematics. 1985, Vol 10, Num 3, pp 287-295, issn 0166-218XArticle