Propositional merging operators based on set-theoretic closeness

نویسندگان

  • Patricia Everaere
  • Sébastien Konieczny
  • Pierre Marquis
چکیده

In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile. Closeness is, in this context, measured as a number resulting from the aggregation of the distances to each base of the profile. In this work we define a new familly of propositional merging operators, close to such distance-based merging operators, but relying on a set-theoretic definition of closeness, already at work in several revision/update operators from the literature. We study a specific merging operator of this family, obtained by considering set-product as the aggregation function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A diff-Based Merging Operator

Merging operators aim at defining the beliefs (resp. the goal) of a group of agents from a profile of bases, gathering the beliefs (resp. the goals) of each member of the group. In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile. Closeness is, in this context, measur...

متن کامل

A A Model-theoretic Approach to Belief Change in Answer Set Programming

We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical int...

متن کامل

Quantum-Based Belief Merging

Belief merging aims at building a common belief set issued from multiple belief sets. The quality of the resulting set is usually considered in terms of a closeness criterion between the initial belief sets and an integrity constraint with respect to the aim of the merging procedure. The notion of distance between belief sets is thus a crucial issue when we face the merging problem. The aim of ...

متن کامل

Merging Qualitative Constraints Networks Using Propositional Logic

In this paper we address the problem of merging qualitative constraints networks (QCNs). We propose a rational merging procedure for QCNs. It is based on translations of QCNs into propositional formulas, and take advantage of propositional merging operators.

متن کامل

DA2 merging operators

A new framework for propositional merging is presented. DA2 merging operators, parameterized by a distance between interpretations and two aggregation functions, are introduced. Many distances and aggregation functions can be used and many merging operators already defined in the literature (including both model-based ones and syntax-based ones) can be encoded as specific DA2 operators. Both lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008