Result 1 to 20 of 112 total
A new look at BDDs for pseudo-Boolean constraints. (English)
J. Artif. Intell. Res. (JAIR) 45, 443-480 (2012).
1
SAT and SMT are still resolution: Questions and challenges. (English)
Gramlich, Bernhard (ed.) et al., Automated reasoning. 6th international joint conference, IJCAR 2012, Manchester, UK, June 26‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31364-6/pbk). Lecture Notes in Computer Science 7364. Lecture Notes in Artificial Intelligence, 10-13 (2012).
2
Reducing chaos in SAT-like search: Finding solutions close to a given one. (English)
Sakallah, Karem A. (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21580-3/pbk). Lecture Notes in Computer Science 6695, 273-286 (2011).
3
BDDs for pseudo-Boolean constraints ‒ revisited. (English)
Sakallah, Karem A. (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21580-3/pbk). Lecture Notes in Computer Science 6695, 61-75 (2011).
4
Cardinality networks: a theoretical and empirical study. (English)
Constraints 16, No. 2, 195-221 (2011).
5
A framework for certified Boolean branch-and-bound optimization. (English)
J. Autom. Reasoning 46, No. 1, 81-102 (2011).
6
Decision procedures in soft, hard and bio-ware - follow up (Dagstuhl seminar 11272) (English)
Dagstuhl Reports 1, No. 7, 23-35 (2011).
7
Bdds for pseudo-Boolean constraints - revisited (English)
SAT, 61-75 (2011).
8
Reducing chaos in SAT-like search: finding solutions close to a given one (English)
SAT, 273-286 (2011).
9
SAT modulo theories: Getting the best of SAT and global constraint filtering. (English)
Cohen, David (ed.), Principles and practice of constraint programming ‒ CP 2010. 16th international conference, CP 2010, St. Andrews, Scotland, September 6‒10, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15395-2/pbk). Lecture Notes in Computer Science 6308, 1-2 (2010).
10
Hard problems in max-algebra, control theory, hypergraphs and other areas. (English)
Inf. Process. Lett. 110, No. 4, 133-138 (2010).
11
Practical algorithms for unsatisfiability proof and core generation in SAT solvers. (English)
AI Commun. 23, No. 2-3, 145-157 (2010).
12
SAT modulo theories: getting the best of SAT and global constraint filtering (English)
CP, 1-2 (2010).
13
Branch and bound for Boolean optimization and the generation of optimality certificates. (English)
Kullmann, Oliver (ed.), Theory and applications of satisfiability testing ‒ SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02776-5/pbk). Lecture Notes in Computer Science 5584, 453-466 (2009).
14
Cardinality networks and their applications. (English)
Kullmann, Oliver (ed.), Theory and applications of satisfiability testing ‒ SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02776-5/pbk). Lecture Notes in Computer Science 5584, 167-180 (2009).
15
SAT modulo theories: Enhancing SAT with special-purpose algorithms. (English)
Kullmann, Oliver (ed.), Theory and applications of satisfiability testing ‒ SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02776-5/pbk). Lecture Notes in Computer Science 5584, 1 (2009).
16
Cardinality networks and their applications (English)
SAT, 167-180 (2009).
17
SAT modulo theories: enhancing SAT with special-purpose algorithms (English)
SAT, 1 (2009).
18
Branch and bound for Boolean optimization and the generation of optimality certificates (English)
SAT, 453-466 (2009).
19
Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra. (English)
Discrete Appl. Math. 156, No. 18, 3506-3509 (2008).
20
Result 1 to 20 of 112 total
Start
Contact
Print
General Help
