Logic programs with abstract constraint atoms: The role of computations

Artificial Intelligence

Volumn 174, Issue 3-4, 2010, Pages 295-315

  Liu, Lengning ^a   Pontelli, Enrico ^b   Son, Tran Cao ^b   Truszczyński, Miroslaw ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

^b New Mexico State University   (United States)

Author keywords

Answer sets; Computations; Logic programs with abstract constraint atoms

Indexed keywords

ANSWER SET; ARBITRARY CONSTRAINTS; COMPUTATIONS; LOGIC PROGRAMS; SET SEMANTICS;

ABSTRACTING; ATOMS; SEMANTICS;

LOGIC PROGRAMMING;

EID: 74449084249     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2009.11.016     Document Type: Article

References (45)

1. Apt K. Logic programming. In: van Leeuven J. (Ed). Handbook of Theoretical Computer Science (1990), Elsevier, Amsterdam 493-574
2. Balduccini M., Gelfond M., and Nogueira M. Answer set based design of knowledge systems. Annals of Mathematics and Artificial Intelligence 47 1-2 (2006) 183-219
3. Baral C. Knowledge Representation, Reasoning, and Declarative Problem Solving (2003), Cambridge University Press
4. Baral C. From knowledge to intelligence-building blocks and applications. Invited talk (2005), AAAI. www.public.asu.edu/~cbaral/aaai05-invited-talk.ppt
5. Dantsin E., Eiter T., Gottlob G., and Voronkov A. Complexity and expressive power of logic programming. ACM Computing Surveys 33 3 (2001) 374-425
6. T. Dell'Armi, W. Faber, G. Ielpa, N. Leone, G. Pfeifer, Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV, in: Proceedings of the 18th International Joint Conference on Artificial Intelligence, IJCAI 2003, 2003, pp. 847-852
7. M. Denecker, V. Marek, M. Truszczyński, Ultimate semantic treatment of default and autoepistemic logics, in: Proceedings of KR, Principles of Knowledge Representation and Reasoning, 2000, pp. 74-84
8. Denecker M., Pelov N., and Bruynooghe M. Ultimate well-founded and stable semantics for logic programs with aggregates. In: Codognet P. (Ed). Logic Programming, Proceedings of the 17th International Conference. ICLP 2001, Paphos, Cyprus, November 26-December 1, 2001. Lecture Notes in Computer Science vol. 2237 (2001), Springer 212-226
9. K system. Artificial Intelligence 144 1-2 (2003) 157-211
10. Eiter T., Faber W., Leone N., Pfeifer G., and Polleres A. Answer set planning under action costs. Journal of Artificial Intelligence Research 19 (2003) 25-71
11. Elkabani I., Pontelli E., and Son T.C. Smodels with CLP and its applications: A simple and effective approach to aggregates in ASP. In: Demoen B., and Lifschitz V. (Eds). Logic Programming, Proceedings of the 20th International Conference. ICLP 2004, Saint-Malo, France, September 6-10, 2004. Lecture Notes in Computer Science vol. 3132 (2004), Springer 73-89
12. Erdem E., and Lifschitz V. Tight logic programs. Theory and Practice of Logic Programming 3 4-5 (2003) 499-518
13. Erdem E., Lifschitz V., and Ringe D. Temporal phylogenetic networks and logic programming. Theory and Practice of Logic Programming 6 5 (2006) 539-558
14. Faber W., Leone N., and Pfeifer G. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: Alferes J.J., and Leite J.A. (Eds). Logics in Artificial Intelligence, Proceedings of the 9th European Conference. JELIA 2004, Lisbon, Portugal, September 27-30, 2004. Lecture Notes in Computer Science vol. 3229 (2004), Springer 200-212
15. Ferraris P. Answer sets for propositional theories. In: Baral C., Greco G., Leone N., and Terracina G. (Eds). Logic Programming and Non-monotonic Reasoning, Proceedings of the 8th International Conference. LPNMR 2005, Diamante, Italy, September 5-8, 2005. Lecture Notes in Computer Science vol. 3662 (2005), Springer 119-131
16. Gebser M., Kaufmann B., and Schaub T. clasp: A conflict driven answer set solver. In: Baral C., Brewka G., and Schlipf J. (Eds). Logic Programming and Non-monotonic Reasoning, Proceedings of the 9th International Conference. LPNMR 2007, Tempe, USA, May 15-17, 2007. Lecture Notes in Computer Science vol. 4483 (2007), Springer 260-265
17. Gelfond M. Representing knowledge in A-Prolog. In: Kakas A., and Sadri F. (Eds). Computational Logic: Logic Programming and Beyond (2002), Springer-Verlag 413-451
18. Gelfond M., and Leone N. Logic programming and knowledge representation-the A-Prolog perspective. Artificial Intelligence 138 1-2 (2002) 3-38
19. Gelfond M., and Lifschitz V. The stable model semantics for logic programming. In: Kowalski R., and Bowen K. (Eds). Logic Programming: Proceedings of the Fifth International Conference and Symposium (1988), The MIT Press 1070-1080
20. Gelfond M., and Lifschitz V. Logic programs with classical negation. In: Warren D., and Szeredi P. (Eds). Logic Programming: Proceedings of the Seventh International Conference (1990), The MIT Press 579-597
21. Heljanko K., and Niemelä I. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3 4-5 (2003) 519-550
22. Leone N., Pfeifer G., Faber W., Eiter T., Gottlob G., Perri S., and Scarcello F. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7 3 (2006) 499-562
23. Lierler Y., and Maratea M. Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz V., and Niemelä I. (Eds). Proceedings of the 7th International Conference on Logic Programming and Non-monotonic Reasoning Conference, LPNMR'04. LNCS vol. 2923 (2004), Springer-Verlag 346-350
24. Liu L., Pontelli E., Son T.C., and Truszczyński M. Logic programs with abstract constraint atoms: The role of computations. In: Dahl V., and Niemelä I. (Eds). Proceedings of the 23rd International Conference on Logic Programming. ICLP 2007, Porto, Portugal, September 8-13. Lecture Notes in Computer Science vol. 4670 (2007), Springer 286-301
25. Liu L., and Truszczyński M. Properties of programs with monotone and convex constraints. In: Veloso M.M., and Kambhampati S. (Eds). Proceedings. The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005 (2005), AAAI Press/The MIT Press, Pittsburgh, Pennsylvania, USA 701-706
26. Lloyd J. Foundations of Logic Programming. 2nd edition (1987), Springer-Verlag
27. Marek V.W., Nerode A., and Remmel J.B. Logic programs, well-orderings, and forward chaining. Ann. Pure Appl. Logic 96 1-3 (1999) 231-276
28. Marek V.W., Niemelä I., and Truszczyński M. Logic programs with monotone abstract constraint atoms. Theory and Practice of Logic Programming 8 2 (2008) 167-199
29. Marek V.W., and Remmel J.B. Set constraints in logic programming. Logic Programming and Non-monotonic Reasoning, Proceedings of the 7th International Conference. LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004. Lecture Notes in Computer Science vol. 2923 (2004), Springer-Verlag 167-179
30. Marek V.W., and Truszczyński M. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: A 25-year Perspective (1999), Springer-Verlag 375-398
31. Marek V.W., and Truszczyński M. Logic programs with abstract constraint atoms. Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, July 25-29, 2004, San Jose, California, USA (2004), AAAI Press/The MIT Press 86-91
32. Marek W., and Truszczyński M. Non-Monotonic Logic: Context Dependent Reasoning (1993), Springer-Verlag
33. Niemelä I. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25 3-4 (1999) 241-273
34. Niemelä I., and Simons P. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. Logic Programming and Non-monotonic Reasoning, 7th International Conference, LPNMR 1997 (1997), Springer-Verlag 420-429
35. Pelov N. Semantic of logic programs with aggregates. PhD thesis, Katholieke Universiteit Leuven, 2004. www.cs.kuleuven.ac.be/publicaties/doctoraten/cw/CW2004_02.abs.html
36. Pelov N., Denecker M., and Bruynooghe M. Partial stable models for logic programs with aggregates. Logic Programming and Non-monotonic Reasoning, 7th International Conference, LPNMR 2004 (2004), Springer-Verlag 207-219
37. N. Pelov, M. Truszczyński, Semantics of disjunctive programs with monotone aggregates-an operator-based approach, in: J.P. Delgrande, T. Schaub (Eds.), Proceedings of the 10th International Workshop on Non-Monotonic Reasoning, NMR-04, 2004, pp. 327-334
38. Shen Y.-D., and You J.-H. A generalized Gelfond-Lifschitz transformation for logic programs with abstract constraints. AAAI (2007), AAAI Press 483-488
39. Simons P., Niemelä N., and Soininen T. Extending and implementing the stable model semantics. Artificial Intelligence 138 1-2 (2002) 181-234
40. Son T.C., and Pontelli E. A constructive semantic characterization of aggregates in answer-set programming. Theory and Practice of Logic Programming 7 3 (2007) 355-375
41. Son T.C., Pontelli E., and Elkabani I. An unfolding-based semantics for logic programming with aggregates. Computing research repository (2006). cs.SE/0605038
42. Son T.C., Pontelli E., and Tu P.H. Answer sets for logic programs with arbitrary abstract constraint atoms. Journal of Artificial Intelligence Research 29 (2007) 353-389
43. van Emden M., and Kowalski R. The semantics of predicate logic as a programming language. Journal of the ACM 23 4 (1976) 733-742
44. Van Gelder A., Ross K., and Schlipf J. The well-founded semantics for general logic programs. Journal of the ACM 38 3 (1991) 620-650
45. You J.-H., Yuan L.-Y., Liu G., and Shen Y.-D. Logic programs with abstract constraints: Representation, disjunction and complexities. In: Baral C., Brewka G., and Schlipf J.S. (Eds). Logic Programming and Non-monotonic Reasoning, Proceedings of the 9th International Conference. LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007. Lecture Notes in Computer Science vol. 4483 (2007), Springer 228-240