{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:12:24Z","timestamp":1725729144090},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545583"},{"type":"electronic","value":"9783662027110"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/978-3-662-02711-0_3","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T08:52:52Z","timestamp":1370335972000},"page":"23-32","source":"Crossref","is-referenced-by-count":3,"title":["Answers for disjunctive logic programs"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Furbach","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","first-page":"395","volume-title":"Proc. of the 11th IJCAI","author":"MA Casanova","year":"1989","unstructured":"M.A. Casanova, R. Guerreiro, and A. Silva. Logic programming with general clauses and defaults based on model elimination. In Proc. of the 11th IJCAI, pages 395\u2013400;. Morgan Kaufmann, 1989zf."},{"key":"3_CR2","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"CL Chang","year":"1973","unstructured":"C. L. Chang and R. C. T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973."},{"issue":"4","key":"3_CR3","first-page":"295","volume":"1","author":"H Herre","year":"1988","unstructured":"H. Herre. Negation and constructivity in logic programming. J. New Gener. Comput. Syst., 1(4):295\u2013305, 1988.","journal-title":"J. New Gener. Comput. Syst."},{"key":"3_CR4","volume-title":"The Logic Programming Language LOP","author":"R Letz","year":"1989","unstructured":"R. Letz, S. Bayerl, J. Schumann, and B. Fronh\u00f6fer. The Logic Programming Language LOP. Technical report, ATP\u2014Report, Technische Universit\u00e4t M\u00fcnchen, 1989."},{"key":"3_CR5","volume-title":"A completeness theorem and a computer program for finding theorems derivable from given axioms","author":"C Lee","year":"1967","unstructured":"C. Lee. A completeness theorem and a computer program for finding theorems derivable from given axioms. PhD thesis, UCB, 1967."},{"key":"3_CR6","volume-title":"Automated Theorem Proving: A logical basis","author":"DW Loveland","year":"1978","unstructured":"D.W. Loveland. Automated Theorem Proving: A logical basis. North-Holland, 1978."},{"key":"3_CR7","first-page":"456","volume-title":"Proc. of the 4th Int. Conf. on Logic Programming","author":"DW Loveland","year":"1987","unstructured":"D.W. Loveland. Near-Horn Prolog. In J.-L. Lassez, editor, Proc. of the 4th Int. Conf. on Logic Programming, pages 456\u2013469. The MIT Press, 1987."},{"key":"3_CR8","volume-title":"SETHEO: A High-Performance Theorem Prover","author":"R Letz","year":"1989","unstructured":"R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A High-Performance Theorem Prover. Technical report, ATP\u2014Report, Technische Universit\u00e4t M\u00fcnchen, 1989. To appear in Journal of Automated Reasoning."},{"key":"3_CR9","first-page":"292","volume-title":"LNCS 138","author":"J Minker","year":"1982","unstructured":"J. Minker. On definite databases and the closed world assumption. In LNCS 138, pages 292\u2013308. Springer, 1982."},{"key":"3_CR10","first-page":"279","volume-title":"Proc. of the 9th CADE","author":"J Minker","year":"1988","unstructured":"J. Minker and A. Rajasekar. Procedural interpretation of non-horn logic programs. In Lusk and Overbeek, editors, Proc. of the 9th CADE, pages 279\u2013293. Springer LNCS 310, 1988."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J Minker","year":"1990","unstructured":"J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. J. Logic Programming, 9:45\u201374, 1990.","journal-title":"J. Logic Programming"},{"key":"3_CR12","volume-title":"A case-analysis based fixpoint semantics for disjunctive propgrams","author":"DW Reed","year":"1990","unstructured":"D.W. Reed and B.T. Smith. A case-analysis based fixpoint semantics for disjunctive propgrams. Extended abstract for the Workshop on \u2019Non-Hornclause programming\u2019 during NACLP\u201990, 1990."},{"key":"3_CR13","volume-title":"Mathematical Logic","author":"J Schoenfield","year":"1967","unstructured":"J. Schoenfield. Mathematical Logic. Addison-Wesley, 1967."},{"key":"3_CR14","first-page":"313","volume-title":"Proc. of the 9th CADE","author":"T Wakayama","year":"1988","unstructured":"T. Wakayama and T.H. Payne. Case inference in resolution-based languages. In Lusk and Overbeek, editors, Proc. of the 9th CADE, pages 313\u2013322. Springer LNCS 310, 1988."}],"container-title":["Informatik-Fachberichte","GWAI-91 15. Fachtagung f\u00fcr K\u00fcnstliche Intelligenz"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-02711-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T14:24:13Z","timestamp":1557757453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-02711-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545583","9783662027110"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-02711-0_3","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1991]]}}}