Result 1 to 20 of 50 total
A new look at BDDs for pseudo-Boolean constraints. (English)
J. Artif. Intell. Res. (JAIR) 45, 443-480 (2012).
1
SAT modulo linear arithmetic for solving polynomial constraints. (English)
J. Autom. Reasoning 48, No. 1, 107-131 (2012).
2
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).
3
Cardinality networks: a theoretical and empirical study. (English)
Constraints 16, No. 2, 195-221 (2011).
4
A framework for certified Boolean branch-and-bound optimization. (English)
J. Autom. Reasoning 46, No. 1, 81-102 (2011).
5
Bdds for pseudo-Boolean constraints - revisited (English)
SAT, 61-75 (2011).
6
Semiring-induced propositional logic: definition and basic algorithms. (English)
Clarke, Edmund M. (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 16th international conference, LPAR-16, Dakar, Senegal, April 25 ‒ May 1, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-17510-7/pbk). Lecture Notes in Computer Science 6355. Lecture Notes in Artificial Intelligence, 332-347 (2010).
7
Practical algorithms for unsatisfiability proof and core generation in SAT solvers. (English)
AI Commun. 23, No. 2-3, 145-157 (2010).
8
Semiring-induced propositional logic: definition and basic algorithms (English)
LPAR (Dakar), 332-347 (2010).
9
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).
10
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).
11
Cardinality networks and their applications (English)
SAT, 167-180 (2009).
12
Branch and bound for Boolean optimization and the generation of optimality certificates (English)
SAT, 453-466 (2009).
13
Minimaxsat: an efficient weighted Max-SAT solver. (English)
J. Artif. Intell. Res. (JAIR) 31, 1-32 (2008).
14
Design and results of the 3rd annual satisfiability modulo theories competition (SMT-comp 2007). (English)
Int. J. Artif. Intell. Tools 17, No. 4, 569-606 (2008).
15
Efficient generation of unsatisfiability proofs and cores in SAT. (English)
Cervesato, Iliano (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 15th international conference, LPAR 2008, Doha, Qatar, November 22‒27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-89438-4/pbk). Lecture Notes in Computer Science 5330. Lecture Notes in Artificial Intelligence, 16-30 (2008).
16
Preface. (English)
Electron. Notes Theor. Comput. Sci. 198, No. 2, 1-2 (2008).
17
The Barcelogic SMT solver. Tool paper. (English)
Gupta, Aarti (ed.) et al., Computer aided verification. 20th international conference, CAV 2008, Princeton, NJ, USA, July 7‒14, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-70543-7/pbk). Lecture Notes in Computer Science 5123, 294-298 (2008).
18
SAT modulo the theory of linear arithmetic: Exact, inexact and commercial solvers. (English)
Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12‒15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 77-90 (2008).
19
A write-based solver for SAT modulo the theory of arrays (English)
FMCAD, 1-8 (2008).
20
Result 1 to 20 of 50 total
Start
Contact
Print
General Help
