Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing
SAT, 2004.

@proceedings{SAT-2004,
	address       = "Vancouver, British Columbia, Canada",
	title         = "{Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing}",
	year          = 2004,
}

Contents (30 items)

14 ×#satisfiability
5 ×#algorithm
3 ×#problem
3 ×#quantifier
3 ×#using
2 ×#algebra
2 ×#constraints
2 ×#detection
2 ×#named
2 ×#performance

SAT-2004-Connamacher #constraints #problem #random

A Random Constraint Satisfaction Problem That Seems Hard for DPLL (HSC), pp. 3–11.

SAT-2004-JiaMS #satisfiability

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

SAT-2004-SangBBKP #component #effectiveness #learning

Combining Component Caching and Clause Learning for Effective Model Counting (TS, FB, PB, HAK, TP), pp. 20–28.

SAT-2004-LewisSB #detection #satisfiability

Early Conflict Detection Based BCP for SAT Solving (MDTL, TS, BB), pp. 29–36.

SAT-2004-TompkinsH #algorithm #implementation #named #satisfiability

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

SAT-2004-JinS #hybrid #named #satisfiability

CirCUs: A Hybrid Satisfiability Solver (HJ, FS), pp. 47–55.

SAT-2004-GummadiNV #algorithm #independence #satisfiability #set #using

Algorithms for Satisfiability using Independent Sets of Variables (RG, NSN, VR), pp. 56–63.

SAT-2004-Interian #algorithm #approximate #random

Approximation Algorithm for Random MAX-kSAT (YI), pp. 64–68.

SAT-2004-DantsinW #algorithm #satisfiability

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

SAT-2004-GalesiK #polynomial #rank #satisfiability

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

SAT-2004-HooryS #satisfiability

Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable (SH, SS), pp. 86–95.

SAT-2004-NishimuraRS #detection #set

Detecting Backdoor Sets with Respect to Horn and Binary Clauses (NN, PR, SS), pp. 96–103.

SAT-2004-Stachniak

A Note on Satisfying Truth-Value Assignments of Boolean Formulas (ZS), pp. 104–110.

SAT-2004-AnsoteguiM #problem

Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables (CA, FM), pp. 111–119.

SAT-2004-ManquinhoM #bound #optimisation #pseudo #satisfiability #using

Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization (VMM, JPMS), pp. 120–126.

SAT-2004-HuangD #performance #using

Using DPLL for Efficient OBDD Construction (JH, AD), pp. 127–136.

SAT-2004-PanV #satisfiability

Search vs. Symbolic Techniques in Satisfiability Solving (GP, MYV), pp. 137–146.

SAT-2004-ThiffaultBW

Solving Non-clausal Formulas with DPLL search (CT, FB, TW), pp. 147–156.

SAT-2004-GregoireOMS #automation #dependence #functional

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

SAT-2004-ArmandoCGM #constraints #difference #satisfiability

A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints (AA, CC, EG, MM), pp. 166–173.

SAT-2004-HeuleM

Aligning CNF- and Equivalence-reasoning (MH, HvM), pp. 174–180.

SAT-2004-BaulandCCHV #algebra #approach #complexity #query

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

SAT-2004-ZhangLS #satisfiability

A SAT Based Scheduler for Tournament Schedules (HZ, DL, HS), pp. 191–196.

SAT-2004-Velev #encoding #performance #satisfiability

Encoding Global Unobservability for Efficient Translation to SAT (MNV), pp. 197–204.

SAT-2004-BenedettiB #incremental

Incremental Compilation-to-SAT Procedures (MB, SB), pp. 205–213.

SAT-2004-TangYRM #algorithm #analysis #problem #quantifier #satisfiability

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

SAT-2004-ChenD #algebra #quantifier

Looking Algebraically at Tractable Quantified Boolean Formulas (HC, VD), pp. 224–229.

SAT-2004-BuningZ #equivalence #modelling #quantifier

Equivalence Models for Quantified Boolean Formulas (HKB, XZ), pp. 230–237.

SAT-2004-Biere

Resolve and Expand (AB), pp. 238–246.

SAT-2004-GiunchigliaNT #reasoning

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