| |
| 2008 | ||
|---|---|---|
| 12 | EE | Renato Bruni, Andrea Santori: New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability. Discrete Optimization 5(3): 569-583 (2008) |
| 2007 | ||
| 11 | EE | Renato Bruni: Reformulation of the support set selection problem in the logical analysis of data. Annals OR 150(1): 79-92 (2007) |
| 2005 | ||
| 10 | EE | Renato Bruni: On exact selection of minimally unsatisfiable subformulae. Ann. Math. Artif. Intell. 43(1): 35-50 (2005) |
| 9 | EE | Renato Bruni: On the orthogonalization of arbitrary Boolean formulae. JAMDS 9(2): 61-74 (2005) |
| 2004 | ||
| 8 | EE | Renato Bruni, Andrea Santori: Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers. SAT 2004 |
| 7 | EE | Renato Bruni: Discrete models for data imputation. Discrete Applied Mathematics 144(1-2): 59-69 (2004) |
| 2003 | ||
| 6 | EE | Renato Bruni: Solving Error Correction for Large Data Sets by Means of a SAT Solver. SAT 2003: 229-241 |
| 5 | EE | Renato Bruni, Antonio Sassano: A Complete Adaptive Algorithm for Propositional Satisfiability. Discrete Applied Mathematics 127(3): 523-534 (2003) |
| 4 | EE | Renato Bruni: Approximating minimal unsatisfiable subformulae by means of adaptive core search. Discrete Applied Mathematics 130(2): 85-100 (2003) |
| 2001 | ||
| 3 | EE | Renato Bruni, Antonio Sassano: Errors Detection and Correction in Large Scale Data Collecting. IDA 2001: 84-94 |
| 2 | EE | Renato Bruni, Antonio Sassano: Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae. Electronic Notes in Discrete Mathematics 9: 162-173 (2001) |
| 2000 | ||
| 1 | EE | Renato Bruni, Antonio Sassano: Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances. CP 2000: 495-499 |
| 1 | Andrea Santori | [8] [12] |
| 2 | Antonio Sassano | [1] [2] [3] [5] |