Sylvie Coste-Marquis
Research Subjects
Sylvie Coste-Marquis has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Pierre Marquis
CRIL,Université d’Artois – CNRS
8 shared publicationsCaroline Devred
LERIA/Université d'Angers, UFR Sciences , 2, Bd Lavoisier, 49045 , Angers Cedex 01, France
4 shared publications- Pierre Marquis
Univ. Artois, CNRS, CRIL, Lens, France
3 shared publications - Sébastien Konieczny
Univ. Artois, CNRS, CRIL, Lens, France
2 shared publications C. Devred
CRIL/CNRS, Univ. d'Artois, Lens, France
1 shared publicationDaniel Le Berre
CRIL, CNRS FRE 2499
1 shared publication
Latest Publications
- Open Access
- 28 September 2023
- Published by IOS Press
- p. 485-492
Rectifying Binary Classifiers
We elaborate on the notion of rectification of a classifier Σ based on Boolean features, introduced in [10]. The purpose is to determine how to modify Σ when the way it classifies a given instance is considered incorrect since it conflicts with some expert knowledge T. Given Σ and T , postulates characterizing the way Σ must be changed into a new classifier Σ T that complies with T were presented. We focus here on the specific case of binary classifiers, i.e., there is a single target concept, and any instance is classified either as positive (an element of the concept), or as negative (an element of the complementary concept). In this specific case, our main contribution is twofold: (1) we show that there is a unique rectification operator satisfying the postulates, and (2) when Σ and T are Boolean circuits, we show how a classification circuit equivalent to Σ T can be computed in time linear in the size of Σ and T ; when Σ is a decision tree (resp. a random forest, a boosted tree) and T is a decision tree, a decision tree (resp. a random forest, a boosted tree) equivalent to Σ T can be computed in time polynomial in the size of Σ and T .
- 28 September 2023
- Published by IOS Press
- p. 485-492
Open AccessRectifying Binary Classifiers
We elaborate on the notion of rectification of a classifier Σ based on Boolean features, introduced in [10]. The purpose is to determine how to modify Σ when the way it classifies a given instance is considered incorrect since it conflicts with some expert knowledge T. Given Σ and T , postulates characterizing the way Σ must be changed into a new classifier Σ T that complies with T were presented. We focus here on the specific case of binary classifiers, i.e., there is a single target concept, and any instance is classified either as positive (an element of the concept), or as negative (an element of the complementary concept). In this specific case, our main contribution is twofold: (1) we show that there is a unique rectification operator satisfying the postulates, and (2) when Σ and T are Boolean circuits, we show how a classification circuit equivalent to Σ T can be computed in time linear in the size of Σ and T ; when Σ is a decision tree (resp. a random forest, a boosted tree) and T is a decision tree, a decision tree (resp. a random forest, a boosted tree) equivalent to Σ T can be computed in time polynomial in the size of Σ and T .
- 1 January 2014
- Published by Springer Nature
- p. 397-411
A Translation-Based Approach for Revision of Argumentation Frameworks
- 1 January 2014
- Published by Springer Nature
- p. 397-411
A Translation-Based Approach for Revision of Argumentation Frameworks
- 1 January 2009
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 19 (3) , 311-369
Handling controversial arguments
We present two prudent semantics within Dung's theory of arg umentation. 1 They are based on two new notions of extension, referred to as p-exten sion and c-extension. Two argu- ments cannot belong to the same p-extension whenever one of t hem attacks indirectly the other one. Two arguments cannot belong to the same c-extension whe never one of them indirectly attacks a third argument while the other one indirectly defe nds the third. We argue that our semantics lead to a better handling of controversial argume nts than Dung's ones. We compare the prudent inference relations induced by our semantics w. r.t. cautiousness; we also compare them with the inference relations induced by Dung's semanti cs.
- 1 January 2009
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 19 (3) , 311-369
Handling controversial arguments
We present two prudent semantics within Dung's theory of arg umentation. 1 They are based on two new notions of extension, referred to as p-exten sion and c-extension. Two argu- ments cannot belong to the same p-extension whenever one of t hem attacks indirectly the other one. Two arguments cannot belong to the same c-extension whe never one of them indirectly attacks a third argument while the other one indirectly defe nds the third. We argue that our semantics lead to a better handling of controversial argume nts than Dung's ones. We compare the prudent inference relations induced by our semantics w. r.t. cautiousness; we also compare them with the inference relations induced by Dung's semanti cs.
- 23 September 2008
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 113-125
Recovering Consistency by Forgetting Inconsistency
- 23 September 2008
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 113-125
Recovering Consistency by Forgetting Inconsistency
- 1 July 2007
- Published by Elsevier in Artificial Intelligence
- Vol. 171 (10-15) , 730-753
On the merging of Dung's argumentation systems
- 1 July 2007
- Published by Elsevier in Artificial Intelligence
- Vol. 171 (10-15) , 730-753
On the merging of Dung's argumentation systems
- Open Access
- 1 March 2006
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 1 (1) , 61-88
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like inference, diagnosis and planning); among them are the ordered binary decis
- 1 March 2006
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 1 (1) , 61-88
Open AccessComplexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like inference, diagnosis and planning); among them are the ordered binary decis
- 1 January 2005
- Published by Springer Nature
- p. 393-399
A Branching Heuristics for Quantified Renamable Horn Formulas
- 1 January 2005
- Published by Springer Nature
- p. 393-399
A Branching Heuristics for Quantified Renamable Horn Formulas
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 606-620
Inference from Controversial Arguments
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 606-620
Inference from Controversial Arguments
- 1 January 2005
- Published by Springer Nature
- p. 151-190
On the Complexity of Paraconsistent Inference Relations
- 1 January 2005
- Published by Springer Nature
- p. 151-190
On the Complexity of Paraconsistent Inference Relations