Keyword:satisfiability

Publications
Semantic Computation of the Propositional Model Composites in Enactment Logic. Frank Appiah EasyChair Preprint 6186
Minimizing Sorting Networks at the Sub-Comparator Level Luís Cruz-Filipe and Peter Schneider-Kamp In:Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning
Sensitivity Analysis of Locked Circuits Joseph Sweeney, Marijn J. H. Heule and Lawrence Pileggi In:LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
The Potential of Interference-Based Proof Systems Marijn Heule and Benjamin Kiesl In:ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements
Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures Martin Aigner, Armin Biere, Christoph Kirsch, Aina Niemetz and Mathias Preiner In:POS-13. Pragmatics of SAT 2013
An SMT-based approach to automated configuration Raphaël Michel, Arnaud Hubaux, Vijay Ganesh and Patrick Heymans In:SMT 2012. 10th International Workshop on Satisfiability Modulo Theories
Practical Aspects of SAT Solving Armin Biere In:PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning
Authorization Enforcement in Workflows: Maintaining Realizability Via Automated Reasoning Jason Crampton, Michael Huth and Jim Huan-Pu Kuo In:PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning
On Solving MaxSAT Through SAT Carlos Ansótegui, María Luisa Bonet and Jordi Levy In:POS-10. Pragmatics of SAT