Skip to main content
SpringerLink
Log in

My work with Victor Marek: a mathematician looks at answer set programming

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We give a brief retrospective of the work of Marek, Nerode, and Remmel on nonmonotonic logic and answer set programming.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Apt, K.R.: Introduction to logic programming. In: van Leeuvwn, J. (ed.) Handbook of Theoretical Computer Science, pp. 493–574. MIT, Cambridge (1990)

    Google Scholar 

  2. Apt, K., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, San Francisco (1988)

    Google Scholar 

  3. Blair, H.A., Marek, V.W., Remmel, J.B.: Spatial logic programming. In: Proceedings SCI 2001, Orlando, July 2001

  4. Blair, H.A., Marek, V.W., Remmel, J.B., Rivera, A.: Set based logic programming. In: Proceedings of the of the 4-th International Workshop on Computational Logic in Multi-Agent Systems, Lisbon, 29–30 September 2004

  5. Blair, H.A., Marek, V.W., Remmel, J.B.: Set based logic programming. Ann. Math. Artif. Intell. 52, 81–105 (2008)

    Google Scholar 

  6. Babovich, Y., Lifschitz, V.: Cmodels. http://www.cs.utexas.edu/users/tag/cmodels.html (2002)

  7. Cenzer, D., Remmel, J.B.: \(\Pi^0_1\) Classes in Mathematics. In: Ershov, Y., Goncharov, S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol 2., Studies in Logic and the Foundations of Mathematics, vol. 139, pp. 632–822. Elsevier, Amsterdam (1998)

    Chapter  Google Scholar 

  8. Cenzer, D., Remmel, J.B., Vanderbilt, A.: Locally determined logic programs. In: Proceedings of the 6th International Conference on Logic Programming and Nonmontonic Reasoning (LPNMR99), pp. 34–49. Springer-Verlag, Berlin Heidelberg New York (1999)

    Google Scholar 

  9. Cenzer, D., Remmel, J.B., Vanderbilt, A.: Characterizing the set of extensions of a nonmonotic rules with levels. In: Proceeding of the Sixth International Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, 5–7 January 2000

  10. Cenzer, D., Remmel, J.B., Vanderbilt, A.: Locally determined logic programs and recursive stable models. Ann. Math. Artif. Intell. 40, 225–262 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Cenzer, D., Marek, V.W., Remmel, J.B.: Index sets for finite predicate logic programs. In: Eiter, T., Gottlob, G. (eds.) Proceedings of the Federated Logic Conference Workshop on Complexity Theoretic and Recursion Theoretic Methods in Databases, Artificial Intelligence and Finite Model Theory, pp. 72–80 (1999)

  12. Cenzer, D., Marek, V.W., Remmel, J.B.: Logic programming with infinite sets. Ann. Artif. Intell. Math. 44, 309–339 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Doyle, J.: A truth maintenance system. Artif. Intell. J. 12, 231–272 (1979)

    Article  MathSciNet  Google Scholar 

  14. Ershov, Y., Goncharov, S., Nerode, A., Remmel, J.B. (eds.): Handbook of Recursive Mathematics, vol. 1, Recursive Model Theory, Studies in Logic and the Foundations of Mathematics, vol. 138, 620 pp. Elsevier, Amsterdam (1998)

    MATH  Google Scholar 

  15. Ershov, Y., Goncharov, S., Nerode, A., Remmel, J.B. (eds.): Handbook of Recursive Mathematics, vol. 2, Recursive Algebra, Analysis and Combinatorics, Studies in Logic and the Foundations of Mathematics, vol. 139, 750 pp. Elsevier, Amsterdam (1998)

    MATH  Google Scholar 

  16. Gelfond, M., Lifschitz, V.: Stable semantics for logic programs. In: Proceedings of 5th International Symposium Conference on Logic Programming, Seattle (1988)

  17. Gelfond, M., Lifschitz, V.: Logic programming with classical negation. In: Logic Programming. MIT, Cambridge (1990)

    Google Scholar 

  18. Halpern, J.Y., Moses, Y.O.: Knowledge and common knowledge in a distributed environment. In: Proceedings of 3rd ACM Conference on the Principles of Distributed Computing, pp. 50–61 (1984)

  19. Hintikka, J.: Knowledge and Belief. Cornell University Press, Ithaca (1962)

    Google Scholar 

  20. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7, 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  21. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. In: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), pp. 112–117. AAAI, Menlo Park (2002)

    Google Scholar 

  22. Marek, W., Nerode, A., Remmel, J.B.: A theory of nonmonotonic rule systems I. Ann. Math. Artif. Intell. 1, 105–135 (1990)

    Google Scholar 

  23. Marek, W., Nerode, A., Remmel, J.B.: A theory of nonmonotonic rule systems II. Ann. Math. Artif. Intell. 5, 229–264 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  24. Marek, W., Nerode, A., Remmel, J.B.: How complicated is the set of stable models of a recursive logic program? Ann. Pure Appl. Logic 56, 119–136 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  25. Marek, W., Nerode, A., Remmel, J.B.: The stable models of a predicate logic program. In: Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, pp. 446–462. MIT, Cambridge (1992)

    Google Scholar 

  26. Marek, W., Nerode, A., Remmel, J.B.: A context for belief revision: Normal nonmonotonic programs. In: Proceedings of a Workshop on Defeasible Reasoning and Constraint Solving at International Logic Programming Symposium, San Diego (1992)

  27. Marek, W., Nerode, A., Remmel, J.B.: The stable models of a predicate logic program. J. Log. Program. 21, 129–154 (1994)

    MATH  MathSciNet  Google Scholar 

  28. Marek, W., Nerode, A., Remmel, J.B.: On logical constraints in logic programming. In: Logic Programming and Nonmonotonic Reasoning: Third International Conference, LPNMR’95, Lecture Notes in Computer Science 928, pp. 43–56. Springer, Berlin Heidelberg New York (1995)

    Google Scholar 

  29. Marek, W., Nerode, A., Remmel, J.B.: Complexity of normal default logic and related modes of nonmonotonic reasoning. In: Proceedings of the 10-th Annual Symposium of Logic in Computer Science, pp. 178–187. IEEE Computer Society Press, Silver Spring (1995)

    Google Scholar 

  30. Marek, W., Nerode, A., Remmel, J.B.: On the complexity of abduction. In: Proceedings of the 11-th Annual Symposium of Logic in Computer Science, pp. 513–522. IEEE Computer Society Press, Silver Spring (1995)

    Google Scholar 

  31. Marek, W., Nerode, A., Remmel, J.B.: Basic forward chaining construction for logic programs Lecture Notes in Computer Science 1234. In: Logical Foundations for Computer Science’97, Logic at Yaroslavl, pp. 214–225. Springer, Berlin Heidelberg New York (1997)

    Google Scholar 

  32. Marek, W., Nerode, A., Remmel, J.B.: Nonmonotonic rule systems with recursive sets of restraints. Arch. Math. Log. 36, 339–384 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  33. Marek, W., Nerode, A., Remmel, J.B.: Complexity of recursive normal default logic. Fundam. Inform. 32, 139–148 (1997)

    MATH  MathSciNet  Google Scholar 

  34. Marek, W., Nerode, A., Remmel, J.B.: Logic programs, well orderings, and forward chaining. Ann. Pure Appl. Logic 96, 231–276 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  35. Marek, W., Remmel, J.B.: On the foundations of answer set programming. In: Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, Papers from the AAAI Spring Symposium, Stanford, CA, 26–28 March 2001, AAAI Technical Report SS-01-01, pp. 124–131. AAAI, Menlo Park (2001)

    Google Scholar 

  36. Marek, W., Remmel, J.B.: On logic programs with cardinality constraints. In: Proceedings of 9-th International Workshop on Nonmonotonic Reasoning, pp. 219–228, Toulouse , 19–21 April 2002

  37. Marek, W., Remmel, J.B.: On the expressibility of stable logic programming. Theory Pract. Log. Program. 3, 551–567 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  38. Marek, W., Remmel, J.B.: Answer set programing with default logic. In: Proceedings of 10th International Workshop on Non-monotonic Reasoning, pp. 276–284, Whistler, June 2004

  39. Marek, V.W., Remmel, J.B.: Set constraints in logic programming. In: Proceedings of LPNMR04, Springer Lecture Notes in Computer Science 2923, pp. 154–167. Springer, Berlin Heidelberg New York (2004)

    Google Scholar 

  40. Marek, V.W., Remmel, J.B.: Compactness properties for stable semantics of logic programs. In: Logical Foundations of Computer Science, LFCS 2007, Springer Lecture Notes in Computer Science, 4514, pp. 379-400. Springer, Berlin Heidelberg New York (2007)

    Chapter  Google Scholar 

  41. Marek, V.W., Remmel, J.B.: Compactness properties for stable semantics of logic programs, Fundam. Inform. 81, 211–239 (2007)

    MATH  MathSciNet  Google Scholar 

  42. Marek, V.W., Remmel, J.B.: On the continuity of the Gelfond-Lifshitz and other applications of proof theory in ASP. In: Proceedings of the International Conference on Logic Programming, Udine, December 2008

  43. Marek, V.W., Remmel, J.B.: Automata and answer set programming. In: Proceedings of Logical Foundations of Computer Science, Deerfield Beach, 3–6 January 2009

  44. Marek, W., Truszczyński, M.: Relating autoepistemic and default logics. In: Principles of Knowledge Representation and Reasoning, Toronto, 15–18 May 1989

  45. McCarthy, J.: Circumscription—a form of nonmonotonic reasoning. Artif. Intell. J. 13, 27–39 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  46. Moore, R.C.: Semantical considerations on non-monotonic logic. Artif. Intell. J. 25, 75–94 (1985)

    Article  MATH  Google Scholar 

  47. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241–273 (1999)

    Article  MATH  Google Scholar 

  48. Niemelä, I., Simons, P.: Extending Smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491–521. Kluwer Academic, Dordrecht (2000)

    Google Scholar 

  49. Niemelä, I., Simons, P., Soininen, T.: Stable model semantics of weight constraint rules. In: Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning, Springer Lecture Notes in Computer Science 1730. Springer, Berlin Heidelberg New York (1999)

    Google Scholar 

  50. Pollett, C., Remmel, J.B.: Nonmonotonic reasoning with quantified boolean constraints. In: Proceedings of the Logic Programming and Nonmonotonic Reasoning, LPNMR-97, pp. 18–39, Dagstuhl Castle, 28–31 July 1997

  51. Reiter, R.: A logic for default reasoning. Artif. Intell. J. 13, 81–132 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  52. Simons, P., Niemelä, I., Soininen, T: Extending and implementing stable semantics of logic programs. Artif. Intell. J. 138, 181–234 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Mathematics and Computer Science, University of California at San Diego, La Jolla, CA, 92903, USA

    Jeffrey B. Remmel

Authors
  1. Jeffrey B. Remmel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jeffrey B. Remmel.

Additional information

Dedicated to my good friend and colleague, Victor Marek, on the occasion of his 65th birthday.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Remmel, J.B. My work with Victor Marek: a mathematician looks at answer set programming. Ann Math Artif Intell 53, 5–16 (2008). https://doi.org/10.1007/s10472-009-9107-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-009-9107-z

Keywords

Mathematics Subject Classifications (2000)

Search

Navigation