{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:34Z","timestamp":1725455914412},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013840","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:24:11Z","timestamp":1132730651000},"page":"403-419","source":"Crossref","is-referenced-by-count":0,"title":["The finiteness of logic programming derivations"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Balbiani","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"K. R. Apt, G. Bezem: Acyclic programs. In: P. Szeredi, D. H. D. Warren (eds.): Proceedings of the Seventh International Conference on Logic Programming. Massachussets Institute of Technology Press 1990, pp. 617\u2013633"},{"key":"26_CR2","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. R. Apt","year":"1988","unstructured":"K. R. Apt, H. A. Blair, A. Walker: Towards a theory of declarative knowledge. In: J. Minker (ed.): Foundations of Deductive Databases and Logic Programming. Los Altos: Morgan Kaufmann 1988, pp. 89\u2013148"},{"key":"26_CR3","first-page":"131","volume-title":"Design and Implementation of Symbolic Computation Systems. Lecture Notes in Computer Science 429","author":"K. R. Apt","year":"1990","unstructured":"K. R. Apt, R. N. Bol, J. W. Klop: On the power of subsumption and context checks. In: A. Miola (ed.): Design and Implementation of Symbolic Computation Systems. Lecture Notes in Computer Science 429. Berlin: Springer 1990, pp. 131\u2013140"},{"key":"26_CR4","first-page":"523","volume-title":"Eighth Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science 480","author":"P. Balbiani","year":"1990","unstructured":"P. Balbiani: A modal semantics for the negation as failure and the closed world assumption rules. In: C. Choffrut, M. Jantzen (eds.): Eighth Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science 480. Berlin: Springer 1990, pp. 523\u2013534"},{"key":"26_CR5","unstructured":"P. Balbiani: A modal semantics of negation in logic programming. Fundamente Informatic\u00e6 (to appear)"},{"key":"26_CR6","unstructured":"P. Balbiani: Sur la finitude des d\u00e9rivations de la programmation en logique. rapport IRIT\/92-3-R"},{"key":"26_CR7","unstructured":"M. Bezem: Characterizing termination of logic programs with level mapping. In: E. L. Lusk, R. Overbeek (eds.): Proceedings of the North American Conference on Logic Programming. Massachussets Institute of Technology Press 1989, pp. 69\u201380"},{"key":"26_CR8","volume-title":"The unprovability of inconsistency","author":"G. Boolos","year":"1979","unstructured":"G. Boolos: The unprovability of inconsistency. Cambridge: Cambridge University Press 1979"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"G. Boolos, G. Sambin: Provability: the emergence of a mathematical modality. Studia Logica, 1\u201323 (1991)","DOI":"10.1007\/BF00370383"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"K. L. Clark: Negation as failure. In: H. Gallaire et J. Minker (eds.): Logic and Data Bases. New York: Plenum Press 1978, pp. 293\u2013322"},{"key":"26_CR11","unstructured":"F. Denis: Contribution \u00e0 l'\u00e9tude des s\u00e9mantiques axiomatiques de Prolog. th\u00e8se de l'universit\u00e9 des sciences et techniques de Lille Flandres Artois, 1990"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","volume":"29","author":"J.-L. Lassez","year":"1984","unstructured":"J.-L. Lassez, M. J. Maher: Closures and fairness in the semantics of programming logic. Theoretical Computer Science 29, 167\u2013184 (1984)","journal-title":"Theoretical Computer Science"},{"key":"26_CR13","first-page":"263","volume-title":"A unified treatment of resolution strategies for logic programs","author":"J.-L. Lassez","year":"1984","unstructured":"J.-L. Lassez, M. J. Maher, D. A. Wolfram: A unified treatment of resolution strategies for logic programs. In: S.-A. Tarnlund (ed.): Second International Conference on Logic Programming. Uppsala: Uppsala University Press 1984, pp. 263\u2013276"},{"key":"26_CR14","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. Berlin: Springer 1987"},{"key":"26_CR15","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi: Classical recursion theory. Amsterdam: North-Holland 1989"},{"key":"26_CR16","volume-title":"Lecture Notes in Artificial Intelligence 446","author":"L. Pl\u00fcmer","year":"1990","unstructured":"L.Pl\u00fcmer: Termination proofs for logic programs. Lecture Notes in Artificial Intelligence 446. Berlin: Springer 1990"},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(91)90003-8","volume":"10","author":"J. C. Shepherdson","year":"1991","unstructured":"J. C. Shepherdson: Unsolvable problems for SLDNF resolution. Journal of Logic Programming 10, 19\u201322 (1991)","journal-title":"Journal of Logic Programming"},{"key":"26_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J. D. Ullman","year":"1988","unstructured":"J. D. Ullman, A. van Gelder: Efficient tests for top-down termination of logical rules. Journal of the Association for Computing Machinery 35, 345\u2013373 (1988)","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013840.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:08:13Z","timestamp":1607353693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0013840","relation":{},"subject":[]}}