{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:41Z","timestamp":1725487661920},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660866"},{"type":"electronic","value":"9783540487548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48754-9_9","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:20:56Z","timestamp":1184588456000},"page":"51-66","source":"Crossref","is-referenced-by-count":5,"title":["Merge Path Improvements for Minimal Model Hyper Tableaux"],"prefix":"10.1007","author":[{"given":"Peter","family":"Baumgartner","sequence":"first","affiliation":[]},{"given":"J. D.","family":"Horton","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Spencer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"9_CR1","unstructured":"C. Aravindan and P. Baumgartner. A Rational and Efficient Algorithm for View Deletion in Databases. In Proc. ILPS, New York, 1997. The MIT Press."},{"key":"9_CR2","unstructured":"P. Baumgartner, P. Fr\u00f6hlich, U. Furbach, and W. Nejdl. Semantically Guided Theorem Proving for Diagnosis Applications. In Proc. IJCAI 97, pages 460\u2013465, Nagoya, 1997."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"P. Baumgartner, U. Furbach, and I. Niemel\u00e4. Hyper Tableaux. In Proc. JELIA 96, LNAI 1126. Springer, 1996.","DOI":"10.1007\/3-540-61630-6_1"},{"key":"9_CR4","unstructured":"P. Baumgartner, J.D. Horton, and B. Spencer. Merge Path Improvements for Minimal Model Hyper Tableaux. Fachberichte Informatik 1\u201399, Universit\u00e4t Koblenz-Landau, 1999. URL: http:\/\/www.uni-koblenz.de\/fb4\/publikationen\/gelbereihe\/RR-1-99.ps.gz"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"F. Bry and A. Yahya. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux. In Miglioli et al. [11], pages 143\u2013159.","DOI":"10.1007\/3-540-61208-4_10"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are \u03c0 2 p -complete. Theoretical Computer Science, 114:231\u2013245, 1993.","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0004-3702(96)00046-X","volume":"92","author":"J. D. Horton","year":"1997","unstructured":"J. D. Horton and B. Spencer. Clause trees: a tool for understanding and implementing resolution in automated reasoning. Artificial Intelligence, 92:25\u201389, 1997.","journal-title":"Artificial Intelligence"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"K. Inoue, M. Koshimura, and R. Hasegawa. Embedding Negation as Failure into a Model Generation Theorem Prover. In D. Kapur, editor, In Proc. CADE 11, LNAI 607, pp. 400\u2013415. Springer, 1992.","DOI":"10.1007\/3-540-55602-8_180"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994.","DOI":"10.1007\/BF00881947"},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BFb0012847","volume-title":"Proc. CADE","author":"R. Manthey","year":"1988","unstructured":"R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In E. Lusk and R. Overbeek, editors, Proc. CADE 9, LNCS 310, pp. 415\u2013434. Springer, 1988."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors. Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071. Springer, 1996.","DOI":"10.1007\/3-540-61208-4"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4. A Tableau Calculus for Minimal Model Reasoning. In Miglioli et al. [11].","DOI":"10.1007\/3-540-61208-4_18"},{"key":"9_CR13","unstructured":"I. Niemel\u00e4. Implementing circumscription using a tableau method. In Proc. ECAI, pages 80\u201384, Budapest, 1996. John Wiley."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00247828","volume":"9","author":"N. Olivetti","year":"1992","unstructured":"N. Olivetti. A tableaux and sequent calculus for minimal entailment. Journal of Automated Reasoning, 9:99\u2013139, 1992.","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T. Przymusinski","year":"1989","unstructured":"T. Przymusinski. An Algorithm to Compute Circumscription. Artificial Intelligence, 38:49\u201373, 1989.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"R. Reiter. A Theory of Diagnosis from First Principles. Artificial Intelligence, 32(1):57\u201395, Apr. 1987.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48754-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:29:45Z","timestamp":1556666985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48754-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660866","9783540487548"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48754-9_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}