Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates-Reference-Cited by-同舟云学术

Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates

Published:2005 Issue: Volume: Page:40-52
ISSN:0302-9743
Container-title:Logic Programming and Nonmonotonic Reasoning
language:
Short-container-title:

Author:

Faber Wolfgang

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11546207_4.pdf

Reference21 articles.

1. Kemp, D.B., Stuckey, P.J.: Semantics of Logic Programs with Aggregates. In: ISLP 1991, pp. 387–401. MIT Press, Cambridge (1991)

2. Lecture Notes in Computer Science;M. Denecker,2001

3. Lecture Notes in Artificial Intelligence;M. Gelfond,2002

4. Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138, 181–234 (2002)

5. Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate Functions in DLV. In: ASP 2003, Messina, Italy, pp. 274–288 (2003), Online at http://CEUR-WS.org/Vol-78/

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inconsistency Proofs for ASP: The ASP - DRUPE Format;Theory and Practice of Logic Programming;2019-09

2. Inlining External Sources in Answer Set Programs;Theory and Practice of Logic Programming;2019-02-11

3. Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access;Journal of Artificial Intelligence Research;2018-07-30

4. Explaining Inconsistency in Answer Set Programs and Extensions;Logic Programming and Nonmonotonic Reasoning;2017

5. Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies;Logic-Based Program Synthesis and Transformation;2015