Loops: Relevant or redundant?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3662 LNAI, Issue , 2005, Pages 53-65

  Gebser, Martin ^a   Schaub, Torsten ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET COMPUTATION; ANSWER SET PROGRAMMING; ELEMENTARY LOOPS; SAT-BASED ANSWER SET SOLVERS;

COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; GRAPH THEORY; INFORMATION RETRIEVAL; LOGIC PROGRAMMING;

PHASE LOCKED LOOPS;

EID: 33646038256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_5     Document Type: Conference Paper

References (17)

1. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138 (2002) 181-234
2. Leone, N., Faber, W., Pfeifer, G., Eiter, T., Gottlob, G., Koch, C, Mateis, C, Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (2005) To appear.
3. Babovich, Y., Lifschitz, V.: Computing answer sets using program completion. Unpublished draft. (2003)
4. Lin, F., Zhao, Y.: Assat: computing answer sets of a logic program by sat solvers. Artificial Intelligence 157 (2004) 115-137
5. Lierler, Y., Maratea, M.: Cmodels-2: Sat-based answer sets solver enhanced to non-tight programs. In Lifschitz, V., Niemelä, L, eds.: Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning. Springer (2004) 346-350
6. Clark, K.: Negation as failure. In Gallaire, H., Minker, J., eds.: Logic and Data Bases. Plenum Press (1978) 293-322
7. Pages, F.: Consistency of clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1 (1994) 51-60
8. Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic (To appear.)
9. Linke, T.: Suitable graphs for answer set programming. In Vos, M.D., Provetti, A., eds.: Proceedings of the Second International Workshop on Answer Set Programming. CEUR Workshop Proceedings (2003) 15-28
10. Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In Minker, J., ed.: Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers (1987) 89-148
11. Przymusinski, T.: On the declarative semantics of deductive databases and logic programs. In Minker, J., ed.: Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers (1988) 193-216
12. (http://www.cs.uni-potsdam.de/~linke/nomore)
13. Papadimitriou, C., Sideri, M.: Default theories that always have extensions. Artificial Intelligence 69 (1994) 347-357
14. Janhunen, T.: Comparing the expressive powers of some syntactically restricted classes of logic programs. In Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K., Palamidessi, C., Pereira, L., Sagiv, Y., Stuckey, P., eds.: Proceedings of the First International Conference on Computational Logic. Springer (2000) 852-866
15. Dix, J., Furbach, U., Niemelä, I.: Nonmonotonic reasoning: Towards efficient calculi and implementations. In Robinson, J., Voronkov, A., eds.: Handbook of Automated Reasoning. Elsevier and MIT Press (2001) 1241-1354
16. van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38 (1991) 620-650
17. Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In Palamidessi, C., ed.: Proceedings of 19th International Conference on Logic Programming. Springer (2003) 451-465