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

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

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

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

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

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

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 algorithm for SAT above the thresholdHUBIE CHEN.Lecture notes in computer science. 2004, pp 14-24, issn 0302-9743, isbn 3-540-20851-8, 11 p.Conference Paper

A genetic algorithm for satisfiability problem in a probabilistic logic : A first reportOGNJANOVIC, Zoran; KRATICA, Jozef; MILOVANOVIC, Milos et al.Lecture notes in computer science. 2001, pp 805-816, issn 0302-9743, isbn 3-540-42464-4Conference Paper

Towards first-order temporal resolutionDEGTYAREV, Anatoli; FISHER, Michael.Lecture notes in computer science. 2001, pp 18-32, issn 0302-9743, isbn 3-540-42612-4Conference Paper

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

Simplifying binary propositional theories into connected components twice as fastDEL VAL, Alvaro.Lecture notes in computer science. 2001, pp 392-406, issn 0302-9743, isbn 3-540-42957-3Conference Paper

Independent domination and matchings in graphsRAUTENBACH, Dieter; VOLKMANN, Lutz.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 325-330, issn 0012-365X, 6 p.Article

Automata for guarded fixed point logicsBERWANGER, Dietmar; BLUMENSATH, Achim.Lecture notes in computer science. 2002, pp 343-355, issn 0302-9743, isbn 3-540-00388-6, 13 p.Conference Paper

DDDLIB: A library for solving quantified difference inequalitiesMILLER, Jesper B.Lecture notes in computer science. 2002, pp 129-133, issn 0302-9743, isbn 3-540-43931-5, 5 p.Conference Paper

Some progress in satisfiability checking for difference logicCOTTON, Scott; ASARIN, Eugene; MALER, Oded et al.Lecture notes in computer science. 2004, pp 263-276, issn 0302-9743, isbn 3-540-23167-6, 14 p.Conference Paper

The Renesse issue on satisfiabilitySPECKENMEYER, Ewald; FRANCO, John; VAN MAAREN, Hans et al.Discrete applied mathematics. 2003, Vol 130, Num 2, issn 0166-218X, 286 p.Conference Proceedings

Satisfiability and completeness of converse-PDL replayedLANGE, Martin.Lecture notes in computer science. 2003, pp 79-92, issn 0302-9743, isbn 3-540-20059-2, 14 p.Conference Paper

An elementary expressively complete temporal logic for Mazurkiewicz tracesGASTIN, Paul; MUKUND, Madhavan.Lecture notes in computer science. 2002, pp 938-949, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Restricted Δ-trees and reduction theorems in multiple-valued logicsDE GUZMAN, Inma P; OJEDA-ACIEGO, Manuel; VALVERDE, Agustin et al.Lecture notes in computer science. 2002, pp 161-171, issn 0302-9743, isbn 3-540-00131-X, 11 p.Conference Paper