{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:57Z","timestamp":1725664197281},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580256"},{"type":"electronic","value":"9783540484172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58025-5_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:07:20Z","timestamp":1330250840000},"page":"222-254","source":"Crossref","is-referenced-by-count":2,"title":["Regular search spaces as a foundation of logic programming"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Momigliano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Ornaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Apt K.A., Blair H. A. & Walker A.: Towards a Theory of Declarative Knowledge. In: Foundations of Deductive Databases and Logic Programming, Minker J. (ed.), pp. 89\u2013148, Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"15_CR2","unstructured":"Apt K.A.: An Introduction to Logic Programming. In: Handbook of Theoretical Computer Science, Leuween J. (ed.), Elsevier 1990."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF03037453","volume":"7","author":"M. Aronsson","year":"1990","unstructured":"Aronsson M., Eriksson L-H., G\u00e4redal A. & Olin P.: The Programming Language GCLA: a Definitional Approach to Logic Programming. New Generating Computing 7, pp. 381\u2013404, 1990.","journal-title":"New Generating Computing"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0743-1066(90)90023-X","volume":"8","author":"R. Barbuti","year":"1990","unstructured":"Barbuti R., Mancarella P., Pedreschi D. & Turini F.: A Transformational Approach to Negation in Logic Programming. Journal of Logic Programming 8, pp. 201\u2013228, 1990.","journal-title":"Journal of Logic Programming"},{"key":"15_CR5","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":"Clark K.L.: Negation as Failure. In: Logic and Data Bases, Gallaire H. & Minker J. (eds.), Plenum Press, New York, pp. 293\u2013322, 1978."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"795","DOI":"10.2307\/2275431","volume":"57","author":"R. Dyckhoff","year":"1992","unstructured":"Dyckhoff R.: Contraction-Free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic 57, pp. 795\u2013807, 1992.","journal-title":"Journal of Symbolic Logic"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Fitting M.: First-Order Logic and Automated Theorem Proving. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4684-0357-2"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","volume":"1","author":"D. M. Gabbay","year":"1984","unstructured":"Gabbay D. M. & Reyle U.: N-Prolog: an Extension of Prolog with Hypothetical Implications 1. Journal of Logic Programming 1, pp. 319\u2013355, 1984.","journal-title":"Journal of Logic Programming"},{"key":"15_CR9","volume-title":"Logic for Computer Science, Foundations of Automatic Theorem Proving","author":"J. Gallier","year":"1986","unstructured":"Gallier J.: Logic for Computer Science, Foundations of Automatic Theorem Proving. Harper & Row, New York, 1986."},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1093\/logcom\/1.2.261","volume":"1","author":"L. Halln\u00e4s","year":"1990","unstructured":"Halln\u00e4s L. & Schroeder-Heister P.: A Proof-Theoretic Approach to Logic Programming: Clauses as Rules. Journal of Logic and Computation 1, pp. 261\u2013283, 1990.","journal-title":"Journal of Logic and Computation"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1093\/logcom\/1.5.635","volume":"1","author":"L. Halln\u00e4s","year":"1991","unstructured":"Halln\u00e4s L. & Schroeder-Heister P.: A Proof-Theoretic Approach to Logic Programming: Programs as Definitions. Journal of Logic and Computation 1, pp. 635\u2013660, 1991.","journal-title":"Journal of Logic and Computation"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0304-3975(06)80007-1","volume":"87","author":"L. Halln\u00e4s","year":"1991","unstructured":"Halln\u00e4s L.: Partial Inductive Definitions. Theoretical Computer Science 87, pp. 115\u2013147, 1991.","journal-title":"Theoretical Computer Science"},{"key":"15_CR13","unstructured":"Harland J.: On Hereditary Harrop Formulae as a Basis for Logic Programming. PhD Thesis, Edinburgh 1991."},{"key":"15_CR14","unstructured":"Harland J.: Towards a Static Proof System for Negation as Failure. Citri\/TR-92-49, University of Melbourne, 1992."},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen K.: Negation in Logic Programming. Journal of Logic Programming 4, pp. 289\u2013308, 1987.","journal-title":"Journal of Logic Programming"},{"key":"15_CR16","unstructured":"Lassez J-L., Maher M.J. & Marriot K.: Unification Revisited.: In: Foundations of Deductive Databases and Logic Programming. Minker J. (ed.), Morgan Kaufmann, pp. 587\u2013626, 1988."},{"key":"15_CR17","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":"Lloyd J.W.: Foundations of Logic Programming. Second Extended Edition, Springer-Verlag, Berlin, 1987.","edition":"Second Extended"},{"key":"15_CR18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"Lloyd J.W. & Shepherdson J.: Partial Evaluation in Logic Programming. Journal of Logic Programming 11, pp. 217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","volume":"6","author":"D. Miller","year":"1989","unstructured":"Miller D.: A Logical Analysis of Modules in Logic Programming. Journal of Logic Programming 6, pp. 79\u2013108, 1989.","journal-title":"Journal of Logic Programming"},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller D., Nadathur G., Pfenning F., Scedrov A.: Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic 51, pp. 125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"15_CR21","unstructured":"Ornaghi M. & Momigliano A.: A Proof-Theoretic Reconstruction of Logic Programming. Abstract. In: Workshop on Proof and Types, Pfenning F. (ed.) JICSLP92, Washington, pp 22\u201323, 1992."},{"key":"15_CR22","first-page":"287","volume":"4","author":"D. A. Plaisted","year":"1988","unstructured":"Plaisted D.A.: Non-Horn Logic Programming without Contrapositives. JJournal of Automated Reasoning 4, pp. 287\u2013325, 1988.","journal-title":"JJournal of Automated Reasoning"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Pfenning F.: Unification and Anti-Unification in the Calculus of Constructions. Proc. of LICS91, pp. 74\u201385, 1991.","DOI":"10.1109\/LICS.1991.151632"},{"key":"15_CR24","first-page":"285","volume-title":"Types in Logic Programming","author":"F. Pfenning","year":"1992","unstructured":"Pfenning F.: Dependent Types in Logic Programming. Types in Logic Programming, Pfenning F. (ed.), MIT Press, Cambridge, pp. 285\u2013312, 1992."},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Shepherdson J.C.: Negation in Logic Programming. In: Foundations of Deductive Databases and Logic Programming, Minker J. (ed.), Morgan Kaufmann, pp. 19\u201388, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Snyder W. & Lynch C.: Goal-Oriented Strategies for Paramodulation, RTA-91, Book R.V. (ed.), Lecture Notes in Computer Science 488, Springer-Verlag, pp. 150\u2013161, 1991.","DOI":"10.1007\/3-540-53904-2_93"},{"key":"15_CR27","unstructured":"St\u00e4rk R.: The Proof-Theory of Logic Programs with Negation. PhD Thesis, University of Bern, 1992."},{"key":"15_CR28","unstructured":"St\u00e4rk R.: Cut-Property and Negation as Failure. Technical Report, University of Bern, 1992."}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58025-5_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:20Z","timestamp":1605629780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58025-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580256","9783540484172"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-58025-5_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}