Aggregates in answer set optimization

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

Volumn 6645 LNAI, Issue , 2011, Pages 211-216

  Saad, Emad ^a   Brewka, Gerhard ^b  

^a GULF UNIVERSITY FOR SCIENCE AND TECHNOLOGY   (Kuwait)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; FLEXIBLE FRAMEWORK; NUMERICAL CRITERIA; QUALITATIVE OPTIMIZATION; QUALITY OF SOLUTION; PROBLEM SOLUTIONS;

LOGIC PROGRAMMING; SEMANTICS; AGGREGATES; COMPUTER CIRCUITS; COMPUTER PROGRAMMING;

OPTIMIZATION; LOGIC PROGRAMMING;

EID: 79955750891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20895-9_21     Document Type: Conference Paper

References (8)

1. Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: Proc. IJCAI, pp. 867-872 (2003)
2. Brewka, G.: Logic programming with ordered disjunction. In: Proc. AAAI, pp. 100- 105 (2002)
3. Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175(1), 278-298 (2010)
4. Faber,W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200-212. Springer, Heidelberg (2004) (Pubitemid 41049936)
5. Foo, N., Meyer, T., Brewka, G.: LPOD answer sets and nash equilibria. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 343-351. Springer, Heidelberg (2004) (Pubitemid 39739343)
6. Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. TPLP 7, 355-375 (2007)
7. Sakama, C., Inoue, K.: Prioritized logic programming and its application to common-sense reasoning. Artificial Intelligence 123(1-2), 185-222 (2000)
8. Schaub, T., Wang, K.: A comparative study of logic programming with preference. In: Proc. IJCAI, pp. 597-602 (2001)