Share This Author
A Knowledge Compilation Map
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and…
Propositional Independence - Formula-Variable Independence and Forgetting
This paper considers two basic forms of independence, namely, a syntactic one and a semantic one, and shows features and drawbacks of them.
Consistency restoration and explanations in dynamic CSPs Application to configuration
DA2 merging operators
On the merging of Dung's argumentation systems
Symmetric Argumentation Frameworks
This paper is centered on the family of Dung's finite argumentation frameworks when the attacks relation is symmetric (and nonempty and irreflexive). We show that while this family does not contain…
Consequence Finding Algorithms
- P. Marquis
In this section, the notion of consequence finding is introduced and motivated in informal terms. Then, the scope of the chapter and its organization are successively pointed out.
Distance Based Merging: A General Framework and some Complexity Results
The computational aspects of such distance-based operators are investigated and two general results are given showing that the complexity of inference for them is at the rst level of the polynomial hierarchy (under very weak assumptions).
Constrained Argumentation Frameworks
We present a generalization of Dung's theory of argumentation enabling to take account for some additional constraints on the admissible sets of arguments, expressed as a propositional formula over…
On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses
This paper introduces a language of revision formulae which is expressive enough for enabling the representation of complex conditions on the acceptability of arguments in the revised system and provides a corresponding representation theorem in terms of minimal change of the arguments statuses.