{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:09:26Z","timestamp":1725458966547},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0037028","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:39:32Z","timestamp":1138185572000},"page":"34-53","source":"Crossref","is-referenced-by-count":7,"title":["An abductive procedure for the CMS\/ATMS"],"prefix":"10.1007","author":[{"given":"Katsumi","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0004-3702(85)90040-2","volume":"25","author":"G. Bossu","year":"1985","unstructured":"Bossu, G. and Siegel, P., \u201cSaturation, Nonmonotonic Reasoning, and the Closed-World Assumption\u201d, Artificial Intelligence\n25 (1985), pp.23\u201367.","journal-title":"Artificial Intelligence"},{"key":"3_CR2","unstructured":"Chang, C. L., and Lee, R. C. T., Symbolic Logic and Mechanical Theorem Proving (Academic Press, 1973)."},{"key":"3_CR3","unstructured":"Cox, P. T. and Pietrzykowski, T., \u201cCauses for Events: Their Computation and Applications\u201d, Proc. 8th Conf. on Automated Deduction, Lecture Notes in Computer Science 230, Springer-Verlag (1986), pp.608\u2013621."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","volume":"28","author":"J. Kleer de","year":"1986","unstructured":"de Kleer, J., \u201cAn Assumption-based TMS\u201d, Artificial Intelligence\n28 (1986), pp.127\u2013162.","journal-title":"Artificial Intelligence"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0004-3702(86)90081-0","volume":"28","author":"J. Kleer de","year":"1986","unstructured":"de Kleer, J., \u201cExtending the ATMS\u201d, Artificial Intelligence\n28 (1986), pp.163\u2013196.","journal-title":"Artificial Intelligence"},{"key":"3_CR6","unstructured":"de Kleer, J., \u201cA General Labeling Algorithm for Assumption-based Truth Maintenance\u201d, Proc. AAAI-88 (1988), pp.188\u2013192."},{"key":"3_CR7","unstructured":"de Kleer, J., Propositional Inference in CSP and ATMS Techniques, SSL Paper P89-00023, Xerox Palo Alto Research Center, 1989."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Dressler, O., \u201cAn Extended Basic ATMS\u201d, Proc. 2nd Int'l Workshop on Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence 346, Springer-Verlag (1989), pp.143\u2013163.","DOI":"10.1007\/3-540-50701-9_25"},{"key":"3_CR9","unstructured":"Finger, J. J., Exploiting Constraints in Design Synthesis, Department of Computer Science, STAN-CS-88-1204, Stanford University, 1987."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","volume":"39","author":"M. L. Ginsberg","year":"1989","unstructured":"Ginsberg, M. L., \u201cA Circumscriptive Theorem Prover\u201d, Artificial Intelligence\n39 (1989), pp.209\u2013230.","journal-title":"Artificial Intelligence"},{"key":"3_CR11","unstructured":"Inoue, K., \u201cGeneralizing the ATMS: A Model-based Approach (Preliminary Report)\u201d, IPSJ SIG Reports, SIG AI 63-3, pp.21\u201328, Information Processing Society of Japan, March 1989."},{"key":"3_CR12","unstructured":"Inoue, K., Procedural Interpretation for an Extended ATMS, ICOT Technical Report TR-547, ICOT, March 1990."},{"key":"3_CR13","unstructured":"Inoue, K. and Helft, N., \u201cOn Theorem Provers for Circumscription\u201d, Proc. CSCSI-90, Ottawa (May 1990), pp.212\u2013219."},{"key":"3_CR14","unstructured":"Kean, A. and Tsiknis, G., An Incremental Method for Generating Prime Implicants\/Implicates, Technical Report 88-16, Department of Computer Science, The University of British Columbia, 1988."},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R. A. Kowalski","year":"1971","unstructured":"Kowalski, R. A. and Kuhner, D. G., \u201cLinear Resolution with Selection Function\u201d, Artificial Intelligence\n2 (1971), pp.227\u2013260.","journal-title":"Artificial Intelligence"},{"key":"3_CR16","unstructured":"Levesque, H. J., \u201cA Knowledge-level Account of Abduction (preliminary version)\u201d, Proc. IJCAI-89 (1989), pp.1061\u20131067."},{"key":"3_CR17","unstructured":"Loveland, D., Automated Theorem Proving: A Logical Basis, (North-Holland, 1978)."},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0004-3702(72)90047-1","volume":"3","author":"E. Minicozzi","year":"1972","unstructured":"Minicozzi, E. and Reiter, R., \u201cA Note on Linear Resolution Strategies in Consequence-Finding\u201d, Artificial Intelligence\n3 (1972), pp.175\u2013180.","journal-title":"Artificial Intelligence"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","volume":"36","author":"D. Poole","year":"1988","unstructured":"Poole, D., \u201cA Logical Framework for Default Reasoning\u201d, Artificial Intelligence\n36 (1988), pp.27\u201347.","journal-title":"Artificial Intelligence"},{"key":"3_CR20","unstructured":"Pople, H. E., \u201cOn the Mechanization of Abductive Logic\u201d, Proc. IJCAI-73 (1973), pp.147\u2013152."},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T. C. Przymusinski","year":"1989","unstructured":"Przymusinski, T. C., \u201cAn Algorithm to Compute Circumscription\u201d, Artificial Intelligence\n38 (1989), pp.49\u201373.","journal-title":"Artificial Intelligence"},{"key":"3_CR22","unstructured":"Reiter, R. and de Kleer, J., \u201cFoundations of Assumption-based Truth Maintenance Systems: Preliminary Report\u201d, Proc. AAAI-87 (1987), pp.183\u2013188."},{"key":"3_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0004-3702(76)90021-7","volume":"7","author":"R. Shostak","year":"1976","unstructured":"Shostak, R., \u201cRefutation Graphs\u201d, Artificial Intelligence\n7 (1976), pp.51\u201364.","journal-title":"Artificial Intelligence"},{"key":"3_CR24","unstructured":"Siegel, P., Repr\u00e9sentation et Utilisation de la Connaissance en Calcul Propositionnel, PhD thesis, University of Aix-Marseille II, 1987."},{"key":"3_CR25","unstructured":"Slagle, J. R., Chang, C. L., and Lee, R. C. T., \u201cCompleteness Theorems for Semantic Resolution in Consequence Finding\u201d, Proc. IJCAI-69 (1969), pp.281\u2013285."},{"key":"3_CR26","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/PGEC.1967.264648","volume":"16","author":"P. Tison","year":"1967","unstructured":"Tison, P., \u201cGeneralized Consensus Theory and Application to the Minimization of Boolean Functions\u201d, IEEE transactions on electronic computers\n16 (1967), pp.446\u2013456.","journal-title":"IEEE transactions on electronic computers"}],"container-title":["Lecture Notes in Computer Science","Truth Maintenance Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037028.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:21:52Z","timestamp":1607534512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543058"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0037028","relation":{},"subject":[]}}