Proceedings of the Ninth International Conference on Theory and Applications of Satisfiability Testing
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Armin Biere, Carla P. Gomes
Proceedings of the Ninth International Conference on Theory and Applications of Satisfiability Testing
SAT, 2006.

TEST
DBLP
Scholar
Full names Links ISxN
@proceedings{SAT-2006,
	address       = "Seattle, Washington, USA",
	editor        = "Armin Biere and Carla P. Gomes",
	isbn          = "3-540-37206-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Ninth International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 4121,
	year          = 2006,
}

Contents (39 items)

SAT-2006-SheiniS #modulo theories #satisfiability
From Propositional Satisfiability to Satisfiability Modulo Theories (HMS, KAS), pp. 1–9.
SAT-2006-Bacchus #named #satisfiability
CSPs: Adding Structure to SAT (FB), p. 10.
SAT-2006-KojevnikovK #algebra #complexity #proving #strict
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (AK, ASK), pp. 11–21.
SAT-2006-KullmannLM #agile #categorisation #kernel #normalisation #satisfiability
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (OK, IL, JMS), pp. 22–35.
SAT-2006-DershowitzHN #algorithm #satisfiability #scalability
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (ND, ZH, AN), pp. 36–41.
SAT-2006-Buresh-OppenheimM #satisfiability
Minimum Witnesses for Unsatisfiable 2CNFs (JBO, DGM), pp. 42–47.
SAT-2006-Gelder #metric #proving
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs (AVG), pp. 48–53.
SAT-2006-JussilaSB #proving #quantifier #satisfiability
Extended Resolution Proofs for Symbolic SAT Solving with Quantification (TJ, CS, AB), pp. 54–60.
SAT-2006-ChaviraD #analysis #component #encoding
Encoding CNFs to Empower Component Analysis (MC, AD), pp. 61–74.
SAT-2006-JainBC #satisfiability #using
Satisfiability Checking of Non-clausal Formulas Using General Matings (HJ, CB, EMC), pp. 75–89.
SAT-2006-Goldberg #algorithm
Determinization of Resolution by an Algorithm Operating on Complete Assignments (EG), pp. 90–95.
SAT-2006-Zhang #random
A Complete Random Jump Strategy with Guiding Paths (HZ), pp. 96–101.
SAT-2006-MironovZ #satisfiability
Applications of SAT Solvers to Cryptanalysis of Hash Functions (IM, LZ), pp. 102–115.
SAT-2006-ZabiyakaD #bound #complexity #dependence #functional
Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies (YZ, AD), pp. 116–129.
SAT-2006-SebastianiV #case study #encoding #logic #satisfiability
Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC (RS, MV), pp. 130–135.
SAT-2006-LynceM #satisfiability #type inference
SAT in Bioinformatics: Making the Case with Haplotype Inference (IL, JMS), pp. 136–141.
SAT-2006-YuM #constraints #learning #linear #smt
Lemma Learning in SMT on Linear Constraints (YY, SM), pp. 142–155.
SAT-2006-NieuwenhuisO #modulo theories #on the #optimisation #problem #satisfiability
On SAT Modulo Theories and Optimization Problems (RN, AO), pp. 156–169.
SAT-2006-CottonM #constraints #difference #flexibility #performance
Fast and Flexible Difference Constraint Propagation for DPLL(T) (SC, OM), pp. 170–183.
SAT-2006-SheiniS06a #modulo theories #satisfiability
A Progressive Simplifier for Satisfiability Modulo Theories (HMS, KAS), pp. 184–197.
SAT-2006-BubeckB #complexity #dependence #modelling #quantifier
Dependency Quantified Horn Formulas: Models and Complexity (UB, HKB), pp. 198–211.
SAT-2006-PorschenSR #linear #on the
On Linear CNF Formulas (SP, ES, BR), pp. 212–225.
SAT-2006-ChenIJSS #constraints #problem #theorem
A Dichotomy Theorem for Typed Constraint Satisfaction Problems (SC, TI, KJ, DS, MS), pp. 226–239.
SAT-2006-BonetLM #calculus #satisfiability
A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.
SAT-2006-FuM #on the #problem #satisfiability
On Solving the Partial MAX-SAT Problem (ZF, SM), pp. 252–265.
SAT-2006-DantsinW #constant #performance #satisfiability
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.
SAT-2006-WatanabeY #analysis #problem #satisfiability
Average-Case Analysis for the MAX-2SAT Problem (OW, MY), pp. 277–282.
SAT-2006-PrestwichL #satisfiability
Local Search for Unsatisfiability (SDP, IL), pp. 283–296.
SAT-2006-BulatovS #performance
Efficiency of Local Search (AAB, ESS), pp. 297–310.
SAT-2006-ManoliosZ #implementation #overview
Implementing Survey Propagation on Graphics Processing Units (PM, YZ), pp. 311–324.
SAT-2006-HsuM #satisfiability
Characterizing Propagation Methods for Boolean Satisfiability (EIH, SAM), pp. 325–338.
SAT-2006-BuningZ #quantifier
Minimal False Quantified Boolean Formulas (HKB, XZ), pp. 339–352.
SAT-2006-SamulowitzB #reasoning
Binary Clause Reasoning in QBF (HS, FB), pp. 353–367.
SAT-2006-TangM #quantifier
Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares (DT, SM), pp. 368–381.
SAT-2006-SabharwalAGHS #modelling #performance #symmetry
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (AS, CA, CPG, JWH, BS), pp. 382–395.
SAT-2006-NishimuraRS #satisfiability #using
Solving #SAT Using Vertex Covers (NN, PR, SS), pp. 396–409.
SAT-2006-MorgadoMMM #integer #modelling
Counting Models in Integer Domains (AM, PJM, VMM, JPMS), pp. 410–423.
SAT-2006-Thurley #component #modelling #named
sharpSAT — Counting Models with Advanced Component Caching and Implicit BCP (MT), pp. 424–429.
SAT-2006-HyvarinenJN #satisfiability
A Distribution Method for Solving SAT in Grids (AEJH, TAJ, IN), pp. 430–435.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.