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

  title={Splitting Computation of Answer Set Program and Its Application on E-service},
  author={Bohua Yang and Y. Zhang and Mingyi Zhang and Maonian Wu},
  journal={Int. J. Comput. Intell. Syst.},
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… 

Tables from this paper



A characterization of answer sets for logic programs

A characterization of answer sets based on sets of generating rules is proposed and a sufficient and necessary condition for the equivalence between answer set semantics and completion semantics has been proven, and a basic theorem is shown on computing answer sets for nested logic programs based on an extended notion of loop formulas.

Answer Set Programming

  • Wolfgang Faber
  • Computer Science
    Wiley Encyclopedia of Computer Science and Engineering
  • 2008
After a formal definition of ASP, this chapter surveys the main contribution given by the Italian community to the ASP field in the last 25 years.

A logic programming approach to knowledge-state planning: Semantics and complexity

We propose a new declarative planning language, called K, which is based on principles and methods of logic programming. In this language, transitions between states of knowledge can be described,

A Splitting Set Theorem for Epistemic Specifications

An extended definition of splitting sets is presented that will be applicable to epistemic specifications and an extension of the splitting set theorem will be presented, which leads to an algorithmic method of computing world views of a subclass of epistemic logic programs.

Representing Configuration Knowledge With Weight Constraint Rules

It is shown that product configuration knowledge can be represented systematically and compactly using a logic program type rule language such that the answers of a configuration task, the configurations, correspond to the models of the rule representation.

Splitting a CR-Prolog Program

This paper hopes to provide the technical means to further stimulate the study and use of CR-Prolog, by extending to CR- prolog the Splitting Set Theorem, one of the most useful theoretical results available for A-prolog.

An A Prolog decision support system for the Space Shuttle

A programming methodology based on the declarative language A-Prolog and the systems for computing answer sets of such programs, can be successfully applied to the development of medium size knowledge-intensive applications.

Splitting a Default Theory

  • H. Turner
  • Computer Science
    AAAI/IAAI, Vol. 1
  • 1996
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by "splitting it into parts." These so-called Splitting Theorems for

Complexity and expressive power of logic programming

The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but the also mention general logic programming with function symbols, and the complexity of the unification problem is addressed.