{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T22:44:49Z","timestamp":1725921889246},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720555"},{"type":"electronic","value":"9783319720562"}],"license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-72056-2_14","type":"book-chapter","created":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T09:33:31Z","timestamp":1511775211000},"page":"221-241","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Founded Semantics and Constraint Semantics of Logic Rules"],"prefix":"10.1007","author":[{"given":"Yanhong A.","family":"Liu","sequence":"first","affiliation":[]},{"given":"Scott D.","family":"Stoller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19","author":"KR Apt","year":"1994","unstructured":"Apt, K.R., Bol, R.N.: Logic programming and negation: a survey. J. Log. Program. 19, 9\u201371 (1994)","journal-title":"J. Log. Program."},{"issue":"1","key":"14_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0304-3975(00)00330-3","volume":"278","author":"M Fitting","year":"2002","unstructured":"Fitting, M.: Fixpoint semantics for logic programming: a survey. Theor. Comput. Sci. 278(1), 25\u201351 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR3","first-page":"293","volume-title":"Logic and Databases","author":"KL Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"issue":"3","key":"14_CR4","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"14_CR5","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 1070\u20131080. MIT Press (1988)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufman (1988)","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"4","key":"14_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M Fitting","year":"1985","unstructured":"Fitting, M.: A Kripke-Kleene semantics for logic programs. J. Log. Program. 2(4), 295\u2013312 (1985)","journal-title":"J. Log. Program."},{"key":"14_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases","author":"S Ceri","year":"1990","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)"},{"key":"14_CR9","volume-title":"Foundations of Databases: The Logical Level","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison-Wesley, Reading (1995)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Liu, Y.A., Stoller, S.D.: The founded semantics and constraint semantics of logic rules. Computing Research Repository arXiv:1606.06269 [cs.LO] (Revised 2017) (2016)","DOI":"10.1007\/978-3-319-72056-2_14"},{"issue":"3","key":"14_CR11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0743-1066(93)90039-J","volume":"15","author":"W Chen","year":"1993","unstructured":"Chen, W., Kifer, M., Warren, D.S.: HiLog: a foundation for higher-order logic programming. J. Log. Program. 15(3), 187\u2013230 (1993)","journal-title":"J. Log. Program."},{"issue":"6","key":"14_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1552309.1552311","volume":"31","author":"YA Liu","year":"2009","unstructured":"Liu, Y.A., Stoller, S.D.: From datalog rules to efficient programs with time and space guarantees. ACM Trans. Program. Lang. Syst. 31(6), 1\u201338 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR13","unstructured":"Zukowski, U.: Flexible computation of the well-founded semantics of normal logic programs. Ph.D. thesis, Faculty of Computer Science and Mathematics, University of Passau (2001)"},{"issue":"3","key":"14_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01530784","volume":"12","author":"TC Przymusinski","year":"1994","unstructured":"Przymusinski, T.C.: Well-founded and stationary models of logic programs. Ann. Math. Artif. Intell. 12(3), 141\u2013187 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"14_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(94)00039-9","volume":"23","author":"R Ramakrishnan","year":"1995","unstructured":"Ramakrishnan, R., Ullman, J.D.: A survey of deductive database systems. J. Log. Program. 23(2), 125\u2013149 (1995)","journal-title":"J. Log. Program."},{"issue":"3","key":"14_CR16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"JW Lloyd","year":"1984","unstructured":"Lloyd, J.W., Topor, R.W.: Making Prolog more expressive. J. Log. Program. 1(3), 225\u2013240 (1984)","journal-title":"J. Log. Program."},{"key":"14_CR17","unstructured":"Sato, T., Tamaki, H.: Transformational logic program synthesis. In: Proceedings of the International Conference on Fifth Generation Computer Systems, pp. 195\u2013201 (1984)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-16492-8_78","volume-title":"Third International Conference on Logic Programming","author":"J Jaffar","year":"1986","unstructured":"Jaffar, J., Lassez, J.-L., Maher, M.J.: Some issues and trends in the semantics of logic programming. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 223\u2013241. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16492-8_78"},{"key":"14_CR19","unstructured":"Chan, D.: Constructive negation based on the completed database. In: Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 111\u2013125. MIT Press (1988)"},{"key":"14_CR20","unstructured":"Foo, N.Y., Rao, A.S., Taylor, A., Walker, A.: Deduced relevant types and constructive negation. In: Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 126\u2013139 (1988)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Stuckey, P.J.: Constructive negation for constraint logic programming. In: Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, pp. 328\u2013339 (1991)","DOI":"10.1109\/LICS.1991.151657"},{"issue":"2","key":"14_CR22","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1342991.1342998","volume":"9","author":"M Denecker","year":"2008","unstructured":"Denecker, M., Ternovska, E.: A logic of nonmonotone inductive definitions. ACM Trans. Comput. Log. 9(2), 14 (2008)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"14_CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0304-3975(92)90285-N","volume":"105","author":"PM Dung","year":"1992","unstructured":"Dung, P.M.: On the relations between stable and well-founded semantics of logic programs. Theor. Comput. Sci. 105(1), 7\u201325 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"14_CR24","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: Assat: computing answer sets of a logic program by sat solvers. Artif. Intell. 157(1\u20132), 115\u2013137 (2004)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72056-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T21:30:32Z","timestamp":1570397432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72056-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"ISBN":["9783319720555","9783319720562"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72056-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,11,28]]}}}