Opérateurs de Confluence

نویسندگان

  • Sébastien Konieczny
  • Ramón Pino Pérez
چکیده

In the logic based framework of knowledge representation and reasoning many operators have been defined in order to capture different kinds of change : revision, update, merging and many others. There are close links between revision, update, and merging. Merging operators can be considered as extensions of revision operators to multiple belief bases. And update operators can be considered as pointwise revision, looking at each model of the base, instead of taking the base as a whole. Thus, a natural question is the following one : Are there natural operators that are pointwise merging, just as update are pointwise revision ? The goal of this work is to give a positive answer to this question. In order to do that, we introduce a new class of operators : the confluence operators. These new operators can be useful in modelling negotiation processes.

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

ثبت نام

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

منابع مشابه

Condition de non-capture pour des opérateurs de Schrödinger semi-classiques à potentiels matriciels

We consider semiclassical Schrödinger operators with matrix-valued, long-range, smooth potential, for which different eigenvalues may cross on a codimension one submanifold. We denote by h the semiclassical parameter and we consider energies above the bottom of the essential spectrum. Under some invariance condition on the matricial structure of the potential near the eigenvalues crossing and s...

متن کامل

Réécriture de Graphes Admissibles : Confluence et Stratégie

Nous considérons la réécriture de graphes en tant que sémantique opérationnelle des langages “équationnels”. Nous nous plaçons dans le cadre des signatures avec constructeurs. Nous commençons par caractériser un sous-ensemble de graphes dits graphes admissibles. Un graphe est admissible si aucun de ses cycles ne contient de fonction définie. Ensuite, nous considérons la relation de réécriture s...

متن کامل

Efficient On-the-Fly Computation of Weak Tau-Confluence

The notion of τ-confluence provides a form of partial order reduction of Labelled Transition Systems (Ltss), by allowing to identify the τ-transitions whose execution does not alter the observable behaviour of the system. Several forms of τ-confluence adequate with branching bisimulation were studied in the literature, ranging from strong to weak ones according to the length of τ-transition seq...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2009