Syntactic Representations of Semantic Merging Operations

摘要: Recent research suggests the usefulness of conducting information merging on level epistemic states as an alternative to usual approach knowledge base [1,2]. We take state be assignment natural numbers classical valuations finite propositional logic under consideration. In this paper we investigate various syntactic representations and show how these can employed represent operations syntactically. These include ranked bases their normals forms, well different versions structures referred partitions. that there are efficient methods for transformaing any into equivalent partition, vice versa. provide a uniform method obtaining representations, in terms partitions, large class semantic operations. This is linear n times product sizes partitions used merged. For lexicographic operations, it proved represents best do computational complexity. also structure some exploited obtain them which determined much more efficiently than provided. To able use methods, necessary representational form.