Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Daniel Le Berre

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Florian Letombe

> Home > Persons > Daniel Le Berre

Publications

2006
[j8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jsat/Coste-MarquisBLM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsat/Coste-MarquisBLM06
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. J. Satisf. Boolean Model. Comput. 1(1): 61-88 (2006)
2005
[c11]
- view
  - electronic edition @ aaai.org (archived)
  - no references & citations available
- export record
  dblp key:
  - conf/aaai/Coste-MarquisBLM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/Coste-MarquisBLM05
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI 2005: 288-293
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/sat/Coste-MarquisBL05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/Coste-MarquisBL05
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe:
A Branching Heuristics for Quantified Renamable Horn Formulas. SAT 2005: 393-399

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.