Skip to main content
SpringerLink
Log in

Answer Set Programming

  • Chapter
A 25-Year Perspective on Logic Programming

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6125))

Abstract

Answer Set Programming (ASP), referred to also as Disjunctive Logic Programming under the stable model semantics (DLP), is a powerful formalism for Knowledge Representation and Reasoning. ASP has been the subject of intensive research studies, and, also thanks to the availability of some efficient ASP systems, has recently gained quite some popularity and is applied also in relevant industrial projects. The Italian logic programming community has been very active in this area, some ASP results achieved in Italy are widely recognized as milestones on the road to the current state of the art. After a formal definition of ASP, this chapter surveys the main contribution given by the Italian community to the ASP field in the last 25 years.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2003)

    Google Scholar 

  2. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: ICLP/SLP 1988, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  3. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9, 365–385 (1991)

    Article  Google Scholar 

  4. Lifschitz, V.: Answer Set Planning. In: ICLP 1999, pp. 23–37 (1999)

    Google Scholar 

  5. Marek, V.W., Truszczyński, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm – A 25-Year Perspective, pp. 375–398 (1999)

    Google Scholar 

  6. Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming, Washington, DC (1988)

    Google Scholar 

  7. Minker, J., Rajasekar, A.: A Fixpoint Semantics for Disjunctive Logic Programs. JLP 9(1), 45–74 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. The MIT Press, Cambridge (1992)

    Google Scholar 

  9. Fernández, J.A., Minker, J.: Semantics of Disjunctive Deductive Databases. In: Hull, R., Biskup, J. (eds.) ICDT 1992. LNCS, vol. 646, pp. 21–50. Springer, Heidelberg (1992)

    Google Scholar 

  10. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM TODS 22(3), 364–418 (1997)

    Article  Google Scholar 

  11. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3), 374–425 (2001)

    Article  Google Scholar 

  12. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-Solving Using the DLV System. In: Logic-Based Artificial Intelligence, pp. 79–103. Kluwer, Dordrecht (2000)

    Google Scholar 

  13. Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczyński, M.: The First Answer Set Programming System Competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 3–17. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Zhao, Y.: The Second Answer Set Programming Competition homepage (2009x), http://www.cs.kuleuven.be/~dtai/ASP-competition

  15. Dovier, A., Formisano, A., Pontelli, E.: An Empirical Study Of Constraint Logic Programming And Answer Set Programming Solutions Of Combinatorial Problems. J. Exp. Theor. Artif. Intell. 21(2), 79–121 (2009)

    Article  MATH  Google Scholar 

  16. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  17. Simons, P.: Smodels Homepage (since (1996), http://www.tcs.hut.fi/Software/smodels/

  18. Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. AI 138, 181–234 (2002)

    MATH  Google Scholar 

  19. Zhao, Y.: ASSAT homepage (since 2002), http://assat.cs.ust.hk/

  20. Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: AAAI 2002, Edmonton, Alberta, Canada. AAAI Press / MIT Press (2002)

    Google Scholar 

  21. Babovich, Y., Maratea, M.: Cmodels-2: SAT-based Answer Sets Solver Enhanced to Non-tight Programs (2003), http://www.cs.utexas.edu/users/tag/cmodels.html

  22. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-Driven Answer Set Solving. In: IJCAI 2007, pp. 386–392 (2007)

    Google Scholar 

  23. Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.H.: Unfolding Partiality and Disjunctions in Stable Model Semantics. ACM TOCL 7(1), 1–37 (2006)

    Article  Google Scholar 

  24. Lierler, Y.: Disjunctive Answer Set Programming via Satisfiability. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 447–451. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., Schaub, T.: Conflict-Driven Disjunctive Answer Set Solving. In: Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), Sydney, Australia, pp. 422–432. AAAI Press, Menlo Park (2008)

    Google Scholar 

  26. Ielpa, S.M., Iiritano, S., Leone, N., Ricca, F.: An ASP-Based System for e-Tourism. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 368–381. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  27. Leone, N., Ricca, F., Terracina, G.: An ASP-Based Data Integration System. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 528–534. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  28. Leone, N., Gottlob, G., Rosati, R., Eiter, T., Faber, W., Fink, M., Greco, G., Ianni, G., Kałka, E., Lembo, D., Lenzerini, M., Lio, V., Nowicki, B., Ruzzi, M., Staniszkis, W., Terracina, G.: The INFOMIX System for Advanced Integration of Incomplete and Inconsistent Data. In: SIGMOD 2005, Baltimore, Maryland, USA, pp. 915–917. ACM Press, New York (2005)

    Chapter  Google Scholar 

  29. Franconi, E., Palma, A.L., Leone, N., Perri, S.: Census Data Repair: A Challenging Application of Disjunctive Logic Programming. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 561–578. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  30. Cumbo, C., Iiritano, S., Rullo, P.: OLEX – A Reasoning-Based Text Classifier. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 722–725. Springer, Heidelberg (2004)

    Google Scholar 

  31. Rullo, P., Cumbo, C., Policicchio, V.L.: Learning Rules With Negation For Text Categorization. In: ACM Symposium on Applied Computing (SAC 2007), Seoul, Korea, 11-15, pp. 409–416. ACM, New York (2007)

    Chapter  Google Scholar 

  32. Ruffolo, M., Manna, M.: HiLeX: A System for Semantic Information Extraction from Web Documents. In: ICEIS. Lecture Notes in Business Information Processing, vol. (3), pp. 194–209. Springer, Heidelberg (2008)

    Google Scholar 

  33. Ruffolo, M., Leone, N., Manna, M., Saccà, D., Zavatto, A.: Exploiting ASP for Semantic Information Extraction. In: Proceedings ASP 2005 - Answer Set Programming: Advances in Theory and Implementation, Bath, UK, pp. 248–262 (2005)

    Google Scholar 

  34. Leone, N., Rullo, P., Scarcello, F.: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation 135(2), 69–112 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  35. Costantini, S.: Contributions to the stable model semantics of logic programs with negation. Theoretical Computer Science 149 (1995); preliminary version in Proc. of LPNMR93

    Google Scholar 

  36. Brignoli, G., Costantini, S., D’Antona, O., Provetti, A.: Characterizing and Computing Stable Models of Logic Programs: the Non–stratified Case. In: Proc. of the 1999 Conference on Information Technology, Bhubaneswar, India (1999)

    Google Scholar 

  37. Bertoni, A., Grossi, G., Provetti, A., Kreinovich, V., Tari, L.: The Prospect for Answer Set Computation by a Genetic Model. In: AAAI Spring Symposium ASP 2001, pp. 1–5. AAAI Press, Menlo Park (2001)

    Google Scholar 

  38. Grossi, G., Marchi, M., Pontelli, E., Provetti, A.: Improving the AdjSolver Algorithm for ASP Kernel Programs. In: ASP 2007, 4th International Workshop on Answer Set Programming at ICLP 2007 (2007)

    Google Scholar 

  39. Costantini, S., Provetti, A.: Normal Forms for Answer Sets Programming. J. on TPLP 5(6) (2005)

    Google Scholar 

  40. Grasso, G., Iiritano, S., Leone, N., Ricca, F.: Some DLV Applications for Knowledge Management. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 591–597. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  41. Ricca, F., Gallucci, L., Schindlauer, R., Dell’Armi, T., Grasso, G., Leone, N.: OntoDLV: an ASP-based System for Enterprise Ontologies. Journal of Logic and Computation (2009)

    Google Scholar 

  42. Ricca, F., Leone, N.: Disjunctive Logic Programming With Types And Objects: The Dlv +  System. Journal of Applied Logics 5(3), 545–573 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  43. Cumbo, C., Faber, W., Greco, G., Leone, N.: Enhancing the Magic-Set Method for Disjunctive Datalog Programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 371–385. Springer, Heidelberg (2004)

    Google Scholar 

  44. Faber, W., Greco, G., Leone, N.: Magic Sets and their Application to Data Integration. JCSS 73(4), 584–609 (2007)

    MATH  MathSciNet  Google Scholar 

  45. Friedrich, G., Ivanchenko, V.: Diagnosis From First Principles For Workflow Executions. Tech. Rep., http://proserver3-iwas.uni-klu.ac.at/download_area/Technical-Reports/technical_report_2008_02.pdf

  46. Buccafurri, F., Leone, N., Rullo, P.: Enhancing Disjunctive Datalog by Constraints. IEEE TKDE 12(5), 845–860 (2000)

    Google Scholar 

  47. Calimeri, F., Faber, W., Leone, N., Perri, S.: Declarative and Computational Properties of Logic Programs with Aggregates. In: IJCAI 2005, pp. 406–411 (2005)

    Google Scholar 

  48. Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV. In: IJCAI 2003, Acapulco, Mexico, pp. 847–852 (2003)

    Google Scholar 

  49. Faber, W., Leone, N.: On the Complexity of Answer Set Programming with Aggregates. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 97–109. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  50. 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)

    Google Scholar 

  51. Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. ACM TOCL 5(2), 206–263 (2004)

    Article  MathSciNet  Google Scholar 

  52. Perri, S., Scarcello, F., Leone, N.: Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation. TPLP 5(1–2), 123–159 (2005)

    MATH  MathSciNet  Google Scholar 

  53. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer Set Programming. In: IJCAI 2005, Edinburgh, UK, pp. 90–96 (2005)

    Google Scholar 

  54. Calimeri, F., Ianni, G., Ielpa, G., Pietramala, A., Santoro, M.C.: A System with Template Answer Set Programs. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 693–697. Springer, Heidelberg (2004)

    Google Scholar 

  55. Costantini, S., Formisano, A.: Answer Set Programming with Resources. Journal of Logic and Computation (to appear, 2009), www.dipmat.unipg.it/~formis/papers/report200816.ps.gz Draft available as Report-16/2008 of Dip. di Matematica e Informatica, Univ. di Perugia

  56. Costantini, S., Formisano, A.: Modeling Preferences And Conditional Preferences On Resource Consumption And Production In Asp. Journal of of Algorithms in Cognition, Informatics and Logic 64(1), 3–15 (2009)

    MATH  MathSciNet  Google Scholar 

  57. Balduccini, M., Gelfond, M.: Logic Programs with Consistency-Restoring Rules. In: International Symposium on Logical Formalization of Commonsense Reasoning. AAAI 2003 Spring Symposium Series (2003)

    Google Scholar 

  58. Bria, A., Faber, W., Leone, N.: Normal Form Nested Programs. FI (2009) (accepted for publication)

    Google Scholar 

  59. Bonatti, P.A.: Reasoning with Infinite Stable Models. Artif. Intell. 156(1), 75–111 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  60. Bonatti, P.: Reasoning with Infinite Stable Models. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, pp. 603–610 (2001)

    Google Scholar 

  61. Baselice, S., Bonatti, P.A., Criscuolo, G.: On Finitely Recursive Programs. TPLP 9(2), 213–238 (2009)

    MATH  MathSciNet  Google Scholar 

  62. Bonatti, P.A.: Reasoning with infinite stable models II: Disjunctive programs. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 333–346. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  63. Bonatti, P.A.: Erratum to: Reasoning with infinite stable models [artificial intelligence 156(1) (2004) 75–111]. Artif. Intell. 172(15), 1833–1835 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  64. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable Functions in ASP: Theory and Implementation. In: [150], pp.407–424

    Google Scholar 

  65. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs. In: [151], 71–86

    Google Scholar 

  66. Bonatti, P.A.: Resolution for Skeptical Stable Model Semantics. J. Autom. Reasoning 27(4), 391–421 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  67. Bonatti, P.A., Pontelli, E., Son, T.C.: Credulous Resolution for Answer Set Programming. In: AAAI, pp. 418–423. AAAI Press, Menlo Park (2008)

    Google Scholar 

  68. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: An ASP System with Functions, Lists, and Sets. In: [151], 483–489

    Google Scholar 

  69. Faber, W., Leone, N., Mateis, C., Pfeifer, G.: Using Database Optimization Techniques for Nonmonotonic Reasoning. In: DDLP 1999, Prolog Association of Japan, pp. 135–139 (1999)

    Google Scholar 

  70. Leone, N., Perri, S., Scarcello, F.: Improving ASP Instantiators by Join-Ordering Methods. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 280–294. Springer, Heidelberg (2001)

    Google Scholar 

  71. Perri, S., Scarcello, F., Catalano, G., Leone, N.: Enhancing DLV Instantiator by Backjumping Techniques. AMAI 51(2-4), 195–228 (2007)

    MATH  MathSciNet  Google Scholar 

  72. Calimeri, F., Perri, S., Ricca, F.: Experimenting with Parallelism for the Instantiation of ASP Programs. Journal of Algorithms in Cognition, Informatics and Logics 63(1-3), 34–54 (2008)

    MATH  MathSciNet  Google Scholar 

  73. Vescio, S., Perri, S., Ricca, F.: Efficient Parallel ASP Instantiation via Dynamic Rewriting. In: Proceedings of the First Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008), Udine, Italy (2008)

    Google Scholar 

  74. Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning Operators for Disjunctive Logic Programming Systems. FI 71(2-3), 183–214 (2006)

    MATH  MathSciNet  Google Scholar 

  75. Faber, W., Leone, N., Pfeifer, G., Ricca, F.: On look-ahead heuristics in disjunctive logic programming. AMAI 51(2-4), 229–266 (2007)

    MATH  MathSciNet  Google Scholar 

  76. Ricca, F., Faber, W., Leone, N.: A Backjumping Technique for Disjunctive Logic Programming. AI Communications 19(2), 155–172 (2006)

    MATH  MathSciNet  Google Scholar 

  77. Maratea, M., Ricca, F., Faber, W., Leone, N.: Look-Back Techniques and Heuristics in DLV: Implementation, Evaluation and Comparison to QBF Solvers. Journal of Algorithms in Cognition, Informatics and Logics 63(1-3), 70–89 (2008)

    MATH  MathSciNet  Google Scholar 

  78. Koch, C., Leone, N., Pfeifer, G.: Enhancing Disjunctive Logic Programming Systems by SAT Checkers. AI 15(1-2), 177–212 (2003)

    MathSciNet  Google Scholar 

  79. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  80. Van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  81. Reiter, R.: On Closed World Data Bases. In: Logic and Data Bases, pp. 55–76. Plenum Press, New York (1978)

    Google Scholar 

  82. Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. AMAI 12, 53–87 (1994)

    MATH  MathSciNet  Google Scholar 

  83. Ben-Eliyahu, R., Palopoli, L.: Reasoning with Minimal Models: Efficient Algorithms and Applications. In: Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR 1994), pp. 39–50 (1994)

    Google Scholar 

  84. Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate Well-Founded and Stable Model Semantics for Logic Programs with Aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, p. 212. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  85. Hella, L., Libkin, L., Nurmonen, J., Wong, L.: Logics with Aggregate Operators. J. ACM 48(4), 880–907 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  86. Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and Stable Semantics of Logic Programs with Aggregates. TPLP 7(3), 301–353 (2007)

    MATH  MathSciNet  Google Scholar 

  87. Elkabani, I., Pontelli, E., Son, T.C.: Smodels\(^{\mbox{A}}\) - A System for Computing Answer Sets of Logic Programs with Aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 427–431. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  88. Son, T.C., Pontelli, E.: A Constructive Semantic Characterization of Aggregates in ASP. TPLP 7, 355–375 (2007)

    MATH  MathSciNet  Google Scholar 

  89. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. CUP (2003)

    Google Scholar 

  90. Lifschitz, V., Tang, L.R., Turner, H.: Nested Expressions in Logic Programs. AMAI 25(3-4), 369–389 (1999)

    MATH  MathSciNet  Google Scholar 

  91. Mileo, A., Schaub, T.: Qualitative Constraint Enforcement in Advanced Policy Specification. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 695–706. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  92. Bertino, E., Mileo, A., Provetti, A.: PDL with Preferences. In: POLICY, pp. 213–222. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  93. Marchi, M., Mileo, A., Provetti, A.: Specification and Execution of Declarative Policies for Grid Service Selection. In (LJ) Zhang, L.-J., Jeckle, M. (eds.) ECOWS 2004. LNCS, vol. 3250, pp. 102–115. Springer, Heidelberg (2004)

    Google Scholar 

  94. Bertino, E., Mileo, A., Provetti, A.: PDL with Maximum Consistency Monitors. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 65–74. Springer, Heidelberg (2003)

    Google Scholar 

  95. Sterling, L., Shapiro, E.: The Art of Prolog, 2nd edn. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  96. Šimkus, M., Eiter, T.: FDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 514–530. Springer, Heidelberg (2007)

    Google Scholar 

  97. Syrjänen, T.: Omega-Restricted Logic Programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 267–279. Springer, Heidelberg (2001)

    Google Scholar 

  98. Lierler, Y., Lifschitz, V.: One More Decidable Class of Finitely Ground Programs. In: [152], pp. 489–493

    Google Scholar 

  99. Eiter, T., Ortiz, M., Šimkus, M.: Reasoning Using Knots. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 377–390. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  100. Simkus, M.: Fusion of Logic Programming and Description Logics. In: [152], pp. 551–552

    Google Scholar 

  101. Baselice, S., Bonatti, P.A.: Composing Normal Programs with Function Symbols. In: [150], pp. 425–439

    Google Scholar 

  102. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM 5, 394–397 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  103. Gebser, M., Schaub, T., Thiele, S.: GrinGo: A New Grounder for Answer Set Programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 266–271. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  104. Wittocx, J., Mariën, M., Denecker, M.: GidL: A Grounder for FO+. In: Proceedings of the Twelfth International Workshop on Non-Monotonic Reasoning, pp. 189–198 (2008)

    Google Scholar 

  105. Perri, S., Ricca, F., Sirianni, M.: A Parallel ASP Instantiator Based on DLV. In: DAMP, pp. 73–82. ACM, New York (2010)

    Chapter  Google Scholar 

  106. Beowulf.org: The Beowulf Cluster Site, http://www.beowulf.org

  107. Balduccini, M., Pontelli, E., Elkhatib, O., Le, H.: Issues in Parallel Execution of Non-Monotonic Reasoning Systems. Parallel Computing 31(6), 608–647 (2005)

    Article  Google Scholar 

  108. Grossi, G., Marchi, M., Pontelli, E., Provetti, A.: Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures. J. of Logic and Computation 19(4), 697–715 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  109. Faber, W., Leone, N., Pfeifer, G.: Pushing Goal Derivation in DLP Computations. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 177–191. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  110. Marek, V.W., Subrahmanian, V.: The Relationship between Logic Program Semantics and Non-Monotonic Reasoning. In: ICLP 1989, pp. 600–617. MIT Press, Cambridge (1989)

    Google Scholar 

  111. Baral, C., Gelfond, M.: Logic Programming and Knowledge Representation. JLP (19/20), 73–148 (1994)

    Google Scholar 

  112. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC 2001, pp. 530–535 (2001)

    Google Scholar 

  113. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer Set Programming Based on Propositional Satisfiability. Journal of Automated Reasoning 36(4), 345–377 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  114. Giunchiglia, E., Lierler, Y., Maratea, M.: A SAT-based Polynomial Space Algorithm for Answer Set Programming. In: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 189–196 (2004)

    Google Scholar 

  115. Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, between cmodels and smodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 37–51. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  116. Giunchiglia, E., Leone, N., Maratea, M.: On the Relation among Answer Set Solvers. AMAI 53(1-4), 169–204 (2008)

    MATH  MathSciNet  Google Scholar 

  117. Pontelli, E., El-Khatib, O.: Exploiting Vertical Parallelism from Answer Set Programs. In: Proceedings of the 1st Intl. ASP 2001 Workshop on Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, pp. 174–180 (2001)

    Google Scholar 

  118. Le, H.V., Pontelli, E.: Dynamic Scheduling in Parallel Answer Set Programming Solvers. In: SpringSim (2), SCS/ACM, pp. 367–374 (2007)

    Google Scholar 

  119. Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: Answer Set Programming with Constraints Using Lazy Grounding. In: [152], pp. 115–129

    Google Scholar 

  120. Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: GASP: Answer Set Programming with Lazy Grounding. FI 96(3), 297–322 (2009)

    MATH  Google Scholar 

  121. Terracina, G., Leone, N., Lio, V., Panetta, C.: Experimenting with Recursive Queries in Database and Logic Programming Systems. TPLP 8, 129–165 (2008)

    MATH  MathSciNet  Google Scholar 

  122. Terracina, G., De Francesco, E., Panetta, C., Leone, N.: Enhancing a DLP System for Advanced Database Applications. In: Calvanese, D., Lausen, G. (eds.) RR 2008. LNCS, vol. 5341, pp. 119–134. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  123. Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M.: The Second Answer Set Programming Competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637–654. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  124. Gallucci, L., Ricca, F.: Visual Querying and Application Programming Interface for an ASP-based Ontology Language. In: Proceedings of the Workshop on Software Engineering for Answer Set Programming (SEA 2007), pp. 56–70 (2007)

    Google Scholar 

  125. Grasso, G., Iiritano, S., Leone, N., Lio, V., Ricca, F., Scalise, F.: An ASP-Based System for Team-Building in the Gioia-Tauro Seaport. In: Peña, R. (ed.) PADL 2010. LNCS, vol. 5937, pp. 40–42. Springer, Heidelberg (2010)

    Google Scholar 

  126. Garro, A., Palopoli, L., Ricca, F.: Exploiting Agents in E-Learning and Skills Management Context. AI Communications 19(2), 137–154 (2006)

    MathSciNet  Google Scholar 

  127. Ianni, G., Ricca, F., Panetta, C.: Specification of Assessment-Test Criteria through ASP Specification. In: Answer Set Programming: Advances in Theory and Implementation, Bath, UK, Research Press International, P.O. Box 144, Bristol BS 1YA, pp. 293–302 (2005)

    Google Scholar 

  128. Mileo, A., Merico, D., Bisiani, R.: Non-monotonic Reasoning Supporting Wireless Sensor Networks for Intelligent Monitoring: The SINDI System. In: [151], pp. 585–590

    Google Scholar 

  129. Mileo, A., Merico, D., Bisiani, R.: A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living. In: [150], pp. 145–159

    Google Scholar 

  130. Balduccini, M., Gelfond, M.: Diagnostic reasoning with A-Prolog. TPLP 3, 425–461 (2003)

    MATH  MathSciNet  Google Scholar 

  131. Bisiani, R., Merico, D., Mileo, A., Pinardi, S.: A Logical Approach to Home Healthcare with Intelligent Sensor-Network Support. The Computer Journal (2009); bxn074

    Google Scholar 

  132. Ianni, G., Calimeri, F., Lio, V., Galizia, S.: Reasoning about the Semantic Web using Answer Set Programming. In: APPIA-GULP-PRODE, pp. 324–336 (2003)

    Google Scholar 

  133. Ianni, G., Ricca, F., Calimeri, F., Lio, V., Galizia, S.: An agent system reasoning about the web and the user. In: WWW (Alternate Track Papers & Posters), pp. 492–493 (2004)

    Google Scholar 

  134. Subrahmanian, V., Nau, D., Vago, C.: WFS + Branch and Bound = Stable Models. IEEE TKDE 7(3), 362–377 (1995)

    Google Scholar 

  135. Costantini, S.: Comparing Different Graph Representations of Logic Programs under the Answer Set Semantics. In: Proc. of the AAAI Spring Symposium Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, CA (2001)

    Google Scholar 

  136. Costantini, S., Lanzarone, G.A., Magliocco, G.: Asserting Lemmas in the Stable Model Semantics. In: Logic Programming – Proc. of the 1996 Joint International Conference, USA (1996)

    Google Scholar 

  137. Costantini, S., Intrigila, B., Provetti, A.: Coherence of Updates in Answer Set Programming. In: IJCAI 2003 Workshop on Nonmonotonic Reasoning, Action and Change, NRAC 2003, pp. 66–72 (2003)

    Google Scholar 

  138. Costantini, S.: On the Existence of Stable Models of Non-Stratified Logic Programs. J. on TPLP 6(1-2) (2006)

    Google Scholar 

  139. Costantini, S., Formisano, A., Omodeo, E.G.: Mappings Between Domain Models in Answer Set Programming. In: Answer Set Programming, Advances in Theory and Implementation, Proc. of the 2nd Intl. ASP 2003. CEUR Workshop Proc., vol. 78 (2003)

    Google Scholar 

  140. Capotorti, A., Formisano, A.: Comparative Uncertainty: Theory and Automation. Mathematical Structures in Computer Science 18(1) (2008)

    Google Scholar 

  141. Capotorti, A., Formisano, A., Murador, G.: Qualitative Uncertainty Orderings Revised. Electronic Notes in Theoretical Computer Science 169, 43–59 (2007)

    Article  MathSciNet  Google Scholar 

  142. Capotorti, A., Formisano, A.: Management of Uncertainty Orderings Through ASP. In: Modern Information Processing: From Theory to Applications. Elsevier, Amsterdam (2004) ISBN: 0-444-52075-9

    Google Scholar 

  143. Baselice, S., Bonatti, P.A., Gelfond, M.: Towards an Integration of Answer Set and Constraint Solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52–66. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  144. Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog Decision Support System for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  145. Buccafurri, F., Gottlob, G.: Multiagent compromises, joint fixpoints, and stable models. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 561–585. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  146. Buccafurri, F., Caminiti, G.: A Social Semantics for Multi-agent Systems. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 317–329. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  147. Buccafurri, F., Caminiti, G.: Logic Programming with Social Features. TPLP 8(5–6), 643–690 (2008)

    MATH  MathSciNet  Google Scholar 

  148. Buccafurri, F., Caminiti, G., Laurendi, R.: A Logic Language with Stable Model Semantics for Social Reasoning. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 718–723. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  149. Buccafurri, F., Caminiti, G., Rosaci, D.: Logic Programs with Multiple Chances. In: ECAI, pp. 347–351 (2006)

    Google Scholar 

  150. Garcia de la Banda, M., Pontelli, E. (eds.): ICLP 2008. LNCS, vol. 5366. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  151. Erdem, E., Lin, F., Schaub, T. (eds.): LPNMR 2009. LNCS, vol. 5753, pp. 14–18. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  152. Hill, P.M., Warren, D.S. (eds.): Logic Programming. LNCS, vol. 5649, pp. 14–17. Springer, Heidelberg (2009)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Phisical Sciences - Sec. Informatics, University of Naples “Federico II”, I-80126, Napoli, Italy

    Piero Bonatti

  2. Dept. of Mathematics, University of Calabria, I-87036, Rende (CS), Italy

    Francesco Calimeri, Nicola Leone & Francesco Ricca

Authors
  1. Piero Bonatti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesco Calimeri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicola Leone
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francesco Ricca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dip. di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100, Udine, Italy

    Agostino Dovier

  2. Department of Computer Science, New Mexico State University, P.O. Box 30001, 88003, MSC CS, Las Cruces, NM, USA

    Enrico Pontelli

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bonatti, P., Calimeri, F., Leone, N., Ricca, F. (2010). Answer Set Programming. In: Dovier, A., Pontelli, E. (eds) A 25-Year Perspective on Logic Programming. Lecture Notes in Computer Science, vol 6125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14309-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14309-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14308-3

  • Online ISBN: 978-3-642-14309-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation