Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10--13, 2004. Revised selected papers. (Q2574650)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10--13, 2004. Revised selected papers.
scientific article

    Statements

    Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10--13, 2004. Revised selected papers. (English)
    0 references
    30 November 2005
    0 references
    The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1030.00034). Indexed articles: \textit{Ansótegui, Carlos; Manyà, Felip}, Mapping problems with finite-domain variables to problems with Boolean variables, 1-15 [Zbl 1122.68582] \textit{Armando, Alessandro; Castellini, Claudio; Giunchiglia, Enrico; Maratea, Marco}, A SAT-based decision procedure for the Boolean combination of difference constraints, 16-29 [Zbl 1122.68583] \textit{Bauland, Michael; Chapdelaine, Philippe; Creignou, Nadia; Hermann, Miki; Vollmer, Heribert}, An algebraic approach to the complexity of generalized conjunctive queries, 30-45 [Zbl 1122.68407] \textit{Benedetti, Marco; Bernardini, Sara}, Incremental compilation-to-SAT procedures, 46-58 [Zbl 1122.68584] \textit{Biere, Armin}, Resolve and expand, 59-70 [Zbl 1122.68585] \textit{Chen, Hubie; Dalmau, Víctor}, Looking algebraically at tractable quantified Boolean formulas, 71-79 [Zbl 1122.68588] \textit{Dantsin, Evgeny; Wolpert, Alexander}, Derandomization of Schuler's algorithm for SAT, 80-88 [Zbl 1122.68591] \textit{Galesi, Nicola; Kullmann, Oliver}, Polynomial time SAT decision, hypergraph transversals and the Hermitian rank, 89-104 [Zbl 1122.68595] \textit{Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando}, QBF reasoning on real-world instances, 105-121 [Zbl 1122.68596] \textit{Grégoire, Éric; Ostrowski, Richard; Mazure, Bertrand; Saïs, Lakhdar}, Automatic extraction of functional dependencies, 122-132 [Zbl 1122.68597] \textit{Gummadi, Ravi; Narayanaswamy, N. S.; Venkatakrishnan, R.}, Algorithms for satisfiability using independent sets of variables, 133-144 [Zbl 1122.68598] \textit{Heule, Marijn; van Maaren, Hans}, Aligning CNF- and equivalence-reasoning, 145-156 [Zbl 1122.68600] \textit{Huang, Jinbo; Darwiche, Adnan}, Using DPLL for efficient OBDD construction, 157-172 [Zbl 1122.68601] \textit{Interian, Yannet}, Approximation algorithm for random MAX-\(k\)SAT, 173-182 [Zbl 1122.68602] \textit{Jackson, Paul; Sheridan, Daniel}, Clause form conversions for Boolean circuits, 183-198 [Zbl 1122.68603] \textit{Jia, Haixia; Moore, Cris; Selman, Bart}, From spin glasses to hard satisfiable formulas, 199-210 [Zbl 1122.68605] \textit{Jin, HoonSang; Somenzi, Fabio}, CirCUs: A hybrid satisfiability solver, 211-223 [Zbl 1122.68606] \textit{Kleine Büning, Hans; Zhao, Xishun}, Equivalence models for quantified Boolean formulas, 224-234 [Zbl 1122.68471] \textit{Pan, Guoqiang; Vardi, Moshe Y.}, Search vs. symbolic techniques in satisfiability solving, 235-250 [Zbl 1122.68613] \textit{Porschen, Stefan; Speckenmeyer, Ewald}, Worst case bounds for some NP-complete modified Horn-SAT problems, 251-262 [Zbl 1122.68614] \textit{Sinopalnikov, Danila A.}, Satisfiability threshold of the skewed random \(k\)-SAT, 263-275 [Zbl 1122.68615] \textit{Subbarayan, Sathiamoorthy; Pradhan, Dhiraj K.}, NiVER: Non-increasing variable elimination resolution for preprocessing SAT instances, 276-291 [Zbl 1122.68618] \textit{Tang, Daijue; Yu, Yinlei; Ranjan, Darsh; Malik, Sharad}, Analysis of search based algorithms for satisfiability of propositional and quantified Boolean formulas arising from circuit state space diameter problems, 292-305 [Zbl 1122.68619] \textit{Tompkins, Dave A. D.; Hoos, Holger H.}, UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT, 306-320 [Zbl 1122.68620] \textit{Le Berre, Daniel; Simon, Laurent}, Fifty-five solvers in Vancouver: The SAT 2004 competition, 321-344 [Zbl 1122.68609] \textit{Heule, Marijn; Dufour, Mark; van Zwieten, Joris; van Maaren, Hans}, March\_eq: Implementing additional reasoning into an efficient look-ahead SAT solver, 345-359 [Zbl 1122.68599] \textit{Mahajan, Yogesh S.; Fu, Zhaohui; Malik, Sharad}, Zchaff2004: An efficient SAT solver, 360-375 [Zbl 1122.68610] \textit{Le Berre, Daniel; Narizzano, Massimo; Simon, Laurent; Tacchella, Armando}, The second QBF solvers comparative evaluation, 376-392 [Zbl 1122.68608]
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references