Unfounded sets for disjunctive logic programs with arbitrary aggregates

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

Volumn 3662 LNAI, Issue , 2005, Pages 40-52

  Faber, Wolfgang ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; DATABASE SYSTEMS; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS); SEMANTICS;

ANSWER SET PROGRAMMING; ARBITRARY AGGREGATES; DISJUNCTIVE LOGIC PROGRAMS; UNFOUNDED SETS;

LOGIC PROGRAMMING;

EID: 33646050945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_4     Document Type: Conference Paper

References (21)

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., lelpa, 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, http://www.cs.utexas.edu/users/otto/papers/proptheories.ps (2004)
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) To appear.
11. Leone, N., Rullo, P., Scarcello, F: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation 135 (1997) 69-112
12. Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning Operators for Answer Set Programming Systems. In: NMR'2002. (2002) 200-209
13. Koch, C., Leone, N., Pfeifer, G.: Enhancing Disjunctive Logic Programming Systems by SAT Checkers. Artificial Intelligence 15 (2003) 177-212
14. Pfeifer, G.: Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs. In: LPNMR-7. LNCS, (2004) 220-233
15. Lee, J.: A Model-Theoretic Counterpart of Loop Formulas, http://www.cs.utexas.edu/users/appsmurf/papers/mtclf.pdf (2004)
16. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2002)
17. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9 (1991) 365-385
18. Van Gelder, A., Ross, K., Schlipf, J.: The Well-Founded Semantics for General Logic Programs. JACM 38 (1991) 620-650
19. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33 (2001) 374-425
20. Wang, K., Zhou, L.: Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM TOCL 6 (2005)
21. Pelov, N.: Semantics of Logic Programs with Aggregates. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium (2004)