Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms

Abstract

In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms (c-atoms). These approaches generalize the fixpoint-based and the level mapping based answer set semantics of normal logic programs to the case of logic programs with arbitrary types of c-atoms. The results are… (More)
DOI: 10.1613/jair.2171

Topics

Statistics

01020'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

70 Citations

Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Pontelli2006AnswerSF, title={Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms}, author={Enrico Pontelli and Tran Cao Son and Phan Huy Tu}, booktitle={J. Artif. Intell. Res.}, year={2006} }