{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:09:04Z","timestamp":1736140144481,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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\/bfb0018453","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:30:30Z","timestamp":1132637430000},"page":"366-385","source":"Crossref","is-referenced-by-count":4,"title":["The net-clause language \u2014 A tool for data-driven inference"],"prefix":"10.1007","author":[{"given":"Zdravko","family":"Markov","sequence":"first","affiliation":[]},{"given":"Christo","family":"Dichev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"24_CR1","volume-title":"Symbolic logic and mechanical theorem proving","author":"C.-L. Chang","year":"1973","unstructured":"C.-L. Chang and R.C.-T. Lee, Symbolic logic and mechanical theorem proving (Academic Press, London, 1973)."},{"key":"24_CR2","unstructured":"D.P. Friedman and D.S. Wise, CONS should not evaluate its arguments, in: S. Michaelson and R. Milner, eds., Automata, Languages and Programming, (Edinburgh University Press), 257\u2013284."},{"key":"24_CR3","unstructured":"S. Gregory, Parallel Logic Programming in PARLOG (Addison-Wesley, 1987)."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"P. Henderson and J.H. Morris, A lazy evaluator, in: Proceedings of the 3rd ACM Symposium on Principles of Programming Languages, 1976, ACM, 95\u2013103.","DOI":"10.1145\/800168.811543"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Ph. Jorrand, Design and implementation of a parallel inference machine for first order logic, in: Proc. PARLE Conference (Lecture Notes in Computer Science No. 259, Springer-Verlag, 1987).","DOI":"10.1007\/3-540-17943-7_143"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming (Springer-Verlag, 1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"24_CR7","unstructured":"Z. Markov, A framework for network modeling in Prolog, in: Proceedings of IJCAI-89, Detroit, U.S.A (1989), 78\u201383."},{"key":"24_CR8","unstructured":"Z. Markov and Th. Risse. Prolog Based Graph Representation of Polyhedra, in: Proceedings of AIMSA'88 (Artificial Intelligence III, North-Holland, 1988), 187\u2013194."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Z. Markov and Ch. Dichev, Logical inference in a network environment, in: Proceedings of AIMSA'90 (Artificial Intelligence IV, North-Holland, 1990), 169\u2013178.","DOI":"10.1016\/B978-0-444-88771-9.50024-6"},{"key":"24_CR10","unstructured":"Z. Markov, C. Dichev and L. Sinapova, The Net-Clause Language \u2014 a tool for describing network models, in: Proceedings of the Eighth Canadian Conference on AI, Ottawa, Canada, 23\u201325 May, 1990, 33\u201339."},{"key":"24_CR11","unstructured":"Z. Markov, L. Sinapova and Ch. Dichev. Default reasoning in a network environment, in: Proceedings of ECAI-90, Stockholm, Sweden, August 6\u201310, 1990, pp.431\u2013436."},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0004-3702(82)90011-X","volume":"18","author":"N.V. Murray","year":"1982","unstructured":"N.V. Murray, Completely non-clausal theorem proving, Artificial intelligence 18 (1982), 67\u201385.","journal-title":"Artificial intelligence"},{"key":"24_CR13","unstructured":"L. Naish, ed., MU-Prolog 3.1db Reference Manual. Dept. of Computer Science, University of Melbourne, 1984."},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980), 81\u2013132.","journal-title":"Artificial Intelligence"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"E. Shapiro, Concurrent PROLOG: A Progress Report, in: Lecture Notes in Computer Science No. 232 (Springer-Verlag, 1986), 277\u2013313.","DOI":"10.1007\/BFb0022685"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"L. Sinapova, A network parsing scheme, in: Proceedings of AIMSA'90 (Artificial Intelligence IV, North-Holland, 1990), 383\u2013392.","DOI":"10.1016\/B978-0-444-88771-9.50047-7"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"E.M. Stickel, An Introduction to Automated Deduction, in: W. Bibel, Jorrand, eds., Fundamentals of Artificial Intelligence. An advanced Course (Springer-Verlag, 1986).","DOI":"10.1007\/BFb0022681"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"K. Ueda, Guarded Horn Clauses, ICOT Technical Report TR-103, 1985.","DOI":"10.1007\/3-540-16479-0_17"}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:49:22Z","timestamp":1736106562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540536864","9783540469827"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0018453","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}