research-article

A Model-Theoretic Approach to Belief Change in Answer Set Programming

Authors:

James Delgrande,

Torsten Schaub,

Hans Tompits,

Stefan WoltranAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 14, Issue 2

Article No.: 14, Pages 1 - 46

https://doi.org/10.1145/2480759.2480766

Published: 01 June 2013 Publication History

Get Access

Abstract

We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs.

We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision.

We next consider approaches for merging a set of logic programs, P₁, ..., P_n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P_i those models of P_i that vary the least from models of the other programs. The second approach informally selects those models of a program P₀ that are closest to the models of programs P₁, ..., P_n. In this case, P₀ can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets.

Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.

References

[1]

Alchourrón, C., Gärdenfors, P., and Makinson, D. 1985. On the logic of theory change: Partial meet functions for contraction and revision. J. Symb. Logic 50, 2, 510--530.

Abstract

References

Cited By

Index Terms

Recommendations

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

Incorporating Belief Merging into Relevance-Sensitive Belief Structures

Evaluating epistemic negation in answer set programming

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Funding Sources

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations