Sampler programs: The stable model semantics of abstract constraint programs revisited

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussavertaisarvioitu

Standard

Sampler programs : The stable model semantics of abstract constraint programs revisited. / Janhunen, Tomi.

Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010. Vuosikerta 7 2010. s. 94-103.

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussavertaisarvioitu

Harvard

Janhunen, T 2010, Sampler programs: The stable model semantics of abstract constraint programs revisited. julkaisussa Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010. Vuosikerta. 7, Sivut 94-103, Edinburgh, Iso-Britannia, 16/07/2010. https://doi.org/10.4230/LIPIcs.ICLP.2010.94

APA

Janhunen, T. (2010). Sampler programs: The stable model semantics of abstract constraint programs revisited. teoksessa Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010 (Vuosikerta 7, Sivut 94-103) https://doi.org/10.4230/LIPIcs.ICLP.2010.94

Vancouver

Janhunen T. Sampler programs: The stable model semantics of abstract constraint programs revisited. julkaisussa Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010. Vuosikerta 7. 2010. s. 94-103 https://doi.org/10.4230/LIPIcs.ICLP.2010.94

Author

Janhunen, Tomi. / Sampler programs : The stable model semantics of abstract constraint programs revisited. Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010. Vuosikerta 7 2010. Sivut 94-103

Bibtex - Lataa

@inproceedings{be52faee354d4ef0ae4407a162d5192c,
title = "Sampler programs: The stable model semantics of abstract constraint programs revisited",
abstract = "constraint atoms provide a general framework for the study of aggregates utilized in answer set programming. Such primitives suitably increase the expressive power of rules and enable more concise representation of various domains as answer set programs. However, it is non-trivial to generalize the stable model semantics for programs involving arbitrary abstract constraint atoms. For instance, a nondeterministic variant of the immediate consequence operator is needed, or the definition of stable models cannot be stated directly using primitives of logic programs. In this paper, we propose sampler programs as a relaxation of abstract constraint programs that better lend themselves to the program transformation involved in the definition of stable models. Consequently, the declarative nature of stable models can be restored for sampler programs and abstract constraint programs are also covered if decomposed into sampler programs. Moreover, we study the relationships of the classes of programs involved and provide a characterization in terms of abstract but essentially deterministic computations. This result indicates that all non determinism related with abstract constraint atoms can be resolved at the level of program reduct when sampler programs are used as the intermediate representation.",
author = "Tomi Janhunen",
year = "2010",
doi = "10.4230/LIPIcs.ICLP.2010.94",
language = "English",
isbn = "9783939897170",
volume = "7",
pages = "94--103",
booktitle = "Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010",

}

RIS - Lataa

TY - GEN

T1 - Sampler programs

T2 - The stable model semantics of abstract constraint programs revisited

AU - Janhunen, Tomi

PY - 2010

Y1 - 2010

N2 - constraint atoms provide a general framework for the study of aggregates utilized in answer set programming. Such primitives suitably increase the expressive power of rules and enable more concise representation of various domains as answer set programs. However, it is non-trivial to generalize the stable model semantics for programs involving arbitrary abstract constraint atoms. For instance, a nondeterministic variant of the immediate consequence operator is needed, or the definition of stable models cannot be stated directly using primitives of logic programs. In this paper, we propose sampler programs as a relaxation of abstract constraint programs that better lend themselves to the program transformation involved in the definition of stable models. Consequently, the declarative nature of stable models can be restored for sampler programs and abstract constraint programs are also covered if decomposed into sampler programs. Moreover, we study the relationships of the classes of programs involved and provide a characterization in terms of abstract but essentially deterministic computations. This result indicates that all non determinism related with abstract constraint atoms can be resolved at the level of program reduct when sampler programs are used as the intermediate representation.

AB - constraint atoms provide a general framework for the study of aggregates utilized in answer set programming. Such primitives suitably increase the expressive power of rules and enable more concise representation of various domains as answer set programs. However, it is non-trivial to generalize the stable model semantics for programs involving arbitrary abstract constraint atoms. For instance, a nondeterministic variant of the immediate consequence operator is needed, or the definition of stable models cannot be stated directly using primitives of logic programs. In this paper, we propose sampler programs as a relaxation of abstract constraint programs that better lend themselves to the program transformation involved in the definition of stable models. Consequently, the declarative nature of stable models can be restored for sampler programs and abstract constraint programs are also covered if decomposed into sampler programs. Moreover, we study the relationships of the classes of programs involved and provide a characterization in terms of abstract but essentially deterministic computations. This result indicates that all non determinism related with abstract constraint atoms can be resolved at the level of program reduct when sampler programs are used as the intermediate representation.

UR - http://www.scopus.com/inward/record.url?scp=84880231200&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ICLP.2010.94

DO - 10.4230/LIPIcs.ICLP.2010.94

M3 - Conference contribution

SN - 9783939897170

VL - 7

SP - 94

EP - 103

BT - Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010

ER -

ID: 15181820