The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Le Berre: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis
    Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:288-293 [Conf]
  2. Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin
    Logical Representation and Computation of Optimal Decisions in a Qualitative Setting. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:588-593 [Conf]
  3. Salem Benferhat, Daniel Le Berre, Karima Sedki
    An Alternative Inference for Qualitative Choice Logic. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:741-742 [Conf]
  4. Thierry Castell, Claudette Cayrol, Michel Cayrol, Daniel Le Berre
    Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:350-354 [Conf]
  5. Leila Amgoud, Claudette Cayrol, Daniel Le Berre
    Comparing Arguments Using Preference Ordering for Argument-Based Reasoning. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1996, pp:400-403 [Conf]
  6. Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams
    Weakening Conflicting Information for Iterated Revision and Knowledge Integration. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:109-118 [Conf]
  7. Gerhard Brewka, Salem Benferhat, Daniel Le Berre
    Qualitative Choice Logic. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:158-169 [Conf]
  8. Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Daniel Le Berre, Pierre Marquis
    Representing Policies for Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:286-297 [Conf]
  9. Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella
    The Second QBF Solvers Comparative Evaluation. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:376-392 [Conf]
  10. Daniel Le Berre, Laurent Simon
    The Essentials of the SAT 2003 Competition. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:452-467 [Conf]
  11. Daniel Le Berre, Laurent Simon
    Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:321-344 [Conf]
  12. Daniel Le Berre, Laurent Simon, Armando Tacchella
    Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:468-485 [Conf]
  13. Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe
    A Branching Heuristics for Quantified Renamable Horn Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:393-399 [Conf]
  14. Salem Benferhat, Souhila Kaci, Daniel Le Berre, Mary-Anne Williams
    Weakening conflicting information for iterated revision and knowledge integration. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:153, n:1-2, pp:339-371 [Journal]
  15. Gerhard Brewka, Salem Benferhat, Daniel Le Berre
    Qualitative choice logic. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:157, n:1-2, pp:203-237 [Journal]
  16. Paul W. Purdom, Daniel Le Berre, Laurent Simon
    A parsimony tree for the SAT2002 competition. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:343-365 [Journal]
  17. Laurent Simon, Daniel Le Berre, Edward A. Hirsch
    The SAT2002 competition. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:307-342 [Journal]
  18. Didier Dubois, Daniel Le Berre, Henri Prade, Régis Sabbadin
    Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:37, n:1-2, pp:1-30 [Journal]
  19. Salem Benferhat, Daniel Le Berre, Karima Sedki
    Handling Qualitative Preferences Using Normal Form Functions. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2007, pp:38-43 [Conf]

  20. On SAT Technologies for Dependency Management and Beyond. [Citation Graph (, )][DBLP]


  21. Aggregating Interval Orders by Propositional Optimization. [Citation Graph (, )][DBLP]


  22. Solving Linux Upgradeability Problems Using Boolean Optimization [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002