Answer Sets for Propositional Theories-Reference-Cited by-同舟云学术

Answer Sets for Propositional Theories

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

Author:

Ferraris Paolo

Publisher

Springer Berlin Heidelberg

Link

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

Reference17 articles.

1. Cabalar, P., Ferraris, P.: Propositional theories are equivalent to logic programs (2005) (in preparation)

2. Calimeri, F., Faber, W., Leone, N., Perri, S.: Declarative and computational properties of logic programs with aggregates. In: Proc. IJCAI 2005 (2005) (to appear)

3. Eiter, T., Gottlob, G.: Complexity results for disjunctive logic programming and application to nonmonotonic logics. In: Miller, D. (ed.) Proceedings of International Logic Programming Symposium (ILPS), pp. 266–278 (1993)

4. Lecture Notes in Artificial Intelligence;S.T. Erdoğan,2003

5. Cabalar, P., Ferraris, P.: Propositional theories are equivalent to logic programs (2005) (in preparation)

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

1. Locally Tight Programs;Theory and Practice of Logic Programming;2024-01-19

2. An abstract view on optimizations in propositional frameworks;Annals of Mathematics and Artificial Intelligence;2023-12-16

3. A general framework for preferences in answer set programming;Artificial Intelligence;2023-12

4. Positive Dependency Graphs Revisited;Theory and Practice of Logic Programming;2022-08-23

5. Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs;Theory and Practice of Logic Programming;2022-03-18