Sylvie Coste-Marquis

Orcid: 0000-0003-4742-4858

According to our database1, Sylvie Coste-Marquis authored at least 33 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Rectifying Binary Classifiers.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022
Rectifying Mono-Label Boolean Classifiers.
CoRR, 2022

2021
On Belief Change for Multi-Label Classifier Encodings.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2015
Extension Enforcement in Abstract Argumentation as an Optimization Problem.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

A Translation-Based Approach for Revision of Argumentation Frameworks.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

2012
Weighted Attacks in Argumentation Frameworks.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Selecting Extensions in Weighted Argumentation Frameworks.
Proceedings of the Computational Models of Argument, 2012

2009
Handling controversial arguments.
J. Appl. Non Class. Logics, 2009

2008
Recovering Consistency by Forgetting Inconsistency.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

2007
On the merging of Dung's argumentation systems.
Artif. Intell., 2007

2006
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages.
J. Satisf. Boolean Model. Comput., 2006

Representing Policies for Quantified Boolean Formulae.
Proceedings of the Proceedings, 2006

Constrained Argumentation Frameworks.
Proceedings of the Proceedings, 2006

2005
A Branching Heuristics for Quantified Renamable Horn Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Inference from Controversial Arguments.
Proceedings of the Logic for Programming, 2005

Prudent Semantics for Argumentation Frameworks.
Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 2005

Symmetric Argumentation Frameworks.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2005

On the Complexity of Paraconsistent Inference Relations.
Proceedings of the Inconsistency Tolerance [result from a Dagstuhl seminar], 2005

Merging Argumentation Systems.
Proceedings of the Proceedings, 2005

Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae.
Proceedings of the Proceedings, 2005

2004
On Stratified Belief Base Compilation.
Ann. Math. Artif. Intell., 2004

Expressive Power and Succinctness of Propositional Languages for Preference Representation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

A Unit Resolution-Based Approach to Tractable and Paraconsistent Reasoning.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2002
Complexity Results for Paraconsistent Inference Relations.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

2001
Knowledge Compilation for Closed World Reasoning and Circumscription.
J. Log. Comput., 2001

2000
Compiling Stratified Belief Bases.
Proceedings of the ECAI 2000, 2000

1999
Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1996
Using decision trees to construct optimal acoustic cues.
Proceedings of the 4th International Conference on Spoken Language Processing, 1996

1994
Interaction between most reliable acoustic cues and lexical analysis.
Proceedings of the 3rd International Conference on Spoken Language Processing, 1994

Hypothetical Reasoning for Automatic Recognition of Continuous Speech.
Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

1992
Two level acoustic cues for consistent stop identification.
Proceedings of the Second International Conference on Spoken Language Processing, 1992

A Model for Hypothetical Reasoning Applied to Speech Recognition.
Proceedings of the 10th European Conference on Artificial Intelligence, 1992


  Loading...