A transition system for AC language algorithms

Yuliya Lierler, Yuanlin Zhang

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations

Abstract

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logic programming. In a similar vein, Gebser et al. (2009) proposed a clingcon language integrating ASP and finite domain constraints. A distinguishing feature of these languages is their capacity to allow new efficient inference algorithms that combine traditional ASP procedures and other efficient methods in constraint programming. In this paper we show that a transition system introduced by Nieuwenhuis et al. (2006) can be extended to model the “hybrid” acsolver algorithm, by Mellarkod et al., designed for processing a class of simple AC programs. We also define a new class of weakly-simple programs and show how the introduced transition system describes a class of algorithms for such programs. Finally, we demonstrate that any clingcon program can be seen as an AC program.

Original languageEnglish
StatePublished - Jan 1 2011
Event4th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2011, collocated with the 27th International Conference on Logic Programming, ICLP 2011 - Lexington, United States
Duration: Jul 10 2011 → …

Conference

Conference4th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2011, collocated with the 27th International Conference on Logic Programming, ICLP 2011
Country/TerritoryUnited States
CityLexington
Period07/10/11 → …

Fingerprint

Dive into the research topics of 'A transition system for AC language algorithms'. Together they form a unique fingerprint.

Cite this