The nomore++ system

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

Volumn 3662 LNAI, Issue , 2005, Pages 422-426

  Anger, Christian ^a   Gebser, Martin ^a   Linke, Thomas ^a   Neumann, André ^a   Schaub, Torsten ^a,b  

^a UNIVERSITY OF POTSDAM   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL OBJECTS; NOMORE++ SYSTEM; SOLVERS;

COMPUTATIONAL LINGUISTICS; HYBRID COMPUTERS; PROBLEM SOLVING;

COMPUTER SYSTEMS;

EID: 33646062878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_39     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. Anger, C., Konczak, K., Linke, T.: noMoRe: A system for non-monotonic reasoning under answer set semantics. In Eiter, T., Faber, W., Truszczyński, M., eds.: Proceedings of the Int'l Conference on Logic Programming and Nonmonotonic Reasoning, Springer (2001) 406-410
4. (http://www.es.uhi-potsdam.de/nomore)
5. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the International Conference on Logic Programming, MIT Press (1988) 1070-1080
6. Järvisalo, M., Junttila, T., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence (to appear)
7. Baaz, M., Egly, U., Leitsch, A.: Normal form transformations. [8] chapter 5 273-333
8. Robinson, J., Voronkov, A., eds.: Handbook of Automated Reasoning. MIT Press (2001)
9. van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38 (1991) 620-650
10. Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. Submitted for publication (2005)
11. Fitting, M.: Fixpoint semantics for logic programming: A survey. Theoretical Computer Science 278 (2002) 25-51
12. Konczak, K., Linke, T., Schaub, T.: Graphs and colorings for answer set programming. Theory and Practice of Logic Programming (2005) To appear.
13. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135 (1997) 69-112
14. (http://www.tcs.hut.fi/Software/smodels/)
15. (http://asparagus.cs.uni-potsdam.de)
16. Faber, W., Leone, N., Pfeifer, G.: Pushing goal derivation in dip computations. In: Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99). (1999) 177-191
17. Linke, T., Sarsakov, V.: Suitable graphs for answer set programming. In Baader, F., Voronkov, A., eds.: Proceedings of the International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05). Springer (2005) 154-168