The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics-Reference-Cited by-同舟云学术

The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

Published:2013 Issue: Volume: Page:67-72
ISSN:0302-9743
Container-title:Logic Programming and Nonmonotonic Reasoning
language:
Short-container-title:

Author:

Alviano Mario,Faber Wolfgang

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40564-8_7

Reference7 articles.

1. Alviano, M., Calimeri, F., Faber, W., Leone, N., Perri, S.: Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates. JAIR 42, 487–527 (2011)

2. Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. AMAI 15(3/4), 289–323 (1995)

3. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artif. Intell. 172(12-13), 1495–1539 (2008)

4. Lecture Notes in Artificial Intelligence;W. Faber,2005

5. Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. AI 175(1), 278–298 (2011), special Issue: John McCarthy’s Legacy

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

1. Aggregate Semantics for Propositional Answer Set Programs;Theory and Practice of Logic Programming;2022-02-23

2. Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search;Fundamenta Informaticae;2020-12-18

3. An Introduction to Answer Set Programming and Some of Its Extensions;Reasoning Web. Declarative Artificial Intelligence;2020

4. Model Enumeration via Assumption Literals;Fundamenta Informaticae;2019-06-01

5. Nurse (Re)scheduling via answer set programming1;Intelligenza Artificiale;2019-01-29