{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:05Z","timestamp":1725493445700},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_22","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:28:09Z","timestamp":1184588889000},"page":"358-375","source":"Crossref","is-referenced-by-count":0,"title":["Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog"],"prefix":"10.1007","author":[{"given":"Nikolay","family":"Pelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0020-0190(81)90074-0","volume":"12","author":"M. Bruynooghe","year":"1981","unstructured":"M. Bruynooghe. Solving combinatorial search problems by intelligent backtracking. Information Processing Letters, 12(1):36\u201339, Feb. 1981.","journal-title":"Information Processing Letters"},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0056611","volume-title":"Principles of Declarative Programming, 10th International Symposium","author":"M. Bruynooghe","year":"1998","unstructured":"M. Bruynooghe, H. Vandecasteele, D. A. de Waal, and M. Denecker. Detecting unsolvable queries for definitive logic programs. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Principles of Declarative Programming, 10th International Symposium, volume 1490 of Lecture Notes in Computer Science, pages 118\u2013133. Springer Verlag, Sept. 1998."},{"doi-asserted-by":"crossref","unstructured":"M. Bruynooghe, H. Vandecasteele, D. A. de Waal, and M. Denecker. Detecting unsolvable queries for definitive logic programs. Journal of Functional and Logic Programming, 1999. To Appear.","key":"22_CR3","DOI":"10.1007\/BFb0056611"},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20\u201374, Jan. 1996.","journal-title":"Journal of the ACM"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0743-1066(95)00064-X","volume":"25","author":"M. Codish","year":"1995","unstructured":"M. Codish and B. Demoen. Analyzing logic programs using \u201cPROP\u201d-ositional logic programs and a magic wand. Journal of Logic Programming, 25(3):249\u2013274, Dec. 1995.","journal-title":"Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.","key":"22_CR6","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/8.4.511","volume":"8","author":"N. Peltier","year":"1998","unstructured":"N. Peltier. A new method for automated finite model building exploiting failures and symmetries. Journal of Logic and Computation, 8(4):511\u2013543, 1998.","journal-title":"Journal of Logic and Computation"},{"key":"22_CR8","first-page":"227","volume":"1","author":"J. A. Robinson","year":"1965","unstructured":"J. A. Robinson. Automatic deduction with hyper-resolution. Int. Journal of Computer Math., 1:227\u2013234, 1965.","journal-title":"Int. Journal of Computer Math."},{"issue":"2","key":"22_CR9","first-page":"442","volume":"23","author":"K. Sagonas","year":"1994","unstructured":"K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. SIGMOD Record (ACM Special Interest Group on Management of Data), 23(2):442\u2013453, June 1994.","journal-title":"SIGMOD Record (ACM Special Interest Group on Management of Data)"},{"unstructured":"J. Slaney. Finder version 3.0-notes and guides. Technical report, Centre for Information Science Research, Australian National University, July 1995.","key":"22_CR10"},{"unstructured":"C. B. Suttner and G. Sutcliffe. The TPTP problem library (TPTP v2.1.0). Report AR-97-04, Fakult\u00e4t f\u00fcr Informatik der Technischen Universit\u00e4t M\u00fcnchen, 1997.","key":"22_CR11"},{"unstructured":"J. Zhang and H. Zhang. SEM: a system for enumerating models. In C. S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 298\u2013303, San Mateo, Aug. 1995. Morgan Kaufmann.","key":"22_CR12"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:38:53Z","timestamp":1556667533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}