P. Liberatore and M. Schaerf. Relating belief revision and circumscription. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI '95), pages 1557-- 1563, Montreal, Canada, 1995. Morgan Kaufmann.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....properties (see [2, 9, 6] for the results on CIRC) It is therefore natural to ask whether this is a chance or not. A rst study of relationships between belief revision and CIRC has been done in [23] where the author remarked similarities between CIRC and her operator. Subsequently, in [14] the authors pointed out interesting connections between CIRC and several belief revision operators, thus extending the result of [23] In particular, they proved that CIRC can be compactly represented by means of several belief revision operators, i.e. given a propositional formula F , two ....

....result of [23] In particular, they proved that CIRC can be compactly represented by means of several belief revision operators, i.e. given a propositional formula F , two formulas T and P , of size polynomial w.r.t. jF j, exist such that T ffi P is logically equivalent to CIRC(F ) As remarked in [14], this allows to import results from one eld into the other. For example, the above mentioned result combined with the non compactability results of CIRC can be used to prove several of the negative results in [5] Also inverse reductions have been investigated, i.e. compiling belief revision into ....

[Article contains additional citation context not shown here]

P. Liberatore and M. Shaerf. Relating belief revision and circumscription. In Proc. of IJCAI-95, pages 15571563, 1995.

....how T and P concur to create the new knowledge base. We briefly remind revision and update operators proposed in the last years. For a survey of several methods see [KM91] Relations between these operators and the wellknown non monotonic operator of circumscription have been investigated in [LS95]. 2.1 Syntax Model based Revisions Full meet revision. It is possible to define a simple revision satisfying the AGM postulates (see [KM91] as T P = T [ P is T [ P is satisfiable, T P = P otherwise. Ginsberg revision. Let W (T; P ) be the set of the maximal subsets of T consistent with P , ....

P. Liberatore and M. Schaerf. Relating belief revision and circumscription. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1557--1563, 1995.

....letters of the alphabet L = fx 1 ; xn g, decide if the maximal lexicographic model of f contains xn . Given a propositional formula t, its cardinality based circumscription ncirc(t) is the formula whose models are the minimal (w.r.t. number of atoms) models of t. The following problem [LS95] is complete for the class Delta p 2 [log n] Definition 5 infncirc. Given two propositional formulas t and q, decide if ncirc(t) j= q. We use also the class D p , that is defined as the set of problems that can be expressed as deciding if a string x belongs to a language L 1 =L 2 , where ....

P. Liberatore and M. Schaerf. Relating belief revision and circumscription. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1557--1563, 1995.

No context found.

P. Liberatore and M. Schaerf. Relating belief revision and circumscription. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI '95), pages 1557-- 1563, Montreal, Canada, 1995. Morgan Kaufmann.

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