Logic programs with abstract constraints: representaton, disjunction and complexities

Authors:
Jia-Huai You;Li Yan Yuan;Guohua Liu;Yi-Dong Shen
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Lab of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Year:
2007

Citing 12
Cited 4

Extending and implementing the stable model semantics

Artificial Intelligence
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates

Proceedings of the 17th International Conference on Logic Programming
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A Constructive semantic characterization of aggregates in answer set programming

Theory and Practice of Logic Programming
Well-founded and stable semantics of logic programs with aggregates

Theory and Practice of Logic Programming
Logic programs with monotone abstract constraint atoms*

Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Answer sets for logic programs with arbitrary abstract constraint atoms

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Properties of programs with monotone and convex constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Properties and applications of programs with monotone and convex constraints

Journal of Artificial Intelligence Research
Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Declarative and computational properties of logic programs with aggregates

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Characterizations of stable model semantics for logic programs with arbitrary constraint atoms

Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms: The role of computations

Artificial Intelligence
Strong equivalence of logic programs with abstract constraint atoms

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Well-Supported semantics for logic programs with generalized rules

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study logic programs with arbitrary abstract constraint atoms, called c-atoms. As a theoretical means to analyze program properties, we investigate the possibility of unfolding these programs to logic programs composed of ordinary atoms. This approach reveals some structural properties of a program with c-atoms, and enables characterization of these properties based on the known properties of the transformed program. Furthermore, this approach leads to a straightforward definition of answer sets for disjunctive programs with catoms, where a c-atom may appear in the head of a rule as well as in the body. We also study the complexities for various classes of logic programs with c-atoms.