{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:27Z","timestamp":1725455847885},"publisher-location":"Berlin\/Heidelberg","reference-count":37,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055887X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023440","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:47:37Z","timestamp":1132397257000},"page":"391-410","source":"Crossref","is-referenced-by-count":0,"title":["Disjunctive logic programming, constructivity and strong negation"],"prefix":"10.1007","author":[{"given":"Heinrich","family":"Herre","sequence":"first","affiliation":[]},{"given":"David","family":"Pearce","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1305\/ndjfl\/1093637767","volume":"29","author":"S Akama","year":"1988","unstructured":"Akama, S, Constructive logic with strong negation and model theory, Notre Dame J Formal Logic 29 (1988), 18\u201327","journal-title":"Notre Dame J Formal Logic"},{"key":"23_CR2","unstructured":"Akama, S, Resolution in Constructivism, Logique et Analyse (1989), 385\u2013399"},{"key":"23_CR3","volume-title":"Dissertation","author":"S Akama","year":"1989","unstructured":"Akama, S, Constructive Falsity: Foundations and their Applications to Computer Science, Dissertation, Keio University, Japan, 1989"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.2307\/2274105","volume":"49","author":"A Almukdad","year":"1984","unstructured":"Almukdad, A & Nelson, D, Constructible Falsity and Inexact Predicates, J Symbolic Logic 49 (1984), 231\u2013233.","journal-title":"J Symbolic Logic"},{"key":"23_CR5","unstructured":"Avron, A, Simple Consequence relations, TR 145\/89 (1989), The Eskanasy Institute of CS, Tel-Aviv University"},{"key":"23_CR6","unstructured":"Bellin, G, & J Ketonen, Notes on Direct Logic, Linear Logic and its Implementation, Preprint, 1988"},{"key":"23_CR7","unstructured":"Casanova, M A, R Guereiro, & A Silva, Logic Programming with general clauses and defaults based on model elimination, in, Proc of the 11th IJCAI, Morgan Kaufmann, 1989"},{"key":"23_CR8","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C. L. Chang","year":"1973","unstructured":"Chang, C L, & Lee, R C T, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York-San Francisco-London, 1973"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Furbach, U, Answers for disjunctive logic programs, in GWAI'91: 15. Fachtagung f\u00fcr KI, Informatik-Fachberichte 285, Springer-Verlag, 1991, 23\u201332","DOI":"10.1007\/978-3-662-02711-0_3"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Girard, J-Y, Linear Logic, TCS (1987), 1\u2013101","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"23_CR11","unstructured":"Gelfond, M & Lifschitz, V, Logic Programs with Classical Negation, in D Warren & P Szeredi (eds.), Proc. ICLP-90, MIT Press, 1990."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Gelfond, M, & V Lifschitz, Classical Negation in Logic Programs and Disjunctive Databases, New Gener Comp (1991)","DOI":"10.1007\/BF03037169"},{"key":"23_CR13","unstructured":"Goltz. H-J, & H Herre, Mathematische Grundlagen der logischen Programmierung, IIR Info-Reporte 5 (1987) 160pp."},{"key":"23_CR14","first-page":"219","volume":"69","author":"C Green","year":"1969","unstructured":"Green, C, Applications of theorem-proving to problem solving, Proc IJCAI 69 (1969), 219\u2013238","journal-title":"Proc IJCAI"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02121114","volume":"36","author":"Y Gurevich","year":"1977","unstructured":"Gurevich, Y, Intuitionistic Logic with Strong Negation, Studia Logica 36 (1977), 49\u201359.","journal-title":"Studia Logica"},{"key":"23_CR16","volume-title":"Preprint P-Math 21\/86","author":"H Herre","year":"1986","unstructured":"Herre, H, Konstruktive Resolutionsmethoden, Preprint P-Math 21\/86, Institut f\u00fcr Mathematik, AdW der DDR, Berlin 1986"},{"key":"23_CR17","first-page":"295","volume":"1","author":"H Herre","year":"1988","unstructured":"Herre, H, Negation and Constructivity in Logic Programming, J New Gener Comput Syst 1 (1988), 295\u2013305","journal-title":"J New Gener Comput Syst"},{"key":"23_CR18","first-page":"38","volume-title":"LNCS vol. 543","author":"H Herre","year":"1990","unstructured":"Herre, H, Nonmonotonic Reasoning and Logic Programs; NIL (Workshop on Nonmonotonic and Inductive Logic), Karlsruhe 1990, LNCS vol. 543, Springer-Verlag, 38\u201358"},{"key":"23_CR19","unstructured":"Hofbauer, D, R Kutsche & D Siefkes, On the Logic of Logic Programming, Preprint TU Berlin, 1986, 16pp."},{"key":"23_CR20","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/1385-7258(72)90053-4","volume":"34","author":"E. G. K. L\u00f3pez-Escobar","year":"1972","unstructured":"L\u00f3pez-Escobar, E G K, Refutability and Elementary Number Theory, Indag. Math. 34 (1972), 362\u2013374.","journal-title":"Indag. Math."},{"key":"23_CR21","unstructured":"Loveland, D, W, Automated Theorem Proving: A logical basis, North-Holland, 1978"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Lloyd,J.W. Foundations of Logic Programming, Springer 1987","DOI":"10.1007\/978-3-642-83189-8"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Mathieu, P, & J-P Delahaye, The logical compilation of knowledge bases, LNCS, Springer-Verlag, 1991","DOI":"10.1007\/BFb0018454"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D Miller","year":"1991","unstructured":"Miller, D, G Nadathur, F Pfenning, & A Scedrov, Uniform proofs as a foundation for logic programming, Ann Pure and Applied Logic 51 (1991), 125\u2013157","journal-title":"Ann Pure and Applied Logic"},{"key":"23_CR25","first-page":"16","volume":"14","author":"D Nelson","year":"1949","unstructured":"Nelson, D, Constructible falsity, JSL 14 (1949), 16\u201326.","journal-title":"JSL"},{"key":"23_CR26","volume-title":"Constructivity in Mathematics","author":"D Nelson","year":"1959","unstructured":"Nelson, D, Negation and Separation of Concepts in Constructive Systems, in A Heyting (Ed), Constructivity in Mathematics, North-Holland, Amsterdam, 1959"},{"key":"23_CR27","unstructured":"Pearce, D, Reasoning with Negative Information, II: Hard Negation, Strong Negation and Logic Programs, to appear in [PW 92]."},{"key":"23_CR28","unstructured":"Pearce, D & Wagner, G, Reasoning with Negative Information I: Strong Negation in Logic Programs, in L Haaparanta, M Kusch & I Niiniluoto (eds.), Language, Knowledge, and Intentionality, (Acta Philosophica Fennica 49), Helsinki, 1990."},{"key":"23_CR29","volume-title":"Extensions of Logic Programming, LNAI, 475","author":"D Pearce","year":"1991","unstructured":"Pearce, D & Wagner, G, Logic Programming with Strong Negation, in P Schroeder-Heister (ed.), Extensions of Logic Programming, LNAI, 475, pringer-Verlag, Berlin, 1991."},{"volume-title":"Nonclassical Logics and Information Processing, LNAI 619","year":"1992","key":"23_CR30","unstructured":"Pearce, D & Wansing, H. (eds.) Nonclassical Logics and Information Processing, LNAI 619, Springer-Verlag, Berlin, 1992."},{"key":"23_CR31","volume-title":"An Algebraic Approach to Non-classical Logics","author":"H Rasiowa","year":"1974","unstructured":"Rasiowa, H, An Algebraic Approach to Non-classical Logics, PWN, Warsaw, & North-Holland, Amsterdam, 1974."},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J Robinson","year":"1965","unstructured":"Robinson, J, Robinson A, A Machine-oriented Logic Based on the Resolution Principle, J. ACM 12 (1965), 23\u201341","journal-title":"J. ACM"},{"key":"23_CR33","first-page":"409","volume":"30","author":"W Sieg","year":"1991","unstructured":"Sieg, W, Herbrand Analyses, Archive for ML 30 (1991), 409\u2013441","journal-title":"Archive for ML"},{"key":"23_CR34","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF03037328","volume":"2","author":"M Stickel","year":"1984","unstructured":"Stickel, M, A Prolog technology theorem prover, New Gener Computing 2 (1984), 371\u2013383","journal-title":"New Gener Computing"},{"key":"23_CR35","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1093\/logcom\/1.6.835","volume":"1","author":"G Wagner","year":"1991","unstructured":"Wagner, G, Logic Programming with Strong Negation and Inexact Predicates, J. Logic and Computation 1 (1991), 835\u2013859","journal-title":"J. Logic and Computation"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Wakayama, T, & T H Payne, Case inference in resolution-based laguages. In Lusk and Overbeek, Proc. of the 9th CADE, 313\u2013322; Springer LNCS 310, 1988","DOI":"10.1007\/BFb0012839"},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Wakayama, T, & T H Payne, Case-Free Programs: An Abstraction of Definite Horn Programs, LNCS, 1990","DOI":"10.1007\/3-540-52885-7_81"}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:55:36Z","timestamp":1586570136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055887X"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/bfb0023440","relation":{},"subject":[]}}