SPLITTING COMPUTATION OF LOGIC PROGRAM

摘要

As a primary means for representing and reasoning about knowledge, Answer Set Programming has been applying in many domains such as planning, decision making and fault diagnosing. It's not an easy task to compute answer sets of a logic program using Lifschitz and Gelfond'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 a relative easy task.