G. Flouris, D. Plexousakis. Belief Revision Using Table Transformation. Technical Report ICS-FORTH, TR-290, 2001. URL: http://www.ics.forth.gr/isl/publications/paperlink/flourisTR290. pdf Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On a Unifying Framework for Comparing Knowledge.. - Flouris.. (2003) Self-citation (Flouris Plexousakis) (Correct)
No context found.
G. Flouris, D. Plexousakis. Belief Revision Using Table Transformation. Technical Report ICS-FORTH, TR-290, 2001. URL: http://www.ics.forth.gr/isl/publications/paperlink/flourisTR290. pdf
On a Unifying Framework for Comparing - Knowledge Representation Schemes Self-citation (Flouris Plexousakis) (Correct)
No context found.
G. Flouris, D. Plexousakis. Belief Revision Using Table Transformation. Technical Report ICS-FORTH, TR-290, 2001. URL: http://www.ics.forth.gr/isl/publications/paperlink/flourisTR290. pdf
Belief Revision in Propositional Knowledge Bases - George Flouris And Self-citation (Dimitris) (Correct)
....operation upon two tables A,B#MR( n) as the simple juxtaposition of their lines. In the rest of this chapter, we will describe the main definitions and theoretical results related to the transformation and its properties. Proofs will be omitted due to lack of space, but they can be found in [11]. Definition 1. We define the following tables, which will be useful at later stages: element (1,0) is in the k th column. Table A will be called a k atom or a positive k atom and we will use the notation A k . element (0,1) is in the k th column. Table A will be called an inverse k atom or ....
....Dalal in [3] proposed a very promising method of revising beliefs. He provided an algorithm for updating propositional KBs and formalized the notion of minimal change. He proved in [3] that his method generally retained more knowledge than the up to then proposed algorithms. It can be shown ([11]) that his revision method can be simulated using our semantics, despite the different assumptions on the design of the algorithm. More specifically, the following theorem holds: Theorem 1. Let p, q be two satisfiable propositional expressions in DNF and let r be the revision of p with q under ....
[Article contains additional citation context not shown here]
Flouris George, Plexousakis Dimitris, "Belief Revision using Table Transformation", Technical Report TR-290, July 2001, ICS-FORTH, forthcoming.
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