We propose a very general syntactical notion of epistemic state and a compact axiomatization for iterated revision when the new information is an epistemic state. We set representation theorems and give two semantical representations of operators: by polynomials and by weighted belief bases. These representations will result to be equivalent.

We propose a very general syntactical notion of epistemic state and a compact axiomatization for iterated revision when the new information is an epistemic state. We set representation theorems and give two semantical representations of operators: by polynomials and by weighted belief bases. These representations will result to be equivalent.

We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specii-cally, we study the relationship between satis-ability and logical implication in nonmono-tonic logics, showing that, in many nonmono-tonic formalisms, it is possible and easy to reduce logical implication to satissability. This result not only allows for establishin...

Proper epistemic knowledge bases (PEKBs) are syntactic knowledge bases that use multi-agent epistemic logic to represent nested multi-agent knowledge and belief. PEKBs have certain syntactic restrictions that lead to desirable computational properties; primarily, a PEKB is a conjunction of modal literals, and therefore contains no disjunction. Sound entailment can be checked in polynomial time,...

the concept of comprehensive grobner bases was introduced by weispfenning. montes has proposed an efficient algorithm for computing these bases. but he has not explicitly used buchberger's criteria in his algorithm. in this paper we prove that we can apply these criteria on montes algorithm. we propose a modified version of montes algorithm and evaluate its performance via some examples.