Splitting Computation of Answer Set Program and Its Application on E-service

DOI

10.2991/ijcis.2011.4.5.21How to use a DOI?

Keywords

logic program, answer set, splitting, E-service

Abstract

As a primary means for representing and reasoning about knowledge, Answer Set Programming (ASP) has been applying in many areas such as planning, decision making, fault diagnosing and increasingly prevalent e-service. Based on the stable model semantics of logic programming, ASP can be used to solve various combinatorial search problems by finding the answer sets of logic programs which declaratively describe the problems. It’s not an easy task to compute answer sets of a logic program using Gelfond and Lifschitz’s definition directly. In this paper, we show some results on characterization of answer sets of a logic program with constraints, and propose a way to split a program into several non-intersecting parts step by step, thus the computation of answer sets for every subprogram becomes relatively easy. To instantiate our splitting computation theory, an example about personalized product configuration in e-retailing is given to show the effectiveness of our method.

Copyright

© 2011, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Bo Yang
AU  - Ying Zhang
AU  - Mingyi Zhang
AU  - Maonian Wu
PY  - 2011
DA  - 2011/11/18
TI  - Splitting Computation of Answer Set Program and Its Application on E-service
JO  - International Journal of Computational Intelligence Systems
SP  - 977
EP  - 990
VL  - 4
IS  - 5
SN  - 1875-6883
UR  - https://doi.org/10.2991/ijcis.2011.4.5.21
DO  - 10.2991/ijcis.2011.4.5.21
ID  - Yang2011
ER  -