Search the dblp DataBase
Sylvie Coste-Marquis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- 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] - Sylvie Coste-Marquis, Caroline Devred, Sébastien Konieczny, Marie-Christine Lagasquie-Schiex, Pierre Marquis
Merging Argumentation Systems. [Citation Graph (0, 0)][DBLP]
AAAI, 2005, pp:614-619 [Conf] - Sylvie Coste-Marquis, Pierre Marquis
On the Complexity of Paraconsistent Inference Relations. [Citation Graph (0, 0)][DBLP]
Inconsistency Tolerance, 2005, pp:151-190 [Conf] - Sylvie Coste-Marquis
Hypothetical Reasoning for Automatic Recognition of Continuous Speech. [Citation Graph (0, 0)][DBLP]
ECAI, 1994, pp:565-572 [Conf] - Sylvie Coste-Marquis, Pierre Marquis
Compiling Stratified Belief Bases. [Citation Graph (0, 0)][DBLP]
ECAI, 2000, pp:23-27 [Conf] - Sylvie Coste-Marquis, Pierre Marquis
A Unit Resolution-Based Approach to Tractable and Paraconsistent Reasoning. [Citation Graph (0, 0)][DBLP]
ECAI, 2004, pp:803-807 [Conf] - Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis
Symmetric Argumentation Frameworks. [Citation Graph (0, 0)][DBLP]
ECSQARU, 2005, pp:317-328 [Conf] - Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis
Prudent Semantics for Argumentation Frameworks. [Citation Graph (0, 0)][DBLP]
ICTAI, 2005, pp:568-572 [Conf] - Sylvie Coste-Marquis, Pierre Marquis
Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. [Citation Graph (0, 0)][DBLP]
IJCAI, 1999, pp:24-29 [Conf] - Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis
Constrained Argumentation Frameworks. [Citation Graph (0, 0)][DBLP]
KR, 2006, pp:112-122 [Conf] - 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] - Sylvie Coste-Marquis, Jérôme Lang, Paolo Liberatore, Pierre Marquis
Expressive Power and Succinctness of Propositional Languages for Preference Representation. [Citation Graph (0, 0)][DBLP]
KR, 2004, pp:203-212 [Conf] - Sylvie Coste-Marquis, Pierre Marquis
Complexity Results for Paraconsistent Inference Relations. [Citation Graph (0, 0)][DBLP]
KR, 2002, pp:61-72 [Conf] - Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis
Inference from Controversial Arguments. [Citation Graph (0, 0)][DBLP]
LPAR, 2005, pp:606-620 [Conf] - 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] - Sylvie Coste-Marquis, Pierre Marquis
On Stratified Belief Base Compilation. [Citation Graph (0, 0)][DBLP]
Ann. Math. Artif. Intell., 2004, v:42, n:4, pp:399-442 [Journal] - Sylvie Coste-Marquis, Pierre Marquis
Knowledge Compilation for Closed World Reasoning and Circumscription. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 2001, v:11, n:4, pp:579-607 [Journal] - Sylvie Coste-Marquis, Caroline Devred, Sébastien Konieczny, Marie-Christine Lagasquie-Schiex, Pierre Marquis
On the merging of Dung's argumentation systems. [Citation Graph (0, 0)][DBLP]
Artif. Intell., 2007, v:171, n:10-15, pp:730-753 [Journal]
Recovering Consistency by Forgetting Inconsistency. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002