Holger H. Hoos, David G. Mitchell
Revised Selected Papers of the Seventh International Conference on Theory and Applications of Satisfiability Testing
SAT, 2005.

@proceedings{SAT-J-2004,
	address       = "Vancouver, British Columbia, Canada",
	editor        = "Holger H. Hoos and David G. Mitchell",
	isbn          = "3-540-27829-X",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Selected Papers of the Seventh International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 3542,
	year          = 2005,
}

Contents (28 items)

14 ×#satisfiability
5 ×#algorithm
5 ×#named
3 ×#performance
3 ×#problem
3 ×#quantifier
2 ×#algebra
2 ×#implementation
2 ×#random
2 ×#reasoning

SAT-J-2004-AnsoteguiM05 #problem

Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables (CA, FM), pp. 1–15.

SAT-J-2004-ArmandoCGM05 #constraints #difference #satisfiability

A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints (AA, CC, EG, MM), pp. 16–29.

SAT-J-2004-BaulandCCHV05 #algebra #approach #complexity #query

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 30–45.

SAT-J-2004-BenedettiB05 #incremental

Incremental Compilation-to-SAT Procedures (MB, SB), pp. 46–58.

SAT-J-2004-Biere05

Resolve and Expand (AB), pp. 59–70.

SAT-J-2004-ChenD05 #algebra #quantifier

Looking Algebraically at Tractable Quantified Boolean Formulas (HC, VD), pp. 71–79.

SAT-J-2004-DantsinW05 #algorithm #satisfiability

Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 80–88.

SAT-J-2004-GalesiK05 #polynomial #rank #satisfiability

Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 89–104.

SAT-J-2004-GiunchigliaNT05 #reasoning

QBF Reasoning on Real-World Instances (EG, MN, AT), pp. 105–121.

SAT-J-2004-GregoireOMS05 #automation #dependence #functional

Automatic Extraction of Functional Dependencies (ÉG, RO, BM, LS), pp. 122–132.

SAT-J-2004-GummadiNV05 #algorithm #independence #satisfiability #set #using

Algorithms for Satisfiability Using Independent Sets of Variables (RG, NSN, VR), pp. 133–144.

SAT-J-2004-HeuleM05

Aligning CNF- and Equivalence-Reasoning (MH, HvM), pp. 145–156.

SAT-J-2004-HuangD05 #performance #using

Using DPLL for Efficient OBDD Construction (JH, AD), pp. 157–172.

SAT-J-2004-Interian05 #algorithm #approximate #random

Approximation Algorithm for Random MAX- kSAT (YI), pp. 173–182.

SAT-J-2004-JacksonS05

Clause Form Conversions for Boolean Circuits (PJ, DS), pp. 183–198.

SAT-J-2004-JiaMS05 #satisfiability

From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 199–210.

SAT-J-2004-JinS05 #hybrid #named #satisfiability

CirCUs: A Hybrid Satisfiability Solver (HJ, FS), pp. 211–223.

SAT-J-2004-BuningZ05 #equivalence #modelling #quantifier

Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 224–234.

SAT-J-2004-PanV05 #satisfiability

Search vs. Symbolic Techniques in Satisfiability Solving (GP, MYV), pp. 235–250.

SAT-J-2004-PorschenS05 #bound #problem

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.

SAT-J-2004-Sinopalnikov05 #random #satisfiability

Satisfiability Threshold of the Skewed Random k-SAT (DAS), pp. 263–275.

SAT-J-2004-SubbarayanP05 #named #preprocessor #satisfiability

NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances (SS, DKP), pp. 276–291.

SAT-J-2004-TangYRM05 #algorithm #analysis #problem #quantifier #satisfiability

Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.

SAT-J-2004-TompkinsH05 #algorithm #implementation #named #satisfiability

UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT (DADT, HHH), pp. 306–320.

SAT-J-2004-BerreS05 #contest #satisfiability

Fifty-Five Solvers in Vancouver: The SAT 2004 Competition (DLB, LS), pp. 321–344.

SAT-J-2004-HeuleDZM05 #implementation #named #performance #reasoning #satisfiability

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver (MH, MD, JvZ, HvM), pp. 345–359.

SAT-J-2004-MahajanFM05 #named #performance #satisfiability

Zchaff2004: An Efficient SAT Solver (YSM, ZF, SM), pp. 360–375.

SAT-J-2004-BerreNST05 #comparative #evaluation

The Second QBF Solvers Comparative Evaluation (DLB, MN, LS, AT), pp. 376–392.