Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sequential composition of answer set programs (2104.12156v6)

Published 25 Apr 2021 in cs.AI, cs.DM, cs.LO, and cs.PL

Abstract: This paper contributes to the mathematical foundations of logic programming by introducing and studying the sequential composition of answer set programs. On the semantic side, we show that the immediate consequence operator of a program can be represented via composition, which allows us to compute the least model semantics of Horn programs without any explicit reference to operators. As a result, we can characterize answer sets algebraically, which further provides an algebraic characterization of strong and uniform equivalence which is appealing. This bridges the conceptual gap between the syntax and semantics of an answer set program in a mathematically satisfactory way. The so-obtained algebraization of answer set programming allows us to transfer algebraic concepts into the ASP-setting which we demonstrate by introducing the index and period of an answer set program as an algebraic measure of its cyclicality. The technical part of the paper ends with a brief section introducing the algebraically inspired novel class of aperiodic answer set programs strictly containing the acyclic ones. In a broader sense, this paper is a first step towards an algebra of answer set programs and in the future we plan to lift the methods of this paper to wider classes of programs, most importantly to higher-order and disjunctive programs and extensions thereof.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Antić, C. (2020a). Fixed point semantics for stream reasoning.  Artificial Intelligence, 288, 103370. https://doi.org/10.1016/j.artint.2020.103370.
  2. Antić, C. (2020b). Sequential composition of propositional logic programs.  https://arxiv.org/pdf/2009.05774.pdf.
  3. Antić, C. (2022). Analogical proportions.  Annals of Mathematics and Artificial Intelligence, 90(6), 595–644. https://doi.org/10.1007/s10472-022-09798-y.
  4. Antić, C. (2023). Logic program proportions.  Annals of Mathematics and Artificial Intelligence, accepted. https://arxiv.org/pdf/1809.09938.pdf.
  5. HEX semantics via approximation fixpoint theory.  In Cabalar, P.,  and Son, T. C. (Eds.), LPNMR 2013, pp. 102–115. https://doi.org/10.1007/978-3-642-40564-8_11.
  6. Baral, C. (2003). Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge.
  7. Differential logic programs: Programming methodologies and semantics.  Science of Computer Programming, 27, 217–262.
  8. Answer set programming at a glance.  Communications of the ACM, 54(12), 92–103.
  9. Compositional model-theoretic semantics for logic programs.  New Generation Computing, 11, 1–21.
  10. Meta for modularising logic programming.  In META 1992, pp. 105–119.
  11. Modular logic programming.  ACM Transactions on Programming Languages and Systems, 16(4), 1361–1398.
  12. Fully abstract compositional semantics for an algebra of logic programs.  Theoretical Computer Science, 149(2), 201–229.
  13. Modularity in logic programming.  The Journal of Logic Programming, 19-20(1), 443–502.
  14. HiLog: A foundation for higher-order logic programming.  The Journal of Logic Programming, 15(3), 187–230.
  15. Clark, K. L. (1978). Negation as failure.  In Gallaire, H.,  and Minker, J. (Eds.), Logic and Data Bases, pp. 293–322. Plenum Press, New York.
  16. Modular nonmonotonic logic programming revisited.  In ICLP 2009, LNCS 5649, pp. 145–159. Springer-Verlag, Berlin/Heidelberg.
  17. Approximation fixpoint theory and the semantics of logic and answer set programs.  In Erdem, E., Lee, J., Lierler, Y., and Pearce, D. (Eds.), Correct Reasoning, Vol. 7265 of LNCS, pp. 178–194, Heidelberg. Springer-Verlag.
  18. Ultimate approximation and its application in nonmonotonic knowledge representation systems.  Information and Computation, 192(1), 84–121.
  19. On the decomposition of datalog program mappings.  Theoretical Computer Science, 76(1), 143–177.
  20. Uniform equivalence of logic programs under the stable model semantics.  In ICLP 2003, LNCS 2916, pp. 224–238. Springer-Verlag.
  21. Disjunctive datalog.  ACM Transactions on Database Systems, 22(3), 364–418.
  22. Answer set programming: a primer.  In Reasoning Web. Semantic Technologies for Information Systems, volume 5689 of Lecture Notes in Computer Science, pp. 40–110. Springer, Heidelberg.
  23. Combining answer set programming with description logics for the Semantic Web.  Artificial Intelligence, 172(12-13), 1495–1539.
  24. A uniform integration of higher-order reasoning and external evaluations in answer-set programming.  In Kaelbling, L. P.,  and Saffiotti, A. (Eds.), IJCAI 2005, pp. 90–96.
  25. Recursive aggregates in disjunctive logic programs: semantics and complexity.  In Alferes, J.,  and Leite, J. (Eds.), JELIA 2004, LNCS 3229, pp. 200–212. Springer, Berlin.
  26. Semantics and complexity of recursive aggregates in answer set programming.  Artificial Intelligence, 175(1), 278–298.
  27. Fitting, M. (2002). Fixpoint semantics for logic programming — a survey.  Theoretical Computer Science, 278(1-2), 25–51.
  28. Fully abstract institute of mathematics fully abstract compositional semantics for logic programs.  In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, pp. 134–142. ACM Press.
  29. Conflict-driven answer set solving: from theory to practice.  Artificial Intelligence, 187-188(C), 52–89.
  30. Classical negation in logic programs and disjunctive databases.  New Generation Computing, 9(3-4), 365–385.
  31. Answer set programming based on propositional satisfiability.  Journal of Automated Reasoning, 36(4), 345–377.
  32. Green, J. A. (1951). On the structure of semigroups.  Annals of Mathematics, 54(1), 163–172.
  33. The Gödel Programming Language. The MIT Press.
  34. Krom, M. R. (1967). The decision problem for a class of first-order formulas in which all disjunctions are binary.  Mathematical Logic Quarterly, 13(1-2), 15–20.
  35. The DLV system for knowledge representation and reasoning.  ACM Transactions on Computational Logic, 7(3), 499–562.
  36. Lifschitz, V. (2002). Answer set programming and plan generation.  Artificial Intelligence, 138, 39–54.
  37. Lifschitz, V. (2019). Answer Set Programming. Springer Nature Switzerland AG, Cham, Switzerland.
  38. Strongly equivalent logic programs.  ACM Transactions on Computational Logic, 2(4), 526–541.
  39. Maher, M. J. (1988). Equivalences of logic programs.  In Minker, J. (Ed.), Foundations of Deductive Databases and Logic Programming, chap. 16, pp. 627–658. Morgan Kaufmann Publishers.
  40. An algebra of logic programs.  In Kowalski, R.,  and Bowen, K. A. (Eds.), Proceedings of the 5th International Conference on Logic Programming, pp. 1006–1023. The MIT Press, Cambridge MA.
  41. Stable models and an alternative logic programming paradigm.  In Apt, K. R., Marek, V., Truszczyński, M., and Warren, D. S. (Eds.), The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer, Berlin.
  42. Programming with Higher-Order Logic. Cambridge University Press.
  43. Stable model semantics of weight constraint rules.  In Gelfond, M., Leone, N., and Pfeifer, G. (Eds.), Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 1999), volume 1730 of Lecture Notes in Computer Science, pp. 317–331. Springer-Verlag, Berlin.
  44. Oikarinen, E. (2006). Modular Answer Set Programming. Ph.D. thesis, Helsinki University of Technology, Helsinki, Finland.
  45. Modular equivalence for normal logic programs.  In Brewka, G., Coradeschi, S., Perini, A., and Traverso, P. (Eds.), Proc. 17th European Conference on Artificial Intelligence, pp. 412–416. IOS Press, Amsterdam, Netherlands.
  46. O’Keefe, R. A. (1985). Towards an algebra for constructing logic programs.  In SLP 1985, pp. 152–160.
  47. Pelov, N. (2004). Semantics of Logic Programs with Aggregates. Ph.D. thesis, Katholieke Universiteit Leuven, Leuven.
  48. Well-founded and Stable Semantics of Logic Programs with Aggregates.  Theory and Practice of Logic Programming, 7(3), 301–353.
  49. Extending and implementing the stable model semantics.  Artificial Intelligence, 138, 181–234.
  50. Truszczyński, M. (2006). Strong and uniform equivalence of nonmonotonic theories–an algebraic approach.  Annals of Mathematics and Artificial Intelligence, 48(3-4), 245–265.
  51. The semantics of predicate logic as a programming language.  Journal of the ACM, 23(4), 733–742.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (1)
  1. Christian Antić (20 papers)
Citations (7)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now