João Marques-Silva, Karem A. Sakallah
Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing
SAT, 2007.

@proceedings{SAT-2007,
	address       = "Lisbon, Portugal",
	editor        = "João Marques-Silva and Karem A. Sakallah",
	isbn          = "978-3-540-72787-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing}",
	volume        = 4501,
	year          = 2007,
}

Contents (36 items)

17 ×#satisfiability
4 ×#problem
3 ×#bound
3 ×#encoding
3 ×#polynomial
2 ×#effectiveness
2 ×#logic
2 ×#matrix
2 ×#multi
2 ×#named

SAT-2007-Davis #named #past present future #satisfiability

SAT: Past and Future (MD), pp. 1–2.

SAT-2007-PerezV #effectiveness #encoding #logic #problem

Encodings of Problems in Effectively Propositional Logic (JANP, AV), p. 3.

SAT-2007-ManoliosV #performance

Efficient Circuit to CNF Conversion (PM, DV), pp. 4–9.

SAT-2007-AnsoteguiBLM #csp #satisfiability

Mapping CSP into Many-Valued SAT (CA, MLB, JL, FM), pp. 10–15.

SAT-2007-AudemardS #encoding

Circuit Based Encoding of CNF Formula (GA, LS), pp. 16–21.

SAT-2007-LynceM #matrix #modelling #satisfiability #symmetry

Breaking Symmetries in SAT Matrix Models (IL, JPMS), pp. 22–27.

SAT-2007-ArgelichM #learning #satisfiability

Partial Max-SAT Solvers with Clause Learning (JA, FM), pp. 28–40.

SAT-2007-HerasLO #named #satisfiability

MiniMaxSat: A New Weighted Max-SAT Solver (FH, JL, AO), pp. 41–55.

SAT-2007-LukasiewyczGHT #multi #problem #pseudo

Solving Multi-objective Pseudo-Boolean Problems (ML, MG, CH, JT), pp. 56–69.

SAT-2007-Kojevnikov #bound #linear

Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (AK), pp. 70–79.

SAT-2007-LangloisST #bound

Horn Upper Bounds and Renaming (ML, RHS, GT), pp. 80–93.

SAT-2007-Szeider #set

Matched Formulas and Backdoor Sets (SS), pp. 94–99.

SAT-2007-GomesHSS #theory and practice

Short XORs for Model Counting: From Theory to Practice (CPG, JH, AS, BS), pp. 100–106.

SAT-2007-Prestwich #dependence

Variable Dependency in Local Search: Prevention Is Better Than Cure (SDP), pp. 107–120.

SAT-2007-LiWZ #adaptation #satisfiability

Combining Adaptive Noise and Look-Ahead in Local Search for SAT (CML, WW, HZ), pp. 121–133.

SAT-2007-HeuleM #multi

From Idempotent Generalized Boolean Assignments to Multi-bit Search (MH, HvM), pp. 134–147.

SAT-2007-SchederZ #exponential #product line #satisfiability

Satisfiability with Exponential Families (DS, PZ), pp. 148–158.

SAT-2007-HertelHU #encoding #formal method #satisfiability

Formalizing Dangerous SAT Encodings (AH, PH, AU), pp. 159–172.

SAT-2007-PorschenS #algorithm #problem #satisfiability

Algorithms for Variable-Weighted 2-SAT and Dual Problems (SP, ES), pp. 173–186.

SAT-2007-MakinoTY #on the #problem

On the Boolean Connectivity Problem for Horn Relations (KM, ST, MY), pp. 187–200.

SAT-2007-JussilaBSKW #proving #towards

A First Step Towards a Unified Proof Checker for QBF (TJ, AB, CS, DK, CMW), pp. 201–214.

SAT-2007-SamulowitzB #clustering

Dynamically Partitioning for Solving QBF (HS, FB), pp. 215–229.

SAT-2007-SamerS #quantifier #set

Backdoor Sets of Quantified Boolean Formulas (MS, SS), pp. 230–243.

SAT-2007-BubeckB #bound #preprocessor

Bounded Universal Expansion for Preprocessing QBF (UB, HKB), pp. 244–257.

SAT-2007-HeuleM07a #effectiveness

Effective Incorporation of Double Look-Ahead Procedures (MH, HvM), pp. 258–271.

SAT-2007-EenMS #logic #satisfiability #synthesis

Applying Logic Synthesis for Speeding Up SAT (NE, AM, NS), pp. 272–286.

SAT-2007-DershowitzHN #comprehension #satisfiability #towards

Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver (ND, ZH, AN), pp. 287–293.

SAT-2007-PipatsrisawatD #component #lightweight #satisfiability

A Lightweight Component Caching Scheme for Satisfiability Solvers (KP, AD), pp. 294–299.

SAT-2007-Buresh-OppenheimM #polynomial

Minimum 2CNF Resolution Refutations in Polynomial Time (JBO, DGM), pp. 300–313.

SAT-2007-Kullmann #invariant #matrix #polynomial #satisfiability

Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices (OK), pp. 314–327.

SAT-2007-Gelder #satisfiability #verification

Verifying Propositional Unsatisfiability: Pitfalls to Avoid (AVG), pp. 328–333.

SAT-2007-CimattiGS #flexibility #modulo theories #satisfiability

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories (AC, AG, RS), pp. 334–339.

SAT-2007-FuhsGMSTZ #analysis #polynomial #satisfiability #termination

SAT Solving for Termination Analysis with Polynomial Interpretations (CF, JG, AM, PSK, RT, HZ), pp. 340–354.

SAT-2007-StaberB #fault #locality

Fault Localization and Correction with QBF (SS, RB), pp. 355–368.

SAT-2007-AloulK #approach #deployment #satisfiability

Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach (FAA, NK), pp. 369–376.

SAT-2007-DeKV #using

Inversion Attacks on Secure Hash Functions Using satSolvers (DD, AK, RV), pp. 377–382.