B.Messing, Combining knowledge with many-valued logics, Data and Knowledge Engineering 23 (1997) 297-315.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... based on a speci c bilattice (denote here by NINE, see Figure 2 below) is also considered in [16] Bilattices have also been found useful for model based diagnostics [29] computational linguistics [36] reasoning with inconsistent knowledge bases [5,44] and processing of distributed knowledge [35]. As in the four valued case, we shall continue to denote by ; the meet, join, and the involution operations w.r.t. t , and by ; the meet and the join operations w.r.t. k . The t maximal (respectively, t minimal) element is denoted by t (respectively, f ) and the k ....

B.Messing, Combining knowledge with many-valued logics, Data and Knowledge Engineering 23 (1997) 297-315.

....to decode within the language itself some metainformation such as con dence factors, amount of belief for or against a speci c assertion, etc. These approaches combine corresponding formalisms of knowledge representation (such as annotated logic programs [40, 41] or bilattice based logics [5, 21, 33]) together with non classical refutation procedures [20, 30, 40] that allow to detect inconsistent parts of a database and maintain them. A closely related topic is the problem of giving consistent query answers in inconsistent database [3, 10, 25] The idea is to answer database queries in a ....

B.Messing. Combining knowledge with many-valued logics. J. Data and Knowledge Engineering 23, pp.297-315, 1997.

.... on di erent sources of information or preferring certain data over another [2, 4, 5] Other approaches are based on rewriting rules for representing the information in a speci c form [14] or use multiple valued semantics (e.g. annotated logic programs [28, 29] and bilattice based formalisms [12, 22]) together with non classical refutation procedures [11, 19, 28] that allow to decode within the language itself some meta information such as con dence factors, amount of belief for against a speci c assertion, etc. Each one of the techniques mentioned above has its own limitations and or ....

B.Messing. Combining knowledge with many-valued logics. Data and Knowledge Engineering 23, 297-315, 1997.

.... p iff I(p) P (I(p) 6 P ) But in partial orders (and in lattices in particular) one has generally not P = fi j i P jg [ fi j i P jg. This fact is exploited to handle inconsistency with the partial order determined by a lattice structure [75] as well as to accomodate partial knowledge [97] and some uncertainty paradigms [81] Based on the principles described above, other deduction problems have been tackled. We give examples of deduction problems which have been studied but for which neither experimental nor complexity results were obtained yet. Others may be found in Section ....

.... studied in computational linguistics [70] Various ambiguity phenomena in natural language are best modelled with many valued logic [73] Databases Knowledge Representation Some applications of signed formula and annotated logic programming in databases and knowledge representation are [145, 96, 97] others can be found in the papers cited in Section 4.3. Specifically, in [95, 97] examples are given that illustrate the suitability of lattice structures to model hybrid knowledge originating from different sources (agents) with distinct information. In [97] an annotated logic program is derived ....

[Article contains additional citation context not shown here]

B. Messing. Combining knowledge with many-valued logics. Data & Knowledge Engineering, to appear, 1997. Special Issue on Distributed Expertise.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC