Logic Based on Total - Ordered Partition Model 1
نویسنده
چکیده
This paper deals with the problem of uniqueness of reconstruction in Open Logic by introducing the concept of total-ordered partitions, an ordering structure modeling belief degrees of knowledge, and rede ning the reconstruction operation. Based on the resulting de nition, a nontrivial condition for the convergency of cognitive processes is given. It is shown that if new knowledge is not always accepted with an extremely skeptical attitude and the changes of belief degrees follow the criterion of minimal changes, the cognitive process will converge. The results of this paper provide an approach to unifying two kinds of theories for knowledge base maintenance: belief revision and open logic.
منابع مشابه
An Introduction to Logical Entropy and its Relation to Shannon Entropy
The logical basis for information theory is the newly developed logic of partitions that is dual to the usual Boolean logic of subsets. The key concept is a "distinction" of a partition, an ordered pair of elements in distinct blocks of the partition. The logical concept of entropy based on partition logic is the normalized counting measure of the set of distinctions of a partition on a finite ...
متن کاملInformation as Distinctions: New Foundations for Information Theory
The logical basis for information theory is the newly developed logic of partitions that is dual to the usual Boolean logic of subsets. The key concept is a "distinction" of a partition, an ordered pair of elements in distinct blocks of the partition. The logical concept of entropy based on partition logic is the normalized counting measure of the set of distinctions of a partition on a finite ...
متن کاملDesign of Logic Network for Generating Sequency Ordered Hadamard Matrix H
A logic network to produce the sequency ordered Hadamard matrix H based on the property of gray code and orthogonal group codes is developed. The network uses a counter to generate Rademacher function such that the output of H will be in sequency. A general purpose shift register with output logic is used to establish a sequence of period P corresponding to a given value of order m of the Hadam...
متن کاملPractical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often be hand-tuned to answer queries with reasonable performance in practice. Appealing to previous theoretical work on partition-based reasoning, we propose resolutionbased theorem proving strategies that exploit the structur...
متن کاملPartitioning Posets.dvi
Given a poset P = (X,≺), a partition X1, . . . ,Xk of X is called an ordered partition of P if, whenever x ∈ Xi and y ∈ Xj with x ≺ y, then i ≤ j. In this paper, we show that for every poset P = (X,≺) and every integer k ≥ 2, there exists an ordered partition of P into k parts such that the total number of comparable pairs within the parts is at most (m− 1)/k, where m ≥ 1 is the total number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998