The Experts below are selected from a list of 138 Experts worldwide ranked by ideXlab platform

Van Der Torre Leon - One of the best experts on this subject based on the ideXlab platform.

  • A dynamic approach for combining abstract argumentation semantics
    2019
    Co-Authors: Dauphin Jérémie, Cramer Marcos, Van Der Torre Leon
    Abstract:

    Abstract argumentation semantics provide a direct relation from an argumentation framework to corresponding sets of acceptable arguments, or equivalently to labeling functions. Instead, we study step-wise update relations on argumentation frameworks whose fixpoints represent the labeling functions on the arguments. We make use of this dynamic approach in order to study novel ways of combining abstract argumentation semantics. In particular, we introduce the notion of a Merge of two argumentation semantics, which is defined in such a way that the Merge of the preferred and the grounded semantics is the complete semantics. Finally we consider how to define new semantics using the Merge Operator, in particular how meaningfully combine features of naive-based and complete-based semantics

  • A Dynamic Approach for Combining Abstract Argumentation Semantics – Technical Report
    University of Luxembourg, 2018
    Co-Authors: Dauphin Jérémie, Cramer Marcos, Van Der Torre Leon
    Abstract:

    Abstract argumentation semantics provide a direct relation from an argumentation framework to corresponding sets of acceptable arguments, or equivalently to labeling functions. Instead, we study step-wise update relations on argumentation frameworks whose fixpoints represent the labeling functions on the arguments. We make use of this dynamic approach in order to study novel ways of combining abstract argumentation semantics. In particular, we introduce the notion of a Merge of two argumentation semantics, which is defined in such a way that the Merge of the preferred and the grounded semantics is the complete semantics. Finally we consider how to define new semantics using the Merge Operator, in particular how meaningfully combine features of naive-based and complete-based semantics

Dauphin Jérémie - One of the best experts on this subject based on the ideXlab platform.

  • A dynamic approach for combining abstract argumentation semantics
    2019
    Co-Authors: Dauphin Jérémie, Cramer Marcos, Van Der Torre Leon
    Abstract:

    Abstract argumentation semantics provide a direct relation from an argumentation framework to corresponding sets of acceptable arguments, or equivalently to labeling functions. Instead, we study step-wise update relations on argumentation frameworks whose fixpoints represent the labeling functions on the arguments. We make use of this dynamic approach in order to study novel ways of combining abstract argumentation semantics. In particular, we introduce the notion of a Merge of two argumentation semantics, which is defined in such a way that the Merge of the preferred and the grounded semantics is the complete semantics. Finally we consider how to define new semantics using the Merge Operator, in particular how meaningfully combine features of naive-based and complete-based semantics

  • A Dynamic Approach for Combining Abstract Argumentation Semantics – Technical Report
    University of Luxembourg, 2018
    Co-Authors: Dauphin Jérémie, Cramer Marcos, Van Der Torre Leon
    Abstract:

    Abstract argumentation semantics provide a direct relation from an argumentation framework to corresponding sets of acceptable arguments, or equivalently to labeling functions. Instead, we study step-wise update relations on argumentation frameworks whose fixpoints represent the labeling functions on the arguments. We make use of this dynamic approach in order to study novel ways of combining abstract argumentation semantics. In particular, we introduce the notion of a Merge of two argumentation semantics, which is defined in such a way that the Merge of the preferred and the grounded semantics is the complete semantics. Finally we consider how to define new semantics using the Merge Operator, in particular how meaningfully combine features of naive-based and complete-based semantics

Torsten Schaub - One of the best experts on this subject based on the ideXlab platform.

  • A consistency-based framework for merging knowledge bases
    Journal of Applied Logic, 2007
    Co-Authors: James P. Delgrande, Torsten Schaub
    Abstract:

    Abstract We present a framework for expressing various merging Operators for belief sets. This framework generalises our earlier work on consistency-based belief revision and contraction. Two primary merging Operators are identified: in the first approach, belief sources are consistently combined so that the result of merging knowledge bases K 1 , … , K n is a maximal consistent (if possible) set of formulas comprising the joint knowledge of the knowledge bases. This approach then accords with one's intuitions as to what a “Merge” Operator should do. The second approach is more akin to a generalised belief revision Operator. Knowledge bases K 1 , … , K n are “projected” onto another (in the simplest case the knowledge base where only tautologies are known). Properties of these Operators are investigated, primarily by comparing their properties with postulates that have been identified previously in the literature. Notably, the approach is independent of syntax, in that merging knowledge bases K 1 , … , K n is independent of how each K i is expressed. As well, we investigate the role of entailment-based and consistency-based integrity constraints, the interrelationships between these approaches and belief revision, and the expression of further merging Operators.

  • JELIA - Two Approaches to Merging Knowledge Bases
    Logics in Artificial Intelligence, 2004
    Co-Authors: James P. Delgrande, Torsten Schaub
    Abstract:

    We present a framework for expressing different merging Operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and contraction. Two distinct merging Operators are identified: in the first approach, belief sources are consistently combined so that the result of merging knowledge bases K 1,...,K n is a maximal consistent (if possible) set of formulas comprising the joint knowledge of the knowledge bases. This approach then accords to one’s intuitions as to what a “Merge” Operator should do. The second approach is more akin to a generalised belief revision Operator: Knowledge bases K 1,...,K n are “projected” onto another (in the simplest case the trivially true knowledge base). In both cases, we consider the incorporation of entailment-based and consistency-based integrity constraints. Properties of these Operators are investigated, primarily by comparing their properties with postulates that have been identified previously in the literature. As well, the interrelationships between these approaches and belief revision is given.

  • NMR - Consistency-based approaches to merging knowledge bases: preliminary report.
    2004
    Co-Authors: James P. Delgrande, Torsten Schaub
    Abstract:

    We present a framework for investigating merging Operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and contraction. Two distinct merging Operators are identified: in the first approach, belief sources are consistently combined so that the result of merging K1 and K2 is a maximal consistent (if possible) set of formulas comprising the joint knowledge of K1 and K2. This approach then accords to one’s intuitions as to what a “Merge” Operator should do. The second approach is more akin to a generalised belief revision Operator: Two knowledge sources are “projected” onto a third (in the simplest case the trivially true knowledge base). In both cases, we consider the incorporation of entailment-based and consistency-based integrity constraints. Properties of these Operators are investigated, primarily by comparing their properties with postulates that have been identified previously in the literature. As well, interrelationships between these approaches and belief revision are given.

Hideki Tsuiki - One of the best experts on this subject based on the ideXlab platform.

  • on typed calculi with a Merge Operator
    Foundations of Software Technology and Theoretical Computer Science, 1994
    Co-Authors: Hideki Tsuiki
    Abstract:

    Extensions of the simply typed lambda calculus with a Merge Operator are defined and investigated. A Merge of functions denotes a function which can be applied to more than one type and computes the result by merging the results of the component functions. We propose first two calculi in which the inconsistency between the return values of the component functions is solved using a non-symmetric rule, and show that they do not have good proof-theoretic properties: one does not have the Strong Normalization Property, and the other does not have the Transitivity of Coercions Property. Then, using the type system, we restrict the two calculi in a way that terms which may cause inconsistency are excluded, and show that the two calculi become equivalent and have all the desired properties.

  • FSTTCS - On Typed Calculi with a Merge Operator
    Lecture Notes in Computer Science, 1994
    Co-Authors: Hideki Tsuiki
    Abstract:

    Extensions of the simply typed lambda calculus with a Merge Operator are defined and investigated. A Merge of functions denotes a function which can be applied to more than one type and computes the result by merging the results of the component functions. We propose first two calculi in which the inconsistency between the return values of the component functions is solved using a non-symmetric rule, and show that they do not have good proof-theoretic properties: one does not have the Strong Normalization Property, and the other does not have the Transitivity of Coercions Property. Then, using the type system, we restrict the two calculi in a way that terms which may cause inconsistency are excluded, and show that the two calculi become equivalent and have all the desired properties.

Cramer Marcos - One of the best experts on this subject based on the ideXlab platform.

  • A dynamic approach for combining abstract argumentation semantics
    2019
    Co-Authors: Dauphin Jérémie, Cramer Marcos, Van Der Torre Leon
    Abstract:

    Abstract argumentation semantics provide a direct relation from an argumentation framework to corresponding sets of acceptable arguments, or equivalently to labeling functions. Instead, we study step-wise update relations on argumentation frameworks whose fixpoints represent the labeling functions on the arguments. We make use of this dynamic approach in order to study novel ways of combining abstract argumentation semantics. In particular, we introduce the notion of a Merge of two argumentation semantics, which is defined in such a way that the Merge of the preferred and the grounded semantics is the complete semantics. Finally we consider how to define new semantics using the Merge Operator, in particular how meaningfully combine features of naive-based and complete-based semantics

  • A Dynamic Approach for Combining Abstract Argumentation Semantics – Technical Report
    University of Luxembourg, 2018
    Co-Authors: Dauphin Jérémie, Cramer Marcos, Van Der Torre Leon
    Abstract:

    Abstract argumentation semantics provide a direct relation from an argumentation framework to corresponding sets of acceptable arguments, or equivalently to labeling functions. Instead, we study step-wise update relations on argumentation frameworks whose fixpoints represent the labeling functions on the arguments. We make use of this dynamic approach in order to study novel ways of combining abstract argumentation semantics. In particular, we introduce the notion of a Merge of two argumentation semantics, which is defined in such a way that the Merge of the preferred and the grounded semantics is the complete semantics. Finally we consider how to define new semantics using the Merge Operator, in particular how meaningfully combine features of naive-based and complete-based semantics