A new algorithm for answer set computation

CEUR Workshop Proceedings

Volumn 142, Issue , 2005, Pages 155-162

  Grossi, Giuliano ^a   Marchi, Massimo ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; BRUTE FORCE ALGORITHMS; COLORABILITY; EXACT ALGORITHMS; LOGIC PROGRAMS; NORMAL FORM; TIME COMPLEXITY; WORST-CASE COMPLEXITY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

COMPUTATIONAL COMPLEXITY;

EID: 64749116384     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Costantini, S.: On the existence of stable models of non-stratified logic programs. Theory and Practice of Logic Programming, accepted for publication (2005)
2. Costantini, S., Provetti, A.: Normal forms for answer set programming. Theory and Practice of Logic Programming, accepted for publication (2005)
3. Costantini, S., D'Antona, O., Provetti, A.: On the equivalence and range of applicability of graph-based representations of logic programs. Information Processing Letters 84(5) (2002) 241-249
4. Marek, W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: a 25-Year Perspective Springer-Verlag (1999) 375-398
5. Konczak, K., Schaub, T., Linke, T.: Graphs and colorings for answer set programming: Abridged report. In: Answer Set Programming. (2003)
6. Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3 (1965) 23-28
7. Lonc, Z., Truszczynski, M.: Computing stable models: Worst-case performance estimates. In: ICLP '02: Proceedings of the 18th International Conference on Logic Programming, SpringerVerlag LNCS (2002) 347-362