Skip to main content

Answer Set Programming

  • Chapter

Part of the Lecture Notes in Computer Science book series (LNISA,volume 8067)

Abstract

Answer Set Programming (ASP) evolved from various fields such as Logic Programming, Deductive Databases, Knowledge Representation, and Nonmonotonic Reasoning, and serves as a flexible language for declarative problem solving. There are two main tasks in problem solving, representation and reasoning, which are clearly separated in the declarative paradigm. In ASP, representation is done using a rule-based language, while reasoning is performed using implementations of general-purpose algorithms, referred to as ASP solvers. Rules in ASP are interpreted according to common sense principles, including a variant of the closed-world-assumption (CWA) and the unique-name-assumption (UNA). Collections of ASP rules are referred to as ASP programs, which represent the modelled knowledge. To each ASP program a collection of answer sets, or intended models, is associated, which stand for the solutions to the modelled problem; this collection can also be empty, meaning that the modelled problem does not admit a solution. Several reasoning tasks exist: the classical ASP task is enumerating all answer sets or determining whether an answer set exists, but ASP also allows for query answering in brave or cautious modes. This article provides an introduction to the field, starting with historical perspectives, followed by a definition of the core language, a guideline to knowledge representation, an overview of existing ASP solvers, and a panorama of current research topics in the field.

Keywords

  • Logic Program
  • Logic Programming
  • Travel Salesman Problem
  • Weak Constraint
  • Query Answering

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-39784-4_4
  • Chapter length: 32 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   39.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-39784-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   54.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. McCarthy, J.: Programs with Common Sense. In: Proceedings of the Teddington Conference on the Mechanization of Thought Processes, Her Majesty’s Stationery Office, pp. 75–91 (1959)

    Google Scholar 

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

    Google Scholar 

  3. Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press (2008)

    Google Scholar 

  4. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)

    Google Scholar 

  5. Colmerauer, A., Roussel, P.: The Birth of Prolog. ACM, New York (1996)

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  7. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)

    CrossRef  MATH  Google Scholar 

  8. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)

    Google Scholar 

  9. Gelfond, M., Leone, N.: Logic Programming and Knowledge Representation – the A-Prolog perspective. Artificial Intelligence 138(1-2), 3–38 (2002)

    MathSciNet  CrossRef  MATH  Google Scholar 

  10. Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press (1998)

    Google Scholar 

  11. Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive Logic Programming. Journal of Logic and Computation 2(6), 719–770 (1992)

    MathSciNet  CrossRef  MATH  Google Scholar 

  12. McCarthy, J., Hayes, P.J.: Some Philosophical Problems from the Standpoint of Artificial Intelligence. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 4, pp. 463–502. Edinburgh University Press (1969) reprinted in [140]

    Google Scholar 

  13. Robinson, J.A.: A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM 12(1), 23–41 (1965)

    MathSciNet  CrossRef  MATH  Google Scholar 

  14. Kowalski, R.A.: Predicate Logic as Programming Language. In: IFIP Congress, pp. 569–574 (1974)

    Google Scholar 

  15. Kowalski, R.A.: Algorithm = Logic + Control. Communications of the ACM 22(7), 424–436 (1979)

    CrossRef  MATH  Google Scholar 

  16. International Organization for Standardization: ISO/IEC 13211-1:1995: Information technology — Programming languages — Prolog — Part 1: General core. International Organization for Standardization, Geneva, Switzerland (1995)

    Google Scholar 

  17. van Emden, M.H., Kowalski, R.A.: The Semantics of Predicate Logic as a Programming Language. Journal of the ACM 23(4), 733–742 (1976)

    MathSciNet  CrossRef  MATH  Google Scholar 

  18. Clark, K.L.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)

    CrossRef  Google Scholar 

  19. Reiter, R.: On Closed World Data Bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 55–76. Plenum Press, New York (1978)

    CrossRef  Google Scholar 

  20. Apt, K.R., Blair, H.A., Walker, A.: Towards a Theory of Declarative Knowledge. In: [141], pp. 89–148

    Google Scholar 

  21. Van Gelder, A.: Negation as Failure Using Tight Derivations for General Logic Programs. In: [141], pp. 1149–1176

    Google Scholar 

  22. Van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded Sets and Well-Founded Semantics for General Logic Programs. In: Proceedings of the Seventh Symposium on Principles of Database Systems (PODS 1988), pp. 221–230 (1988)

    Google Scholar 

  23. Marek, V.W., Truszczyński, M.: Nonmonotonic Logics – Context-Dependent Reasoning. Springer (1993)

    Google Scholar 

  24. Gelfond, M.: On Stratified Autoepistemic Theories. In: Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI 1987), pp. 207–211 (1987)

    Google Scholar 

  25. Bidoit, N., Froidevaux, C.: Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming. In: Proceedings of the Symposium on Logic in Computer Science (LICS 1987), pp. 89–97. IEEE (June 1987)

    Google Scholar 

  26. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Logic Programming: Proceedings Fifth Intl Conference and Symposium, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  28. Minker, J.: On Indefinite Data Bases and the Closed World Assumption. In: Loveland, D.W. (ed.) CADE 1982. LNCS, vol. 138, pp. 292–308. Springer, Heidelberg (1982)

    CrossRef  Google Scholar 

  29. Yahya, A.H., Henschen, L.J.: Deduction in Non-Horn Databases. Journal of Automated Reasoning 1(2), 141–160 (1985)

    MathSciNet  CrossRef  MATH  Google Scholar 

  30. Przymusinski, T.C.: Stable Semantics for Disjunctive Programs. New Generation Computing 9, 401–424 (1991)

    CrossRef  MATH  Google Scholar 

  31. Wang, K., Zhou, L.: Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic 6(2) (April 2005)

    Google Scholar 

  32. Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence 12, 53–87 (1994)

    MathSciNet  CrossRef  MATH  Google Scholar 

  33. Dix, J., Gottlob, G., Marek, V.W.: Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. Fundamenta Informaticae 28, 87–100 (1996) (This is a full version of [142])

    MathSciNet  MATH  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)

    MathSciNet  CrossRef  MATH  Google Scholar 

  35. Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)

    MathSciNet  CrossRef  Google Scholar 

  36. Pearce, D.: Equilibrium logic. Annals of Mathematics and Artificial Intelligence 47(1-2), 3–41 (2006)

    MathSciNet  CrossRef  MATH  Google Scholar 

  37. Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-Mathematische Klasse, 42–56 (1930)

    Google Scholar 

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

    CrossRef  Google Scholar 

  39. Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175(1), 278–298 (2011); Special Issue: John McCarthy’s Legacy

    MathSciNet  CrossRef  MATH  Google Scholar 

  40. Lifschitz, V.: Twelve definitions of a stable model. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 37–51. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  41. Buccafurri, F., Leone, N., Rullo, P.: Enhancing Disjunctive Datalog by Constraints. IEEE Transactions on Knowledge and Data Engineering 12(5), 845–860 (2000)

    CrossRef  Google Scholar 

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

    MathSciNet  CrossRef  Google Scholar 

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

    MathSciNet  CrossRef  MATH  Google Scholar 

  44. Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining Answer Set Programming with Description Logics for the Semantic Web. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004), Whistler, Canada, pp. 141–151 (2004); Extended Report RR-1843-03-13, Institut für Informationssysteme, TU Wien (2003)

    Google Scholar 

  45. 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 2005), pp. 406–411 (August 2005)

    Google Scholar 

  46. Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: 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), Acapulco, Mexico, pp. 847–852. Morgan Kaufmann Publishers (August 2003)

    Google Scholar 

  47. 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, pp. 212–226. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  49. Hella, L., Libkin, L., Nurmonen, J., Wong, L.: Logics with aggregate operators. Journal of the ACM 48(4), 880–907 (2001)

    MathSciNet  CrossRef  MATH  Google Scholar 

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

    MathSciNet  CrossRef  MATH  Google Scholar 

  51. 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 

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

    CrossRef  Google Scholar 

  53. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable Functions in ASP: Theory and Implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407–424. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  54. Lierler, Y., Lifschitz, V.: One More Decidable Class of Finitely Ground Programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 489–493. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  55. Š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)

    CrossRef  Google Scholar 

  56. Eiter, T., Simkus, M.: Bidirectional Answer Set Programs with Function Symbols. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, CA, USA, pp. 765–771 (July 2009)

    Google Scholar 

  57. Lin, F., Wang, Y.: Answer Set Programming with Functions. In: Proceedings of Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), Sydney, Australia, pp. 454–465. AAAI Press (September 2008)

    Google Scholar 

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

    CrossRef  Google Scholar 

  59. Bonatti, P.A.: Reasoning with infinite stable models. Artificial Intelligence 156(1), 75–111 (2004)

    MathSciNet  CrossRef  MATH  Google Scholar 

  60. Baselice, S., Bonatti, P.A., Criscuolo, G.: On Finitely Recursive Programs. Theory and Practice of Logic Programming 9(2), 213–238 (2009)

    MathSciNet  CrossRef  MATH  Google Scholar 

  61. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 71–86. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  62. Alviano, M., Faber, W., Leone, N.: Disjunctive asp with functions: Decidable queries and effective computation. In: Theory and Practice of Logic Programming, 26th Int’l. Conference on Logic Programming (ICLP 2010) (2010); Special Issue 10(4-6), 497–512 (2010)

    Google Scholar 

  63. Cabalar, P.: Partial Functions and Equality in Answer Set Programming. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 392–406. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  64. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Brewka, G., Lang, J. (eds.) Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 70–80. AAAI Press (2008)

    Google Scholar 

  65. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theoretical Computer Science 336(1), 89–124 (2005)

    MathSciNet  CrossRef  MATH  Google Scholar 

  66. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. Proceedings of the VLDB Endowment 3(1), 554–565 (2010)

    CrossRef  Google Scholar 

  67. Calì, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: The query answering problem. Artificial Intelligence 193, 87–128 (2012)

    MathSciNet  CrossRef  MATH  Google Scholar 

  68. Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable datalog ∃  programs. In: Brewka, G., Eiter, T., McIlraith, S. (eds.) Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012). AAAI Press (2012)

    Google Scholar 

  69. Alviano, M., Faber, W., Leone, N., Manna, M.: Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues. In: Theory and Practice of Logic Programming, 28th Int’l. Conference on Logic Programming (ICLP 2012) (2012); Special Issue 12(4-5), 701–718 (July 2012)

    Google Scholar 

  70. Gottlob, G., Manna, M., Morak, M., Pieris, A.: On the complexity of ontological reasoning under disjunctive existential rules. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 1–18. Springer, Heidelberg (2012)

    CrossRef  Google Scholar 

  71. Pierre Bourhis, M.M., Pieris, A.: The impact of disjunction on ontological query answering under guarded-based existential rules. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013) (2013)

    Google Scholar 

  72. Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 963–968 (2011)

    Google Scholar 

  73. Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. Journal of Web Semantics 14, 57–83 (2012)

    CrossRef  Google Scholar 

  74. Pearce, D., Valverde, A.: Quantified equilibrium logic and foundations for answer set programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 546–560. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  75. Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119–131. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  76. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 372–379 (January 2007)

    Google Scholar 

  77. Brewka, G.: Answer Sets: From Constraint Programming Towards Qualitative Optimization. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 34–46. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  78. Delgrande, J.P., Schaub, T., Tompits, H.: A Framework for Compiling Preferences in Logic Programs. Theory and Practice of Logic Programming 3(2), 129–187 (2003)

    MathSciNet  CrossRef  MATH  Google Scholar 

  79. Brewka, G., Eiter, T.: Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109(1-2), 297–356 (1999)

    MathSciNet  CrossRef  MATH  Google Scholar 

  80. Wang, K., Zhou, L., Lin, F.: Alternating Fixpoint Theory for Logic Programs with Priority. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 164–178. Springer, Heidelberg (2000)

    CrossRef  Google Scholar 

  81. Schaub, T., Wang, K.: A Comparative Study of Logic Programs with Preference. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA, USA, pp. 597–602. Morgan Kaufmann Publishers (August 2001)

    Google Scholar 

  82. Brewka, G.: Logic Programming with Ordered Disjunction. In: Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), pp. 67–76 (April 2002)

    Google Scholar 

  83. Brewka, G., Niemelä, I., Truszczyński, M.: Answer Set Optimization. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico, pp. 867–872. Morgan Kaufmann (August 2003)

    Google Scholar 

  84. Balduccini, M., Gelfond, M.: Logic Programs with Consistency-Restoring Rules. In: Doherty, P., McCarthy, J., Williams, M. (eds.) International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series (2003)

    Google Scholar 

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

    MathSciNet  CrossRef  MATH  Google Scholar 

  86. Dimopoulos, Y., Kakas, A.C., Michael, L.: Reasoning About Actions and Change in Answer Set Programming Programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 61–73. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  87. Perri, S., Scarcello, F., Leone, N.: Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation. Theory and Practice of Logic Programming 5(1-2), 123–159 (2005)

    MathSciNet  CrossRef  MATH  Google Scholar 

  88. Mariën, M., Gilis, D., Denecker, M.: On the Relation Between ID-Logic and Answer Set Programming. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 108–120. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  89. Ricca, F., Leone, N.: Disjunctive Logic Programming with types and objects: The DLV +  System. Journal of Applied Logics 5(3), 545–573 (2007)

    MathSciNet  CrossRef  MATH  Google Scholar 

  90. Heymans, S., Van Nieuwenborgh, D., Hadavandi, E.: Semantic web reasoning with conceptual logic programs. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 113–127. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    CrossRef  Google Scholar 

  94. Pearce, D., Tompits, H., Woltran, S.: Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 306–320. Springer, Heidelberg (2001)

    Google Scholar 

  95. Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. In: Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002) (2002)

    Google Scholar 

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

    Google Scholar 

  97. Niemelä, I., Simons, P.: Smodels – An Implementation of the Stable Model and Well-founded Semantics for Normal Logic Programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265, pp. 420–429. Springer, Heidelberg (1997)

    CrossRef  Google Scholar 

  98. Syrjänen, T.: Lparse 1.0 User’s Manual (2002), http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz

  99. Radziszowski, S.P.: Small Ramsey Numbers. The Electronic Journal of Combinatorics 1 (1994) (revision 9: July 15, 2002)

    Google Scholar 

  100. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)

    Google Scholar 

  101. Cadoli, M., Eiter, T., Gottlob, G.: Default Logic as a Query Language. IEEE Transactions on Knowledge and Data Engineering 9(3), 448–463 (1997)

    CrossRef  Google Scholar 

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

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

  104. Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 2002), Edmonton, Alberta, Canada. AAAI Press/MIT Press (2002)

    Google Scholar 

  105. 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

  106. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386–392. Morgan Kaufmann Publishers (January 2007)

    Google Scholar 

  107. Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.H.: Unfolding Partiality and Disjunctions in Stable Model Semantics. Technical Report cs.AI/0303009, arXiv.org (March 2003)

    Google Scholar 

  108. Lierler, Y.: cmodels – SAT-Based Disjunctive Answer Set Solver. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 447–451. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

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

    Google Scholar 

  110. Greco, S.: Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries. IEEE Transactions on Knowledge and Data Engineering 15(2), 368–385 (2003)

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  112. Faber, W., Greco, G., Leone, N.: Magic sets and their application to data integration. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 306–320. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  113. Faber, W., Greco, G., Leone, N.: Magic Sets and their Application to Data Integration. Journal of Computer and System Sciences 73(4), 584–609 (2007)

    MathSciNet  CrossRef  MATH  Google Scholar 

  114. Alviano, M., Faber, W., Greco, G., Leone, N.: Magic sets for disjunctive datalog programs. Artificial Intelligence 187-187, 156–192 (2012)

    Google Scholar 

  115. Alviano, M., Faber, W.: Dynamic magic sets and super-coherent answer set programs. AI Communications – The European Journal on Artificial Intelligence 24(2), 125–145 (2011)

    MathSciNet  MATH  Google Scholar 

  116. Hustadt, U., Motik, B., Sattler, U.: Reducing SHIQ-description logic to disjunctive datalog programs. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR 2004), Whistler, Canada, pp. 152–162 (2004)

    Google Scholar 

  117. Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics by a reduction to disjunctive datalog. Journal of Automated Reasoning 39(3), 351–384 (2007)

    MathSciNet  CrossRef  MATH  Google Scholar 

  118. 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: Proceedings of the 24th ACM SIGMOD International Conference on Management of Data (SIGMOD 2005), Baltimore, Maryland, USA, pp. 915–917. ACM Press (June 2005)

    Google Scholar 

  119. Lembo, D., Lenzerini, M., Rosati, R.: Source Inconsistency and Incompleteness in Data Integration. In: Proceedings of the Knowledge Representation meets Databases International Workshop (KRDB 2002), Toulouse France, CEUR Electronic Workshop Proceedings (2002), http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-54/

  120. Lembo, D., Lenzerini, M., Rosati, R.: Integrating Inconsistent and Incomplete Data Sources. In: Proceedings of SEBD 2002, Portoferraio, Isola d’Elba, pp. 299–308 (2002)

    Google Scholar 

  121. Soininen, T., Niemelä, I.: Developing a Declarative Rule Language for Applications in Product Configuration. In: Gupta, G. (ed.) PADL 1999. LNCS, vol. 1551, pp. 305–319. Springer, Heidelberg (1999)

    CrossRef  Google Scholar 

  122. A Rule-Based Formal Model for Software Configuration. Technical Report A55, Digital Systems Laboratory, Department of Computer Science, Helsinki University of Technology, Espoo, Finland (1999)

    Google Scholar 

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

    Google Scholar 

  124. Cumbo, C., Iiritano, S., Rullo, P.: Reasoning-Based Knowledge Extraction for Text Classification. In: Proceedings of Discovery Science, 7th International Conference, Padova, Italy, pp. 380–387 (October 2004)

    Google Scholar 

  125. Curia, R., Ettorre, M., Gallucci, L., Iiritano, S., Rullo, P.: Textual Document Pre-Processing and Feature Extraction in OLEX. In: Proceedings of Data Mining 2005, Skiathos, Greece (2005)

    Google Scholar 

  126. Aiello, L.C., Massacci, F.: Verifying security protocols as planning in logic programming. ACM Transactions on Computational Logic 2(4), 542–580 (2001)

    MathSciNet  CrossRef  Google Scholar 

  127. Baral, C., Uyan, C.: Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 186–199. Springer, Heidelberg (2001)

    Google Scholar 

  128. Faber, W., Leone, N., Pfeifer, G.: Representing School Timetabling in a Disjunctive Logic Programming Language. In: Egly, U., Tompits, H. (eds.) Proceedings of the 13th Workshop on Logic Programming (WLP 1998), Vienna, Austria, pp. 43–52 (October 1998)

    Google Scholar 

  129. Bertino, E., Mileo, A., Provetti, A.: User Preferences VS Minimality in PPDL. In: Buccafurri, F. (ed.): Proceedings of the Joint Conference on Declarative Programming APPIA-GULP-PRODE 2003, pp. 110–122 (September 2003)

    Google Scholar 

  130. Greco, G., Guzzo, A., Saccà, D.: A Logic Programming Approach for Planning Workflows Evolutions. In: Buccafurri, F. (ed.): Proceedings of the Joint Conference on Declarative Programming APPIA-GULP-PRODE 2003, pp. 75–85 (September 2003)

    Google Scholar 

  131. Greco, G., Greco, S., Zumpano, E.: A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE Transactions on Knowledge and Data Engineering 15(6), 1389–1408 (2003)

    CrossRef  Google Scholar 

  132. Erdem, E., Lifschitz, V., Nakhleh, L., Ringe, D.: Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming. In: Dahl, V. (ed.) PADL 2003. LNCS, vol. 2562, pp. 160–176. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  134. Costantini, S., Tocchio, A.: The DALI logic programming agent-oriented language. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 685–688. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  135. Garro, A., Palopoli, L., Ricca, F.: Exploiting agents in e-learning and skills management context. AI Communications – The European Journal on Artificial Intelligence 19(2), 137–154 (2006)

    MathSciNet  Google Scholar 

  136. De Vos, M., Schaub, T. (eds.): SEA 2007: Software Engineering for Answer Set Programming, vol. 281. CEUR (2007), http://CEUR-WS.org/Vol-281/

  137. Brain, M., De Vos, M.: Debugging Logic Programs under the Answer Set Semantics. In: de Vos, M., Provetti, A. (eds.) Proceedings ASP 2005 - Answer Set Programming: Advances in Theory and Implementation, Bath, UK (July 2005)

    Google Scholar 

  138. El-Khatib, O., Pontelli, E., Son, T.C.: Justification and debugging of answer set programs in ASP. In: Jeffery, C., Choi, J.D., Lencevicius, R. (eds.) Proceedings of the Sixth International Workshop on Automated Debugging, California, USA, ACM (September 2005)

    Google Scholar 

  139. Ricca, F.: The DLV Java Wrapper. In: de Vos, M., Provetti, A. (eds.) Proceedings ASP 2003 - Answer Set Programming: Advances in Theory and Implementation, Messina, Italy, pp. 305–316 (September 2003), http://CEUR-WS.org/Vol-78/

  140. McCarthy, J.: Formalization of Common Sense, papers by John McCarthy, edited by V. Lifschitz. Ablex (1990)

    Google Scholar 

  141. Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, Inc., Washington, DC (1988)

    Google Scholar 

  142. Dix, J., Gottlob, G., Marek, V.W.: Causal Models for Disjunctive Logic Programs. In: Van Hentenryck, P. (ed.) Proceedings of the 11th International Conference on Logic Programming (ICLP 1994), Santa Margherita Ligure, Italy, pp. 290–302. MIT Press (June 1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Faber, W. (2013). Answer Set Programming. In: Rudolph, S., Gottlob, G., Horrocks, I., van Harmelen, F. (eds) Reasoning Web. Semantic Technologies for Intelligent Data Access. Reasoning Web 2013. Lecture Notes in Computer Science, vol 8067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39784-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39784-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39783-7

  • Online ISBN: 978-3-642-39784-4

  • eBook Packages: Computer ScienceComputer Science (R0)