Decomposition of nonmonotone aggregates in logic programming

Proceedings of the 20th Workshop on Logic Programming, WLP 2006

Volumn , Issue , 2006, Pages 164-171

  Faber, Wolfgang ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; LOGIC PROGRAMMING; PROGRAM TRANSLATORS; SEMANTICS;

AGGREGATE FUNCTION; ANSWER SET PROGRAMMING; NONMONOTONE; NONMONOTONE AGGREGATES; REASONING TASKS; RECURSIVE AGGREGATES;

AGGREGATES;

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

References (15)

1. Kemp, D.B., Stuckey, P.J.: Semantics of Logic Programs with Aggregates. In: ISLP'91, MIT Press (1991) 387-401
2. Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate Well-Founded and Stable Model Semantics for Logic Programs with Aggregates. In Codognet, P., ed.: ICLP-2001, (2001) 212-226
3. Gelfond, M.: Representing Knowledge in A-Prolog. In: Computational Logic. Logic Programming and Beyond. LNCS 2408 (2002) 413-451
4. Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138 (2002) 181-234
5. Dell'Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate Functions in DLV. In: ASP'03, Messina, Italy (2003) 274-288 Online at http://CEUR-WS.org/Vol-78/.
6. Pelov, N., Truszczyński, M.: Semantics of disjunctive programs with monotone aggregates-an operator-based approach. In: NMR 2004. (2004) 327-334
7. Pelov, N., Denecker, M., Bruynooghe, M.: Partial stable models for logic programs with aggregates. In: LPNMR-7. LNCS 2923
8. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: JELIA 2004. LNCS 3229
9. Ferraris, P.: Answer Sets for Propositional Theories. In: Logic Programming and Nonmonotonic Reasoning {pipe} 8th International Conference, LPNMR'05, Diamante, Italy, 2005, Proceedings. LNCS 3662
10. Calimeri, F., Faber, W., Leone, N., Perri, S.: Declarative and Computational Properties of Logic Programs with Aggregates. In: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05). (2005) 406-411
11. Faber, W.: Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates. In: Logic Programming and Nonmonotonic Reasoning {pipe} 8th International Conference, LPNMR'05, Diamante, Italy, 2005, Proceedings. LNCS 3662
12. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2002)
13. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9 (1991) 365-385
14. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
15. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33 (2001) 374-425