Generalized arrow update logic

An update logic for information systems

International Journal of Approximate Reasoning ◽

10.1016/j.ijar.2013.07.007 ◽

2014 ◽

Vol 55 (1) ◽

pp. 436-456 ◽

Cited By ~ 10

Author(s):

Md. Aquil Khan ◽

Mohua Banerjee ◽

Roland Rieke

Keyword(s):

Information Systems ◽

Update Logic

Download Full-text

ARROW UPDATE LOGIC

The Review of Symbolic Logic ◽

10.1017/s1755020311000189 ◽

2011 ◽

Vol 4 (4) ◽

pp. 536-559 ◽

Cited By ~ 32

Author(s):

BARTELD KOOI ◽

BRYAN RENNE

Keyword(s):

Epistemic Logic ◽

Belief Change ◽

Common Knowledge ◽

Dynamic Epistemic Logic ◽

Epistemic Access ◽

Multi Agent ◽

Logic Approach ◽

Action Models ◽

Information Change ◽

Update Logic

We presentArrow Update Logic, a theory of epistemic access elimination that can be used to reason about multi-agent belief change. While the belief-changing “arrow updates” of Arrow Update Logic can be transformed into equivalent belief-changing “action models” from the popular Dynamic Epistemic Logic approach, we prove that arrow updates are sometimes exponentially more succinct than action models. Further, since many examples of belief change are naturally thought of from Arrow Update Logic’s perspective of eliminating access to epistemic possibilities, Arrow Update Logic is a valuable addition to the repertoire of logics of information change. In addition to proving basic results about Arrow Update Logic, we introduce a new notion of common knowledge that generalizes both ordinary common knowledge and the “relativized” common knowledge familiar from the Dynamic Epistemic Logic literature.

Download Full-text

Arbitrary arrow update logic

Artificial Intelligence ◽

10.1016/j.artint.2016.10.003 ◽

2017 ◽

Vol 242 ◽

pp. 80-106 ◽

Cited By ~ 6

Author(s):

Hans van Ditmarsch ◽

Wiebe van der Hoek ◽

Barteld Kooi ◽

Louwe B. Kuijer

Keyword(s):

Update Logic

Download Full-text

A program-level approach to revising logic programs under the answer set semantics

Theory and Practice of Logic Programming ◽

10.1017/s1471068410000281 ◽

2010 ◽

Vol 10 (4-6) ◽

pp. 565-580 ◽

Cited By ~ 7

Author(s):

JAMES P. DELGRANDE

Keyword(s):

Logic Program ◽

Fundamental Principle ◽

Logic Programs ◽

Minimal Set ◽

Essential Idea ◽

The One ◽

Answer Set Semantics ◽

Answer Sets ◽

Update Logic ◽

Answer Set

AbstractAn approach to the revision of logic programs under the answer set semantics is presented. For programs P and Q, the goal is to determine the answer sets that correspond to the revision of P by Q, denoted P * Q. A fundamental principle of classical (AGM) revision, and the one that guides the approach here, is the success postulate. In AGM revision, this stipulates that α ∈ K * α. By analogy with the success postulate, for programs P and Q, this means that the answer sets of Q will in some sense be contained in those of P * Q. The essential idea is that for P * Q, a three-valued answer set for Q, consisting of positive and negative literals, is first determined. The positive literals constitute a regular answer set, while the negated literals make up a minimal set of naf literals required to produce the answer set from Q. These literals are propagated to the program P, along with those rules of Q that are not decided by these literals. The approach differs from work in update logic programs in two main respects. First, we ensure that the revising logic program has higher priority, and so we satisfy the success postulate; second, for the preference implicit in a revision P * Q, the program Q as a whole takes precedence over P, unlike update logic programs, since answer sets of Q are propagated to P. We show that a core group of the AGM postulates are satisfied, as are the postulates that have been proposed for update logic programs.

Download Full-text