Proceedings of the 14th 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

Karem A. Sakallah, Laurent Simon
Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2011.

TEST
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{SAT-2011,
	address       = "Ann Arbor, Michigan, USA",
	doi           = "10.1007/978-3-642-21581-0",
	editor        = "Karem A. Sakallah and Laurent Simon",
	isbn          = "978-3-642-21580-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 6695,
	year          = 2011,
}

Contents (37 items)

SAT-2011-Williams #algorithm #bound #complexity #satisfiability
Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.
SAT-2011-Sen #constraints #testing
Concolic Testing and Constraint Satisfaction (KS), pp. 3–4.
SAT-2011-BeyersdorffGL #complexity
Parameterized Complexity of DPLL Search Procedures (OB, NG, ML), pp. 5–18.
SAT-2011-DantsinH #satisfiability
Satisfiability Certificates Verifiable in Subexponential Time (ED, EAH), pp. 19–32.
SAT-2011-KullmannZ #normalisation #on the
On Variables with Few Occurrences in Conjunctive Normal Forms (OK, XZ), pp. 33–46.
SAT-2011-OrdyniakPS #satisfiability
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (SO, DP, SS), pp. 47–60.
SAT-2011-AbioNOR #constraints #pseudo #revisited
BDDs for Pseudo-Boolean Constraints — Revisited (IA, RN, AO, ERC), pp. 61–75.
SAT-2011-IgnatievS #encryption
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions (AI, AS), pp. 76–89.
SAT-2011-Minato #diagrams #named #performance #permutation #problem
πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space (SiM), pp. 90–104.
SAT-2011-MundhenkZ #equivalence #how #normalisation
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (MM, RZ), pp. 105–119.
SAT-2011-CreignouOS #csp
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (NC, FO, JS), pp. 120–133.
SAT-2011-SpeckenmeyerWP #approach #graph #satisfiability
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (ES, AW, SP), pp. 134–144.
SAT-2011-BelovS #satisfiability
Minimally Unsatisfiable Boolean Circuits (AB, JPMS), pp. 145–158.
SAT-2011-SilvaL #algorithm #on the
On Improving MUS Extraction Algorithms (JPMS, IL), pp. 159–173.
SAT-2011-RyvchinS #performance #satisfiability
Faster Extraction of High-Level Minimal Unsatisfiable Cores (VR, OS), pp. 174–187.
SAT-2011-AudemardLMS #on the
On Freezing and Reactivating Learnt Clauses (GA, JML, BM, LS), pp. 188–200.
SAT-2011-HeuleJB #graph #performance
Efficient CNF Simplification Based on Binary Implication Graphs (MH, MJ, AB), pp. 201–215.
SAT-2011-RamosTH
Between Restarts and Backjumps (AR, PvdT, MH), pp. 216–229.
SAT-2011-JanotaS #algorithm
Abstraction-Based Algorithm for 2QBF (MJ, JPMS), pp. 230–244.
SAT-2011-BuningZB #normalisation #quantifier
Transformations into Normal Forms for Quantified Circuits (HKB, XZ, UB), pp. 245–258.
SAT-2011-LonsingB #detection
Failed Literal Detection for QBF (FL, AB), pp. 259–272.
SAT-2011-AbioDNS
Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (IA, MD, RN, PJS), pp. 273–286.
SAT-2011-Nadel #generative #satisfiability
Generating Diverse Solutions in SAT (AN), pp. 287–301.
SAT-2011-TompkinsBH #heuristic #satisfiability
Captain Jack: New Variable Selection Heuristics in Local Search for SAT (DADT, AB, HHH), pp. 302–316.
SAT-2011-Gelder #multi #ranking
Careful Ranking of Multiple Solvers with Timeouts and Ties (AVG), pp. 317–328.
SAT-2011-Gelder11a #satisfiability
Generalized Conflict-Clause Strengthening for Satisfiability Solvers (AVG), pp. 329–342.
SAT-2011-KatebiSS #empirical #satisfiability
Empirical Study of the Anatomy of Modern Sat Solvers (HK, KAS, JPMS), pp. 343–356.
SAT-2011-Aavani #constraints #pseudo
Translating Pseudo-Boolean Constraints into CNF (AA), pp. 357–359.
SAT-2011-ArgelichLMP #evaluation #satisfiability
Analyzing the Instances of the MaxSAT Evaluation (JA, CML, FM, JP), pp. 360–361.
SAT-2011-BennettS #principle #using
Model Counting Using the Inclusion-Exclusion Principle (HB, SS), pp. 362–363.
SAT-2011-GaoYX #case study #compilation
Phase Transitions in Knowledge Compilation: An Experimental Study (JG, MY, KX), pp. 364–366.
SAT-2011-GableskeH #named #random #satisfiability #using
EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation (OG, MH), pp. 367–368.
SAT-2011-MalitskySSS #algorithm #satisfiability
Non-Model-Based Algorithm Portfolios for SAT (YM, AS, HS, MS), pp. 369–370.
SAT-2011-PetkeJ #csp #encoding #order #satisfiability
The Order Encoding: From Tractable CSP to Tractable SAT (JP, PJ), pp. 371–372.
SAT-2011-PrevitiRSS #satisfiability
Applying UCT to Boolean Satisfiability (AP, RR, MS, BS), pp. 373–374.
SAT-2011-TanjoTB #csp #encoding #finite #performance
A Compact and Efficient SAT-Encoding of Finite Domain CSP (TT, NT, MB), pp. 375–376.
SAT-2011-SilverthornM #learning #satisfiability
Learning Polarity from Structure in SAT (BS, RM), pp. 377–378.

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.