{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T20:40:06Z","timestamp":1748464806238,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662477083"},{"type":"electronic","value":"9783662477090"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47709-0_13","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T07:07:37Z","timestamp":1435043257000},"page":"174-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Equational Properties of Stratified Least Fixed Points (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"13_CR1","volume-title":"Category Theory for Computing Science","author":"M Barr","year":"1995","unstructured":"Barr, M., Wells, C.: Category Theory for Computing Science, 2nd edn. Prentice Hall, London (1995)","edition":"2"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Beki\u0107,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\u201355. Springer, Heidelberg (1984)","DOI":"10.1007\/BFb0048939"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(89)90012-1","volume":"63","author":"SL Bloom","year":"1989","unstructured":"Bloom, S.L., \u00c9sik, Z.: Equational logic of circular data type specification. Theoret. Comput. Sci. 63(3), 303\u2013331 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR4","series-title":"EATCS Monographs in Theoretical Computer Science.","volume-title":"Iteration Theories. The Equational Logic of Iterative Processes","author":"SL Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. The Equational Logic of Iterative Processes. EATCS Monographs in Theoretical Computer Science. Springer, Berlin (1993)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00010-0","volume":"155","author":"SL Bloom","year":"1996","unstructured":"Bloom, S.L., \u00c9sik, Z.: Fixed-point operators on ccc\u2019s. part I. Theoret. Comput. Sci. 155, 1\u201338 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1017\/S1471068414000313","volume":"14","author":"A Charalambidis","year":"2014","unstructured":"Charalambidis, A., \u00c9sik, Z., Rondogiannis, P.: Minimum model semantics for extensional higher-order logic programming with negation. Theory Pract. Logic Program. 14, 725\u2013737 (2014)","journal-title":"Theory Pract. Logic Program."},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-1-4615-1567-8_6","volume-title":"Logic-Based Artificial Intelligence","author":"M Denecker","year":"2000","unstructured":"Denecker, M., Marek, V.W., Truszczy\u0144ski, M.: Approximations, stable operations, well-founded fixed points and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 127\u2013144. Kluwer, Boston (2000)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ic.2004.02.004","volume":"192","author":"M Denecker","year":"2004","unstructured":"Denecker, M., Marek, V.W., Truszczy\u0144ski, M.: Ultimate approximation and its applications in nonmonotonic knowledge representation systems. Inf. Comput. 192, 21\u201384 (2004)","journal-title":"Inf. Comput."},{"key":"13_CR10","first-page":"175","volume-title":"Logic Colloquium 1973, Studies in Logic and the Foundations of Mathematics","author":"CC Elgot","year":"1975","unstructured":"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\u2013230. North Holand, Amsterdam (1975)"},{"key":"13_CR11","first-page":"183","volume":"XIV","author":"Z \u00c9sik","year":"1980","unstructured":"\u00c9sik, Z.: Identities in iterative and rational algebraic theories. Comput. Linguist. Comput. Lang. XIV, 183\u2013207 (1980)","journal-title":"Comput. Linguist. Comput. Lang."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z \u00c9sik","year":"1997","unstructured":"\u00c9sik, Z.: Completeness of park induction. Theoret. Comput. Sci. 177, 217\u2013283 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z.: Group axioms for iteration. Inf. Comput. 148, 131\u2013180 (1999)","journal-title":"Inf. Comput."},{"key":"13_CR14","first-page":"65","volume":"14","author":"Z \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z.: Axiomatizing iteration categories. Acta Cybernetica 14, 65\u201382 (1999)","journal-title":"Acta Cybernetica"},{"key":"13_CR15","unstructured":"\u00c9sik, 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)"},{"key":"13_CR16","unstructured":"\u00c9sik, Z.: Equational properties of stratified least fixed points. arXiv:1410.8111"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0304-3975(97)00158-8","volume":"195","author":"Z \u00c9sik","year":"1998","unstructured":"\u00c9sik, Z., Labella, A.: Equational properties of iteration in algebraically complete categories. Theoret. Comput. Sci. 195, 61\u201389 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR18","unstructured":"\u00c9sik, Z., Rondogiannis, P.: A fixed-point theorem for non-monotonic functions. Theoretical Computer Science (to appear) (see also: arXiv:1402.0299)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-662-44145-9_12","volume-title":"Logic, Language, Information, and Computation","author":"Z \u00c9sik","year":"2014","unstructured":"\u00c9sik, Z., Rondogiannis, P.: Theorems on pre-fixed points of non-monotonic functions with applications in logic programming and formal grammars. In: Kohlenbach, U., Barcel\u00f3, P., de Queiroz, R. (eds.) WoLLIC. LNCS, vol. 8652, pp. 166\u2013180. Springer, Heidelberg (2014)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M Fitting","year":"2002","unstructured":"Fitting, M.: Fixed point semantics for logic programming. A survey. Theoret. Comput. Sci. 278, 25\u201351 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","volume":"47","author":"AV van Gelder","year":"1993","unstructured":"van Gelder, A.V.: The alternating fixpoint of logic programs with negation. J. Comput. Syst. Sci. 47, 185\u2013221 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"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\u201321 (1989)","DOI":"10.1145\/73721.73723"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/1055686.1055694","volume":"6","author":"R Rondogiannis","year":"2005","unstructured":"Rondogiannis, R., Wadge, W.W.: Minimum model semantics for logic programs with negation. ACM Trans. Comput. Logic 6, 441\u2013467 (2005)","journal-title":"ACM Trans. Comput. Logic"},{"key":"13_CR24","unstructured":"Scott, D., De Bakker, J.W.: A theory of programs. IBM Technical report, Vienna (1969)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"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\u201341. IEEE (2000)","DOI":"10.1109\/LICS.2000.855753"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixed point theorem and its applications. Pac. J. Math. 5, 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"MH van Emden","year":"1976","unstructured":"van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. Assoc. Comput. Mach. 23, 733\u2013742 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/1183278.1183284","volume":"7","author":"J Vennekens","year":"2006","unstructured":"Vennekens, J., Gilis, D., Denecker, M.: Splitting an operation: algebraic modularity results for logics with fixed point semantics. ACM Trans. Comput. Logic 7, 765\u2013797 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013158. IEEE Press (1976)","DOI":"10.1109\/SFCS.1976.24"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47709-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T20:21:56Z","timestamp":1748463716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47709-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662477083","9783662477090"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47709-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}