Logic Programs with Abstract Constraint Atoms (2004)
| Venue: | In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04 |
| Citations: | 15 - 5 self |
BibTeX
@INPROCEEDINGS{Marek04logicprograms,
author = {Victor W. Marek and Miroslaw Truszczynski and Mirosl/aw Truszczy Nski},
title = {Logic Programs with Abstract Constraint Atoms},
booktitle = {In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04},
year = {2004},
pages = {86--91},
publisher = {AAAI Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is an abstract constraint (formally, a collection of sets of atoms). Atoms C(X) are satisfied by an interpretation (set of atoms) M , if M C. We focus here on monotone constraints, that is, those collections C that are closed under the superset. They include, in particular, weight (or pseudo-boolean) constraints studied both by the logic programming and SAT communities. We show that key concepts of the theory of normal logic programs such as the one-step provability operator, the semantics of supported and stable models, as well as several of their properties including complexity results, can be lifted to such case.
