| 2008 |
|---|
| 16 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
Quantified Constraint Optimization.
CP 2008: 463-477 |
| 15 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
Modeling adversary scheduling with QCSP+.
SAC 2008: 151-155 |
| 2007 |
|---|
| 14 | EE | Hratch Mangassarian,
Andreas G. Veneris,
Sean Safarpour,
Marco Benedetti,
Duncan Smith:
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test.
ICCAD 2007: 240-245 |
| 13 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
QCSP Made Practical by Virtue of Restricted Quantification.
IJCAI 2007: 38-43 |
| 2006 |
|---|
| 12 | | Marco Benedetti:
Abstract Branching for Quantified Formulas.
AAAI 2006 |
| 11 | EE | Marco Benedetti,
Arnaud Lallouet,
Jérémie Vautard:
Reusing CSP Propagators for QCSPs.
CSCLP 2006: 63-77 |
| 2005 |
|---|
| 10 | EE | Marco Benedetti:
sKizzo: A Suite to Evaluate and Certify QBFs.
CADE 2005: 369-376 |
| 9 | EE | Marco Benedetti:
Extracting Certificates from Quantified Boolean Formulas.
IJCAI 2005: 47-53 |
| 8 | EE | Marco Benedetti,
Luigia Carlucci Aiello:
SAT-Based Cooperative Planning: A Proposal.
Mechanizing Mathematical Reasoning 2005: 494-513 |
| 7 | EE | Marco Benedetti:
Quantifier Trees for QBFs.
SAT 2005: 378-385 |
| 6 | | Marco Benedetti:
Hybrid Evaluation Procedures for QBF.
Intelligenza Artificiale 2(3): 37-44 (2005) |
| 2004 |
|---|
| 5 | EE | Marco Benedetti:
Evaluating QBFs via Symbolic Skolemization.
LPAR 2004: 285-300 |
| 4 | EE | Marco Benedetti,
Sara Bernardini:
Incremental Compilation-to-SAT Procedures.
SAT 2004 |
| 3 | EE | Marco Benedetti,
Sara Bernardini:
Incremental Compilation-to-SAT Procedures.
SAT (Selected Papers 2004: 46-58 |
| 2003 |
|---|
| 2 | EE | Marco Benedetti,
Alessandro Cimatti:
Bounded Model Checking for Past LTL.
TACAS 2003: 18-33 |
| 2001 |
|---|
| 1 | EE | Marco Benedetti:
Conditional Pure Literal Graphs.
IJCAR 2001: 331-346 |
