{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:05Z","timestamp":1725455945787},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540536864"},{"type":"electronic","value":"9783540469827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0018441","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:30:30Z","timestamp":1132637430000},"page":"180-195","source":"Crossref","is-referenced-by-count":1,"title":["The optimal model of a program with negation"],"prefix":"10.1007","author":[{"given":"J. P.","family":"Delahaye","sequence":"first","affiliation":[]},{"given":"V.","family":"Thibau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1988","unstructured":"K. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in: J. Minker, ed, Foundations of Deductive Databases and Logic Programming (Morgan Kaufman, Los Altos, 1988), 89\u2013142."},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29-3","author":"K. Apt","year":"1982","unstructured":"K. Apt and M. Van Emden, Contribution to the theory of logic programming, J. ACM 29-3 (1982) 841\u2013842.","journal-title":"J. ACM"},{"key":"12_CR3","unstructured":"M. Ben Jacob and M. Fitting, Stratified and Three-valued Logic Programming Semantics, in: R.A. Kowalski and A. Bowen, ed., Proceedings of the Fifth International Conference and symposium on Logic Programming (MIT Press, 1988) 1055\u20131069."},{"key":"12_CR4","unstructured":"N. Bidoit et C. Froidevaux, Variations sur la contrainte de stratification: Stratification, Stratification locale, Sup-stratification: Journ\u00e9es Bases de donn\u00e9es avanc\u00e9es, 1988."},{"key":"12_CR5","unstructured":"N. Bidoit et C. Froidevaux, General logic databases and programs: Default logic semantics and stratification,To appear in J. of Information and computation."},{"key":"12_CR6","unstructured":"N. Bidoit et C. Froidevaux, Negation by default and Unstratifiable Logic Programs,To appear in TCS."},{"key":"12_CR7","unstructured":"N. Bidoit, Negation in Rule-Based Database Language: A Survey, To appear in TCS."},{"key":"12_CR8","first-page":"293","volume-title":"Logic and databases","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark, Negation as failure, in: Gallaire and Minker ed., Logic and databases (Plenum Press, New York,1978).293\u2013324."},{"key":"12_CR9","unstructured":"J.P. Delahaye: Chainage avant et calcul bool\u00e9en et trivalu\u00e9, Journ\u00e9es internationales sur les syst\u00e8mes experts et leurs applications, Avignon 1987, 1341\u20131360."},{"key":"12_CR10","unstructured":"J.P. Delahaye: Programmation en logique trivalu\u00e9e, rapport de recherche I.T no 115, Universit\u00e9 des Sciences et Techniques de Lille, 1987."},{"key":"12_CR11","unstructured":"J.P. Delahaye, P. Matthieu: Logique partielle et Prolog, s\u00e9minaire de programmation logique de Tregastel, 1989."},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"4","author":"M. Fitting","year":"1985","unstructured":"M. Fitting, A Kripke-Kleene semantic for logic programs, J. Logic Programming 4 (1985) 295\u2013312.","journal-title":"J. Logic Programming"},{"issue":"1","key":"12_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1305\/ndjfl\/1093636525","volume":"27","author":"M. Fitting","year":"1986","unstructured":"M. Fitting, Notes on the mathematical aspects of Kripke's theory of truth, Notre Dame Journal of Formal Logic, vol.27, no 1 (1986) 75\u201388.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(86)90096-4","volume":"48","author":"M. Fitting","year":"1986","unstructured":"M. Fitting, Partial models and logic programming, Theoretical Computer Science 48 (1986) 229\u2013255.","journal-title":"Theoretical Computer Science"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"K. Kunen, Negation in Logic Programming, Journal of Logic Programming (1987) 289\u2013308.","DOI":"10.1016\/0743-1066(87)90007-0"},{"key":"12_CR16","first-page":"978","volume-title":"Proceedings of the fifth Logic Programming symposium","author":"K. Kunen","year":"1988","unstructured":"K. Kunen, Some remarks on the completed databases, in: R. Kowalski and K. Bowen, eds, Proceedings of the fifth Logic Programming symposium (Association for Logic Programming, MIT Press, Cambridge, Mass, 1988) 978\u2013992."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"K. Kunen, Signed data dependencies in logic programming, Journal of Logic Programming (1989) 231\u2013245.","DOI":"10.1016\/0743-1066(89)90022-8"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(85)90128-8","volume":"39","author":"J.L. Lassez","year":"1985","unstructured":"J.L. Lassez et M.J. Maher, Optimal fixpoints of logic programs, Theoretical Computer Science 39 (1985) 15\u201325.","journal-title":"Theoretical Computer Science"},{"key":"12_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"J.W. Lloyd, Foundations of Logic Programming (second edition, Springer, Berlin, 1987).","edition":"second edition"},{"issue":"3","key":"12_CR20","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/0205033","volume":"5","author":"Z. Manna","year":"1976","unstructured":"Z. Manna and A. Shamir, The theoretical aspects of the optimal fixpoints, Siam J. comput., vol 5, no 3 (1976). 414\u2013426.","journal-title":"Siam J. comput."},{"issue":"11","key":"12_CR21","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/359863.359885","volume":"20","author":"Z. Manna","year":"1977","unstructured":"Z. Manna and A. Shamir, The optimal approach to recursive programs, ACM vol 20, no 11 (1977) 824\u2013831","journal-title":"ACM"},{"key":"12_CR22","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-12920-0_25","volume":"166","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft, Logic programs and many-valued logic,in: STACS 84, Lecture Notes in Computer Science 166 (Springer, Berlin, 1984) 274\u2013286.","journal-title":"Lecture Notes in Computer Science"},{"key":"12_CR23","unstructured":"T. Przymunsinski and H. Przymunsinski, Weakly perfect model semantics for Logic programs, Conference and Symp. on Logic Programming, (1988) 1106\u20131120."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"T. Przymunsinski, Every Logic Program has a natural Stratification and an iterated fixed point model, Proc. ACM Symp. Principles of Databases Systems, (1988) 11\u201321.","DOI":"10.1145\/73721.73723"},{"key":"12_CR25","unstructured":"T. Przymunsinski, Non monotonic formalisms and Logic Programming, ICLP, (1989) 655\u2013674."},{"key":"12_CR26","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T. Przymunsinski","year":"1988","unstructured":"T. Przymunsinski, On the declarative semantics of deductive databases and logic programs, in: J. Minker, ed, Foundations of Deductive Databases and Logic Programming (Morgan Kaufman, Los Altos, 1988)."},{"key":"12_CR27","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/B978-0-934613-40-8.50005-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.C. Shepherdson","year":"1988","unstructured":"J.C. Shepherdson, Negation in Logic Programming, in: J. Minker, ed, Foundations of Deductive Databases and Logic Programming (Morgan Kaufman, Los Altos, 1988) 19\u201387."},{"key":"12_CR28","unstructured":"V. Thibau, Th\u00e8se de doctorat: Une logique trivalu\u00e9e appliqu\u00e9e \u00e0 la programmation logique, Universit\u00e9 des Sciences et Techniques de Lille, 1990."},{"key":"12_CR29","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden Van","year":"1976","unstructured":"M.H. Van Emden, R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM, 23 (1976), 733\u2013742.","journal-title":"J. ACM"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The well-founded semantics for general logic programs, Proc. ACM Symp. Principles of Databases Systems, (March 1988) 221\u2013230.","DOI":"10.1145\/308386.308444"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The alternative fixpoint of logic programs with negation, Proc. ACM Symp. Principles of Databases Systems, (March 1989) 1\u201310.","DOI":"10.1145\/73721.73722"}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:36:57Z","timestamp":1586572617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540536864","9783540469827"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/bfb0018441","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}