Skip to main navigation Skip to search Skip to main content

Answer set programs with one incremental variable

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

Abstract

In the past decade, Answer Set Programming (ASP) has emerged as a popular paradigm for declarative problem solving, and a number of answer set solvers have been developed. However, most existing solvers require variables occurring in a logic program to be bounded by some finite domains, which limits their applications in one way or another. In this paper, we introduce answer set programs with one incremental variable to overcome this limitation. Based on existing ASP solving techniques, an approach to solve answer set programs with one incremental variable is proposed, and a prototype solver is then developed based on this approach. By conducting some experiments, our approach is shown to be comparable to iClingo's modular domain description approach in the incremental problem solving setting.
Original languageEnglish
Title of host publicationModern Advances in Applied Intelligence: Proceedings of the 27th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2014, Kaohsiung, Taiwan, June 3-6, 2014
PublisherSpringer
Pages128-137
Number of pages10
ISBN (Print)9783319074542
DOIs
Publication statusPublished - 2014
EventInternational Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems -
Duration: 3 Jun 2014 → …

Publication series

Name
ISSN (Print)0302-9743

Conference

ConferenceInternational Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems
Period3/06/14 → …

Keywords

  • answer set programming
  • knowledge representation
  • logic programming
  • problem solving

Fingerprint

Dive into the research topics of 'Answer set programs with one incremental variable'. Together they form a unique fingerprint.

Cite this