Relaxed DPLL Search for MaxSAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Integrating systematic and local search paradigms: a new strategy for MaxSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
What's in Common between Test, Model Checking, and Decision Procedures?
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Autonomous operator management for evolutionary algorithms
Journal of Heuristics
SAT modulo theories: getting the best of SAT and global constraint filtering
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Diversification and intensification in parallel SAT solving
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Exact cover via satisfiability: an empirical study
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Coala: a compiler from action languages to ASP
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Developing approaches for solving a telecommunications feature subscription problem
Journal of Artificial Intelligence Research
Extending clause learning of SAT solvers with Boolean Gröbner bases
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Automated design debugging with maximum satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the virtue of patience: minimizing Büchi automata
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Graph transformation units guided by a sat solver
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Resolution for stochastic Boolean satisfiability
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfaction meets expectations: computing expected values of probabilistic hybrid systems with SMT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Symmetry-breaking answer set solving
AI Communications - Answer Set Programming
An incremental answer set programming based system for finite model computation
AI Communications - Answer Set Programming
Tracing data errors with view-conditioned causality
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Applying SMT in symbolic execution of microcode
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Challenges in answer set solving
Logic programming, knowledge representation, and nonmonotonic reasoning
From adaptive to more dynamic control in evolutionary algorithms
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Beyond unit propagation in SAT solving
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
plasp: a prototype for PDDL-based planning in ASP
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Boolean Gröbner bases in SAT solving
ACM Communications in Computer Algebra
I-RiSC: an SMT-compliant solver for the existential fragment of real algebra
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
BDDs for pseudo-boolean constraints: revisited
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Failed literal detection for QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Generating diverse solutions in SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Compression of propositional resolution proofs via partial regularization
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Variable and clause ordering in an FSA approach to propositional satisfiability
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A dataflow analysis to improve SAT-based bounded program verification
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Adjustable Module Isolation for Distributed Computing Infrastructures
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
Managing SAT inconsistencies with HUMUS
Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
Automated testing and debugging of SAT and QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Minimising deterministic Büchi automata precisely using SAT solving
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Solving constraint satisfaction problems with SAT technology
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Path directed abstraction and refinement in SAT-based design debugging
Proceedings of the 49th Annual Design Automation Conference
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Challenging SMT solvers to verify neural networks
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Parallel QBF Solving with Advanced Knowledge Sharing
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Towards parallel direct SAT-based cryptanalysis
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Lynx: a programmatic SAT solver for the RNA-folding problem
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On davis-putnam reductions for minimally unsatisfiable clause-sets
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
SMT-RAT: an SMT-compliant nonlinear real arithmetic toolbox
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
SAT and SMT are still resolution: questions and challenges
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Optimization in SMT with LA(Q) cost functions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
A comparison of strategies for tolerating inconsistencies during decision-making
Proceedings of the 16th International Software Product Line Conference - Volume 1
Gearing up for effective ASP planning
Correct Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Secure two-party computations in ANSI C
Proceedings of the 2012 ACM conference on Computer and communications security
From graph transformation units via minisat to GrGen.NET
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
From UML and OCL to relational logic and back
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Regular inference as vertex coloring
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
SAS'12 Proceedings of the 19th international conference on Static Analysis
On the application of SAT solvers to the test suite minimization problem
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Implicative simultaneous satisfiability and applications
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Asp modulo csp: The clingcon system
Theory and Practice of Logic Programming
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
Conflict-driven asp solving with external sources
Theory and Practice of Logic Programming
International Journal of Advanced Intelligence Paradigms
Preorders on monads and coalgebraic simulations
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Automated design debugging in a testbench-based verification environment
Microprocessors & Microsystems
NADEEF: a commodity data cleaning system
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths
Proceedings of the Conference on Design, Automation and Test in Europe
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Consistency checking in privacy-aware access control
Proceedings of the 51st ACM Southeast Conference
Boolean satisfiability for sequence mining
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Software model synthesis using satisfiability solvers
Empirical Software Engineering
Modelling distributed network attacks with constraints
International Journal of Bio-Inspired Computation
A symbiosis of interval constraint propagation and cylindrical algebraic decomposition
CADE'13 Proceedings of the 24th international conference on Automated Deduction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Scarab: a rapid prototyping tool for SAT-based constraint programming systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
On computing minimal correction subsets
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Diversely enumerating system-level architectures
Proceedings of the Eleventh ACM International Conference on Embedded Software
Consistency checking in access control
Proceedings of the 4th ACM conference on Data and application security and privacy
Formal verification of synchronous data-flow program transformations toward certified compilers
Frontiers of Computer Science: Selected Publications from Chinese Universities
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution
Journal of Automated Reasoning
Artificial Intelligence: From programs to solvers
AI Communications - ECAI 2012 Turing and Anniversary Track
Hi-index | 0.00 |
'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software. Bounded Model Checking (BMC) of computer hardware is now probably the most widely used model checking technique. The counterexamples that it finds are just satisfying instances of a Boolean formula obtained by unwinding to some fixed depth a sequential circuit and its specification in linear temporal logic. Extending model checking to software verification is a much more difficult problem on the frontier of current research. One promising approach for languages like C with finite word-length integers is to use the same idea as in BMC but with a decision procedure for the theory of bit-vectors instead of SAT. All decision procedures for bit-vectors that I am familiar with ultimately make use of a fast SAT solver to handle complex formulas. Decision procedures for more complicated theories, like linear real and integer arithmetic, are also used in program verification. Most of them use powerful SAT solvers in an essential way. Clearly, efficient SAT solving is a key technology for 21st century computer science. I expect this collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.' Edmund Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University)