More on noMoRe

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

Volumn 2424, Issue , 2002, Pages 468-480

  Linke, Thomas ^a   Anger, Christian ^a   Konczak, Kathrin ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

ANSWER SET; EFFICIENT COMPUTATION; LOGIC PROGRAMS; RULE-BASED METHOD;

COMPUTATION THEORY;

EID: 77952081750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. C. Anger, K. Konczak, and T. Linke. NoMoRe: Non-Monotonic Reasoning with Logic Programs. In I. Ianni and S. Flesca, editors, Eighth European Workshop on Logics in Artificial Intelligence (JELIA'02), vol. 2424 of LNCS. Springer, 2002.
2. P. Cholewiński,V. Marek, A. Mikitiuk, and M. Truszczyński. Experimenting with nonmonotonic reasoning. In Proc. of the International Conference on Logic Programming, p. 267-281. MIT Press, 1995.
3. Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in non-monotonic logic programs. Proc. of the 4th European Conference on Planing, p. 169-181, Toulouse, France, 1997. Springer Verlag.
4. D. East and M. Truszczyński. dcs: An implementation of datalog with constraints. In Proc. of the AAAI. MIT Press, 2000.
5. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for nonmonotonic reasoning. In J. Dix, U. Furbach, and A. Nerode, editors, Proc. of the LPNMR, vol. 1265 of LNAI, p. 363-374. Springer Verlag, 1997.
6. W. Faber, N. Leone, and G. Pfeifer. Pushing goal derivation in dlp computations. In M. Gelfond, N. Leone, and G. Pfeifer, editors, LPNMR, vol. 1730 of LNAI, p. 177-191, El Paso, Texas, USA, 1999. Springer Verlag.
7. W. Faber, N. Leone, and G. Pfeifer. Experimenting with heuristics for answer set programming. In B. Nebel, editor, Proc. of the IJCAI, p. 635-640. Morgan Kaufmann Publishers, 2001.
8. M. Gelfond and V. Lifschitz. Classical negation in logic programs and deductive databases. New Generation Computing, 9:365-385, 1991.
9. N. Iwayama and K. Satoh. Computing abduction by using TMS with top-down expectation. Journal of Logic Programming, 44:179-206, 2000.
10. V. Lifschitz. Answer set planning. In Proc. of the 1999 International Conference on Logic Programming, p. 23-37. MIT Press, 1999.
11. T. Linke. Graph theoretical characterization and computation of answer sets. In B. Nebel, editor, Proc. of the IJCAI, p. 641-645. Morgan Kaufmann Publishers, 2001.
12. T. Linke. Rule-based computation of answer sets. 2002. submitted.
13. X. Liu, C. Ramakrishnan, and S.A. Smolka. Fully local and efficient evaluation of alternating fixed points. Proc. of the 4th Int. Conf. on Tools and Algorithms for the Construction Analysis of Systems, p. 5-19, Lisbon, Portugal, 1998. Springer Verlag.
14. I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.
15. I. Niemelä and P. Simons. Smodels:An implementation of the stable model and well-founded semantics for normal logic programs. In J. Dix, U. Furbach, and A. Nerode, editors, Proc. of the LPNMR, p. 420-429. Springer, 1997.