Strong equivalence of logic programs with abstract constraint atoms

  • Authors:

  • Guohua Liu;Randy Goebel;Tomi Janhunen;Ilkka Niemelä;Jia-Huai You

  • Affiliations:

  • Aalto University, Department of Information and Computer Science;University of Alberta, Department of Computing Science;Aalto University, Department of Information and Computer Science;Aalto University, Department of Information and Computer Science;University of Alberta, Department of Computing Science

  • Venue:
  • LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key property for program maintenance and optimization, and for guaranteeing the same behavior for a revised original program in any context. In this paper, we study strong equivalence of logic programs with abstract constraint atoms. We first give a general characterization of strong equivalence based on a new definition of program reduct for logic programs with abstract constraints. Then we consider a particular kind of program revision--constraint replacements addressing the question: under what conditions can a constraint in a program be replaced by other constraints, so that the resulting program is strongly equivalent to the original one.