Skip to main content
SpringerLink
Log in

Equational Properties of Stratified Least Fixed Points (Extended Abstract)

  • Conference paper
  • First Online:
Logic, Language, Information, and Computation (WoLLIC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9160))

Abstract

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between ‘stratified complete lattices’ and used to give semantics to logic programs with negation and boolean context-free grammars. We prove that this new operation satisfies ‘the standard’ identities of fixed point operations as described by the axioms of iteration theories.

Partially supported by grant no. ANN 110883 from the National Foundation of Hungary for Scientific Research.

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 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

References

  1. Barr, M., Wells, C.: Category Theory for Computing Science, 2nd edn. Prentice Hall, London (1995)

    Google Scholar 

  2. Bekić,H.: Definable operation in general algebras, and the theory of automata and flowcharts. IBM Technical report, Vienna, 1969. Reprinted. In: Programming Languages and Their Definition. LNCS, vol. 177, pp. 30–55. Springer, Heidelberg (1984)

    Google Scholar 

  3. Bloom, S.L., Ésik, Z.: Equational logic of circular data type specification. Theoret. Comput. Sci. 63(3), 303–331 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bloom, S.L., Ésik, Z.: Iteration Theories. The Equational Logic of Iterative Processes. EATCS Monographs in Theoretical Computer Science. Springer, Berlin (1993)

    MATH  Google Scholar 

  5. Bloom, S.L., Ésik, Z.: Fixed-point operators on ccc’s. part I. Theoret. Comput. Sci. 155, 1–38 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Charalambidis, A., Ésik, Z., Rondogiannis, P.: Minimum model semantics for extensional higher-order logic programming with negation. Theory Pract. Logic Program. 14, 725–737 (2014)

    Article  MATH  Google Scholar 

  7. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  8. Denecker, M., Marek, V.W., Truszczyński, M.: Approximations, stable operations, well-founded fixed points and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 127–144. Kluwer, Boston (2000)

    Chapter  Google Scholar 

  9. Denecker, M., Marek, V.W., Truszczyński, M.: Ultimate approximation and its applications in nonmonotonic knowledge representation systems. Inf. Comput. 192, 21–84 (2004)

    Article  Google Scholar 

  10. Elgot, C.C.: Monadic computation and iterative algebraic theories. In: Rose, H.E., Shepherdson, J.C. (eds.) Logic Colloquium 1973, Studies in Logic and the Foundations of Mathematics, vol. 80, pp. 175–230. North Holand, Amsterdam (1975)

    Google Scholar 

  11. Ésik, Z.: Identities in iterative and rational algebraic theories. Comput. Linguist. Comput. Lang. XIV, 183–207 (1980)

    Google Scholar 

  12. Ésik, Z.: Completeness of park induction. Theoret. Comput. Sci. 177, 217–283 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ésik, Z.: Group axioms for iteration. Inf. Comput. 148, 131–180 (1999)

    Article  MATH  Google Scholar 

  14. Ésik, Z.: Axiomatizing iteration categories. Acta Cybernetica 14, 65–82 (1999)

    MathSciNet  MATH  Google Scholar 

  15. Ésik, Z.: Equational axioms associated with finite automata for fixed point operations in cartesian categories. Mathematical Structures in Computer Science (to appear) (see also arXiv:1501.02190)

  16. Ésik, Z.: Equational properties of stratified least fixed points. arXiv:1410.8111

  17. Ésik, Z., Labella, A.: Equational properties of iteration in algebraically complete categories. Theoret. Comput. Sci. 195, 61–89 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ésik, Z., Rondogiannis, P.: A fixed-point theorem for non-monotonic functions. Theoretical Computer Science (to appear) (see also: arXiv:1402.0299)

  19. Ésik, Z., Rondogiannis, P.: Theorems on pre-fixed points of non-monotonic functions with applications in logic programming and formal grammars. In: Kohlenbach, U., Barceló, P., de Queiroz, R. (eds.) WoLLIC. LNCS, vol. 8652, pp. 166–180. Springer, Heidelberg (2014)

    Google Scholar 

  20. Fitting, M.: Fixed point semantics for logic programming. A survey. Theoret. Comput. Sci. 278, 25–51 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. van Gelder, A.V.: The alternating fixpoint of logic programs with negation. J. Comput. Syst. Sci. 47, 185–221 (1993)

    Article  MATH  Google Scholar 

  22. Przymusinski, T.C.: Every logic program has a natural stratification and an iterated least fixed point model. In: Proceedings of Eight ACM Symposium. Principles of Database Systems, pp.11–21 (1989)

    Google Scholar 

  23. Rondogiannis, R., Wadge, W.W.: Minimum model semantics for logic programs with negation. ACM Trans. Comput. Logic 6, 441–467 (2005)

    Article  MathSciNet  Google Scholar 

  24. Scott, D., De Bakker, J.W.: A theory of programs. IBM Technical report, Vienna (1969)

    Google Scholar 

  25. Simpson, A.K., Plotkin, G.D.: Complete axioms for categorical fixed-point operators. In: Proceedings of 15th Annual IEEE Symposium on Logic in Computer Science, LICS 2000, pp. 30–41. IEEE (2000)

    Google Scholar 

  26. Tarski, A.: A lattice-theoretical fixed point theorem and its applications. Pac. J. Math. 5, 285–309 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  27. van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. Assoc. Comput. Mach. 23, 733–742 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  28. Vennekens, J., Gilis, D., Denecker, M.: Splitting an operation: algebraic modularity results for logics with fixed point semantics. ACM Trans. Comput. Logic 7, 765–797 (2006)

    Article  MathSciNet  Google Scholar 

  29. Wright, J.B., Thatcher, J.W., Wagner, E.G., Goguen, J.A.: Rational algebraic theories and fixed-point solutions. In: 17th Annual Symposium on Foundations of Computer Science, FOCS 1976, pp. 147–158. IEEE Press (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Szeged, Szeged, Hungary

    Zoltán Ésik

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zoltán Ésik .

Editor information

Editors and Affiliations

  1. Nuance Communications, Sunnyvale, California, USA

    Valeria de Paiva

  2. Universidade Federal de Pernambuco, Centro de Informática, Recife, Pernambuco, Brazil

    Ruy de Queiroz

  3. Department of Mathematics, Indiana University Bloomington, Bloomington, Indiana, USA

    Lawrence S. Moss

  4. nDepartment of Computer Science, Indiana University Bloomington, Bloomington, Indiana, USA

    Daniel Leivant

  5. Universidade Federal de Pernambuco, Centro de Informática, Recife, Pernambuco, Brazil

    Anjolina G. de Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z. (2015). Equational Properties of Stratified Least Fixed Points (Extended Abstract). In: de Paiva, V., de Queiroz, R., Moss, L., Leivant, D., de Oliveira, A. (eds) Logic, Language, Information, and Computation. WoLLIC 2015. Lecture Notes in Computer Science(), vol 9160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47709-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47709-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47708-3

  • Online ISBN: 978-3-662-47709-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation