dblp.uni-trier.dewww.uni-trier.de

Sylvie Coste-Marquis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
20EESylvie Coste-Marquis, Pierre Marquis: Recovering Consistency by Forgetting Inconsistency. JELIA 2008: 113-125
2007
19EESylvie Coste-Marquis, Caroline Devred, Sébastien Konieczny, Marie-Christine Lagasquie-Schiex, Pierre Marquis: On the merging of Dung's argumentation systems. Artif. Intell. 171(10-15): 730-753 (2007)
2006
18 Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis: Constrained Argumentation Frameworks. KR 2006: 112-122
17 Sylvie Coste-Marquis, Hélène Fargier, Jérôme Lang, Daniel Le Berre, Pierre Marquis: Representing Policies for Quantified Boolean Formulae. KR 2006: 286-297
16EESylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis: Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. JSAT 1(1): 61-88 (2006)
2005
15 Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis: Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI 2005: 288-293
14 Sylvie Coste-Marquis, Caroline Devred, Sébastien Konieczny, Marie-Christine Lagasquie-Schiex, Pierre Marquis: Merging Argumentation Systems. AAAI 2005: 614-619
13EESylvie Coste-Marquis, Caroline Devred, Pierre Marquis: Symmetric Argumentation Frameworks. ECSQARU 2005: 317-328
12EESylvie Coste-Marquis, Caroline Devred, Pierre Marquis: Prudent Semantics for Argumentation Frameworks. ICTAI 2005: 568-572
11EESylvie Coste-Marquis, Pierre Marquis: On the Complexity of Paraconsistent Inference Relations. Inconsistency Tolerance 2005: 151-190
10EESylvie Coste-Marquis, Caroline Devred, Pierre Marquis: Inference from Controversial Arguments. LPAR 2005: 606-620
9EESylvie Coste-Marquis, Daniel Le Berre, Florian Letombe: A Branching Heuristics for Quantified Renamable Horn Formulas. SAT 2005: 393-399
2004
8 Sylvie Coste-Marquis, Pierre Marquis: A Unit Resolution-Based Approach to Tractable and Paraconsistent Reasoning. ECAI 2004: 803-807
7 Sylvie Coste-Marquis, Jérôme Lang, Paolo Liberatore, Pierre Marquis: Expressive Power and Succinctness of Propositional Languages for Preference Representation. KR 2004: 203-212
6EESylvie Coste-Marquis, Pierre Marquis: On Stratified Belief Base Compilation. Ann. Math. Artif. Intell. 42(4): 399-442 (2004)
2002
5 Sylvie Coste-Marquis, Pierre Marquis: Complexity Results for Paraconsistent Inference Relations. KR 2002: 61-72
2001
4EESylvie Coste-Marquis, Pierre Marquis: Knowledge Compilation for Closed World Reasoning and Circumscription. J. Log. Comput. 11(4): 579-607 (2001)
2000
3 Sylvie Coste-Marquis, Pierre Marquis: Compiling Stratified Belief Bases. ECAI 2000: 23-27
1999
2 Sylvie Coste-Marquis, Pierre Marquis: Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. IJCAI 1999: 24-29
1994
1 Sylvie Coste-Marquis: Hypothetical Reasoning for Automatic Recognition of Continuous Speech. ECAI 1994: 565-572

Coauthor Index

1Daniel Le Berre [9] [15] [16] [17]
2Caroline Devred [10] [12] [13] [14] [18] [19]
3Hélène Fargier [17]
4Sébastien Konieczny [14] [19]
5Marie-Christine Lagasquie-Schiex [14] [19]
6Jérôme Lang [7] [17]
7Florian Letombe [9] [15] [16]
8Paolo Liberatore [7]
9Pierre Marquis [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)