One more decidable class of finitely ground programs

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

Volumn 5649 LNCS, Issue , 2009, Pages 489-493

  Lierler, Yuliya ^a   Lifschitz, Vladimir ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS;

ANSWER SET; DECIDABLE SUBSETS; FINITE DOMAINS; FUNCTION SYMBOLS; LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 69949134571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02846-5_40     Document Type: Conference Paper

References (5)

1. Syrjänen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS, vol. 2173, pp. 267-279. Springer, Heidelberg (2001)
2. Gebser, M., Schaub, T., Thiele, S.: Gringo: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 266-271. Springer, Heidelberg (2007)
3. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: theory and implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407-424. Springer, Heidelberg (2008)
4. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385 (1991)
5. Mahfoudh, M., Niebert, P., Asarin, E., Maler, O.: A satisfiability checker for difference logic. In: Proceedings of International Conference on the Theory and Applications of Satisfiability Testing (SAT), pp. 222-230 (2002)