{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:38Z","timestamp":1749124058904},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603597"},{"type":"electronic","value":"9783540450481"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0026833","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:29:45Z","timestamp":1132396185000},"page":"415-430","source":"Crossref","is-referenced-by-count":1,"title":["Goal-directed query processing in disjunctive logic databases"],"prefix":"10.1007","author":[{"given":"Yuka","family":"Shimajiri","sequence":"first","affiliation":[]},{"given":"Hirohisa","family":"Seki","sequence":"additional","affiliation":[]},{"given":"Hidenori","family":"Itoh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","volume":"19\/20","author":"C. Baral","year":"1994","unstructured":"Baral, C. and Gelfond, M., Logic Programming and Knowledge Representation, in J. of Logic Programming vol. 19\/20:73\u2013148 (1994).","journal-title":"J. of Logic Programming"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. and Ramakrishnan. R., An Amateur's Introduction to Recursive Query Processing Strategies, Proc. of ACM SIGMOD Intl. Conf. on Management of Data, pp.16\u201352, 1986.","DOI":"10.1145\/16856.16859"},{"key":"25_CR3","unstructured":"Fujita, M. Slaney, J. and Bennet, F., Automatic Generation of Some Results in Finite Algebra, Proc. of IJCAI93, pp.52\u201357, 1993."},{"key":"25_CR4","first-page":"247","volume-title":"Advance in Computing Theory 3, The Theory of Databases","author":"J. Grant","year":"1986","unstructured":"Grant, J. and Minker, J., Answering Queries in Indefinite Database and the Null Value Problem, in: Advance in Computing Theory 3, The Theory of Databases, P. Kanellakis(ed.), JAI Press, Greenwich:247\u2013267, 1986."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Hensen, L. and Prak, H., Compiling the GCWA in Indefinite Deductive Database, in: Foundations of Deductive Database and Logic Programming, Morgen Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50015-4"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Inoue, K., Koshimura, M. and Hasegawa, R. Embedding Negation as Failure into a Model Generation Theorem Prover, Proc. of 11th Int'l Conf. on Automated Deduction, 1992.","DOI":"10.1007\/3-540-55602-8_180"},{"key":"25_CR7","first-page":"230","volume":"724","author":"S. Kato","year":"1993","unstructured":"Kato, S., Seki, H. and Itoh, H. An Efficient Abductive Reasoning System Based on Program Analysis, Proc. of the 3rd Int'l WSA, LNCS, Vol.724: 230\u2013241, 1993.","journal-title":"Proc. of the 3rd Int'l WSA, LNCS"},{"key":"25_CR8","unstructured":"Kowalski, R., Logic Programming in Artificial Intelligence, Proc. of IJCAI'91: 596\u2013603, 1991."},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00881861","volume":"14","author":"D. W. Loveland","year":"1995","unstructured":"Loveland, D. W., Reed, D. D. and Willson, D. S., SATCHMORE: SATCHMO with RElevancy, J. of Automated Reasoning, 14: 325\u2013351 (1995).","journal-title":"J. of Automated Reasoning"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Lobo, J., Minker, J. and Rajaseker, A., Foundations of Disjunctive Logic Programming, MIT Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"25_CR11","unstructured":"Manthey, R. and Bry, F., SATCHMO: a theorem prover implemented in Prolog, Proc. of CADE'88, 1987."},{"key":"25_CR12","unstructured":"Fujita, H. and Hasegawa, R., A Model Generation Theorem Prover in KL1 using Ramified Stack Algorithm, Proc. of ICLP'91, pp. 535\u2013548, 1991."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Minker, J., On Indefinite Data Bases and the Closed World Assumption, Proc. 6th Int. Conf. on Automated Deduction, Lecture Notes in Computer Science 138, Springer-Verlag: 292\u2013308, 1982.","DOI":"10.1007\/BFb0000066"},{"issue":"No.1","key":"25_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"Minker, J. and Rajasekar, A. A fixpoint semantics for disjunctive logic programs. J. of Logic Programming, Vol. 9, No. 1: 45\u201374 (1990).","journal-title":"J. of Logic Programming"},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","volume":"4","author":"K. A. Ross","year":"1988","unstructured":"Ross, K. A. and Topor, R. W., Inferring Negative Infomation from Disjunctive Databases, J. of Automated Reasoning 4: 397\u2013424 (1988).","journal-title":"J. of Automated Reasoning"},{"key":"25_CR16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00248321","volume":"5","author":"A. Rajaseker","year":"1990","unstructured":"Rajaseker, A., Lobo, J. and Minker, J., Weak Generalized Closed World Assumption, J. of Automated Reasoning 5, 293\u2013307. (1990)","journal-title":"J. of Automated Reasoning"},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00249019","volume":"7","author":"A. Ramsay","year":"1991","unstructured":"Ramsay, A., Generated Relevant Models, J. of Automated Reasoning 7: 359\u2013368 (1991).","journal-title":"J. of Automated Reasoning"},{"key":"25_CR18","unstructured":"Sakama, C. and Inoue, K., Negation in Disjunctive Logic Programs, Proc. of ICLP'93, pp. 703\u2013719 (1993)"},{"key":"25_CR19","unstructured":"Sakama, C. and Inoue, K., On the Equivalence between Disjunctive and Abductive Logic Program, Proc. of ICLP'94, 1994."},{"issue":"2","key":"25_CR20","first-page":"141","volume":"1","author":"A. Yahya","year":"1993","unstructured":"Yahya, A. and Henschen, L.J., Deduction in Non-Horn Databases, J. of Automated Reasoning 1 (2): 141\u2013160 (1993).","journal-title":"J. of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:53:47Z","timestamp":1586570027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603597","9783540450481"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0026833","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}