default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvie Coste-Marquis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri, Nicolas Szczepanski:
Designing an XAI Interface for Tree-Based ML Models. ECAI 2024: 1075-1082- [c28]Gilles Audemard, Sylvie Coste-Marquis, Pierre Marquis, Mehdi Sabiri:
Rectifier pour mieux distiller. EGC 2024: 59-70 - 2023
- [c27]Sylvie Coste-Marquis
, Pierre Marquis:
Rectifying Binary Classifiers. ECAI 2023: 485-492 - 2022
- [i1]Sylvie Coste-Marquis, Pierre Marquis:
Rectifying Mono-Label Boolean Classifiers. CoRR abs/2206.08758 (2022) - 2021
- [c26]Sylvie Coste-Marquis, Pierre Marquis:
On Belief Change for Multi-Label Classifier Encodings. IJCAI 2021: 1829-1836
2010 – 2019
- 2015
- [c25]Sylvie Coste-Marquis, Sébastien Konieczny, Jean-Guy Mailly, Pierre Marquis:
Extension Enforcement in Abstract Argumentation as an Optimization Problem. IJCAI 2015: 2876-2882 - 2014
- [c24]Sylvie Coste-Marquis, Sébastien Konieczny, Jean-Guy Mailly, Pierre Marquis:
A Translation-Based Approach for Revision of Argumentation Frameworks. JELIA 2014: 397-411 - [c23]Sylvie Coste-Marquis, Sébastien Konieczny, Jean-Guy Mailly, Pierre Marquis:
On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses. KR 2014 - 2012
- [c22]Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, Mohand Akli Ouali:
Selecting Extensions in Weighted Argumentation Frameworks. COMMA 2012: 342-349 - [c21]Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, Mohand Akli Ouali:
Weighted Attacks in Argumentation Frameworks. KR 2012
2000 – 2009
- 2009
- [j5]Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis:
Handling controversial arguments. J. Appl. Non Class. Logics 19(3): 311-369 (2009) - 2008
- [c20]Sylvie Coste-Marquis, Pierre Marquis:
Recovering Consistency by Forgetting Inconsistency. JELIA 2008: 113-125 - 2007
- [j4]Sylvie 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
- [j3]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) - [c19]Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis:
Constrained Argumentation Frameworks. KR 2006: 112-122 - [c18]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 - 2005
- [c17]Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI 2005: 288-293 - [c16]Sylvie Coste-Marquis, Caroline Devred, Sébastien Konieczny, Marie-Christine Lagasquie-Schiex, Pierre Marquis:
Merging Argumentation Systems. AAAI 2005: 614-619 - [c15]Sylvie Coste-Marquis, Pierre Marquis:
On the Complexity of Paraconsistent Inference Relations. Inconsistency Tolerance 2005: 151-190 - [c14]Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis:
Symmetric Argumentation Frameworks. ECSQARU 2005: 317-328 - [c13]Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis:
Prudent Semantics for Argumentation Frameworks. ICTAI 2005: 568-572 - [c12]Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis:
Inference from Controversial Arguments. LPAR 2005: 606-620 - [c11]Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe:
A Branching Heuristics for Quantified Renamable Horn Formulas. SAT 2005: 393-399 - 2004
- [j2]Sylvie Coste-Marquis, Pierre Marquis:
On Stratified Belief Base Compilation. Ann. Math. Artif. Intell. 42(4): 399-442 (2004) - [c10]Sylvie Coste-Marquis, Pierre Marquis:
A Unit Resolution-Based Approach to Tractable and Paraconsistent Reasoning. ECAI 2004: 803-807 - [c9]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 - 2002
- [c8]Sylvie Coste-Marquis, Pierre Marquis:
Complexity Results for Paraconsistent Inference Relations. KR 2002: 61-72 - 2001
- [j1]Sylvie Coste-Marquis, Pierre Marquis:
Knowledge Compilation for Closed World Reasoning and Circumscription. J. Log. Comput. 11(4): 579-607 (2001) - 2000
- [c7]Sylvie Coste-Marquis, Pierre Marquis:
Compiling Stratified Belief Bases. ECAI 2000: 23-27
1990 – 1999
- 1999
- [c6]Sylvie Coste-Marquis, Pierre Marquis:
Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. IJCAI 1999: 24-29 - 1996
- [c5]Sandrine Robbe, Anne Bonneau, Sylvie Coste, Yves Laprie:
Using decision trees to construct optimal acoustic cues. ICSLP 1996: 137-140 - 1994
- [c4]Sylvie Coste-Marquis:
Hypothetical Reasoning for Automatic Recognition of Continuous Speech. ECAI 1994: 565-572 - [c3]Sylvie Coste-Marquis:
Interaction between most reliable acoustic cues and lexical analysis. ICSLP 1994: 2187-2190 - 1992
- [c2]Anne Bonneau, François Charpillet, Sylvie Coste, Jean Paul Haton, Yves Laprie, Pierre Marquis:
A Model for Hypothetical Reasoning Applied to Speech Recognition. ECAI 1992: 553-557 - [c1]Anne Bonneau, Sylvie Coste, Linda Djezzar, Yves Laprie:
Two level acoustic cues for consistent stop identification. ICSLP 1992: 511-514
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
