Weight constraint programs with evaluable functions

  • Authors:

  • Yisong Wang;Jia-Huai You;Fangzhen Lin;Li Yan Yuan;Mingyi Zhang

  • Affiliations:

  • Department of Computer Science, Guizhou University, Guiyang, China;Department of Computing Science, University of Alberta, Edmonton, Canada;Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong;Department of Computing Science, University of Alberta, Edmonton, Canada;Guizhou Academy of Sciences, Guiyang, China

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the current practice of Answer Set Programming (ASP), evaluable functions are represented as special kinds of relations. This often makes the resulting program unnecessarily large when instantiated over a large domain. The extra constraints needed to enforce the relation as a function also make the logic program less transparent. In this paper, we consider adding evaluable functions to answer set logic programs. The class of logic programs that we consider here is that of weight constraint programs, which are widely used in ASP. We propose an answer set semantics to these extended weight constraint programs and define loop completion to characterize the semantics. Computationally, we provide a translation from loop completions of these programs to instances of the Constraint Satisfaction Problem (CSP) and use the off-the-shelf CSP solvers to compute the answer sets of these programs. A main advantage of this approach is that global constraints implemented in such CSP solvers become available to ASP. The approach also provides a new encoding for CSP problems in the style of weight constraint programs. We have implemented a prototype system based on these results, and our experiments show that this prototype system competes well with the state-of-the-art ASP solvers. In addition, we illustrate the utilities of global constraints in the ASP context.