{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:13:29Z","timestamp":1766441609318},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545071"},{"type":"electronic","value":"9783540384205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54507-7_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:56:46Z","timestamp":1330210606000},"page":"141-155","source":"Crossref","is-referenced-by-count":25,"title":["Extending abduction from propositional to first-order logic"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Marquis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F. [1983]. \u00abMaintaining Knowledge about Temporal Intervals\u00bb, Communications of the Association for Computing Machinery 26, pp. 832\u2013843.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"12_CR2","unstructured":"Aristotle [?]. Organon III: les premiers analytiques, traduction et notes de J. Tricot, librairie philosophique J. Vrin, Paris, 1971."},{"key":"12_CR3","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C.L. Chang","year":"1973","unstructured":"Chang, C.L. and Lee, R.C.T. [1973]. Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(83)90022-1","volume":"28","author":"P.T. Cox","year":"1984","unstructured":"Cox, P.T. and Pietrzykowski, T. [1984]. \u00abA Complete, Nonredundant Algorithm for Reversed Skolemization\u00bb, Theoretical Computer Science 28, pp. 239\u2013261.","journal-title":"Theoretical Computer Science"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Cox, P.T. and Pietrzykowski, T. [1986]. \u00abCauses for Events: Their Computation and Applications\u00bb, Proc. International Conference on Automated Deduction, pp. 608\u2013621.","DOI":"10.1007\/3-540-16780-3_125"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F. and Gallier, J.H. [1984]. \u00abLinear-time Algorithms for Testing the Satisfiability of Propositional Horn Formulae\u00bb, Journal of Logic Programming 3, pp. 267\u2013284.","journal-title":"Journal of Logic Programming"},{"key":"12_CR7","volume-title":"The Decision Problem: Solvable Classes of Quantificational Formulas","author":"B. Dreben","year":"1979","unstructured":"Dreben, B. and Goldfarb, W.D. [1979]. The Decision Problem: Solvable Classes of Quantificational Formulas, Addison-Wesley Publishing Company, Reading."},{"key":"12_CR8","unstructured":"El Ayeb, B., Marquis, P. and Rusinowitch, M. [1990a]. \u00abDeductive \/ Abductive Diagnosis: The DA-Principles\u00bb, Proc. European Conference on Artificial Intelligence, pp. 47\u201352."},{"key":"12_CR9","first-page":"32","volume":"462","author":"B. El Ayeb","year":"1990","unstructured":"El Ayeb, B., Marquis, P. and Rusinowitch, M. [1990b]. \u00abA New Diagnosis Approach by Deduction and Abduction\u00bb, Proc. International Workshop on Expert Systems in Engineering, Lecture Notes in Artificial Intelligence 462, pp. 32\u201346.","journal-title":"Proc. International Workshop on Expert Systems in Engineering, Lecture Notes in Artificial Intelligence"},{"key":"12_CR10","volume-title":"Logic for Computer Science \u2014 Foundations of Automatic Theorem Proving","author":"J.H. Gallier","year":"1986","unstructured":"Gallier, J.H. [1986]. Logic for Computer Science \u2014 Foundations of Automatic Theorem Proving, Harper & Row, New York."},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(87)90103-7","volume":"24","author":"G. Gottlob","year":"1987","unstructured":"Gottlob, G. [1987]. \u00abSubsumption and Implication\u00bb, Information Processing Letters 24, pp. 109\u2013111.","journal-title":"Information Processing Letters"},{"key":"12_CR12","first-page":"543","volume":"449","author":"P. Jackson","year":"1990","unstructured":"Jackson, P. and Pais, J. [1990]. \u00abComputing Prime Implicants\u00bb, Proc. International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 449, pp. 543\u2013557.","journal-title":"Proc. International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0747-7171(08)80029-6","volume":"9","author":"A. Kean","year":"1990","unstructured":"Kean, A. and Tsiknis, G. [1990]. \u00abAn Incremental Method for Generating Prime Implicants\/Implicates\u00bb, Journal of Symbolic Computation 9, pp. 185\u2013206.","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/S0019-9958(77)90175-9","volume":"35","author":"P. Kugel","year":"1977","unstructured":"Kugel, P. [1977]. \u00abInduction, Pure and Simple\u00bb, Information and Control 35, pp. 276\u2013336.","journal-title":"Information and Control"},{"key":"12_CR15","volume-title":"Alg\u00e8bre de Boole et machines logiques","author":"J. Kuntzmann","year":"1967","unstructured":"Kuntzmann, J. and Naslin, P. [1967]. Alg\u00e8bre de Boole et machines logiques, Dunod, Paris."},{"key":"12_CR16","unstructured":"Lee, R.C.T. [1967]. A Completeness Theorem and a Computer Program for Finding Theorems Derivable from Given Axioms, Ph.D. thesis, University of California."},{"key":"12_CR17","unstructured":"Marquis, P. [1989]. \u00abComputing Most Specific Generalisations in Propositional Calculus\u00bb, Proc. European Working Session on Learning, pp. 135\u2013138."},{"key":"12_CR18","unstructured":"Marquis, P. [1991]. Contribution \u00e0 l'\u00e9tude des m\u00e9thodes de construction d'hypoth\u00e8ses en intelligence artificielle, Ph.D. thesis, Universit\u00e9 de Nancy I."},{"key":"12_CR19","first-page":"386","volume":"478","author":"P. Mathieu","year":"1990","unstructured":"Mathieu, P. and Delahaye, J.P. [1990]. \u00abThe Logical Compilation of Knowledge Bases\u00bb, Proc. European Workshop JELIA'90, Lecture Notes in Artificial Intelligence 478, pp. 386\u2013398.","journal-title":"Proc. European Workshop JELIA'90, Lecture Notes in Artificial Intelligence"},{"key":"12_CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1207\/s15516709cog0602_1","volume":"6","author":"D. McDermott","year":"1982","unstructured":"McDermott, D. [1982]. \u00abA Temporal Logic for Reasoning About Processes and Plans\u00bb, Cognitive Science 6, pp. 101\u2013155.","journal-title":"Cognitive Science"},{"key":"12_CR21","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. [1972]. \u00abA Note on Linear Resolution Strategies in Consequence-Finding\u00bb, Artificial Intelligence 3, pp. 175\u2013180.","journal-title":"Artificial Intelligence"},{"key":"12_CR22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(71)90009-9","volume":"2","author":"C.G. Morgan","year":"1971","unstructured":"Morgan, C.G. [1971]. \u00abHypothesis Generation by Machine\u00bb, Artificial Intelligence 2, pp. 179\u2013187.","journal-title":"Artificial Intelligence"},{"key":"12_CR23","unstructured":"Morgan, C.G. [1975]. \u00abAutomated Hypothesis Generation Using Extended Inductive Resolution\u00bb, Proc. International Joint Conference on Artificial Intelligence, pp. 351\u2013356."},{"key":"12_CR24","volume-title":"Collected Papers of Charles Sanders Peirce, vol. 2","author":"C.S. Peirce","year":"1931","unstructured":"Peirce, C.S. [1931]. Collected Papers of Charles Sanders Peirce, vol. 2, C. Hartsthrone and P. Weiss (ed.), Harvard University Press, Cambridge."},{"key":"12_CR25","first-page":"101","volume":"6","author":"G.D. Plotkin","year":"1971","unstructured":"Plotkin, G.D. [1971]. \u00abA Further Note on Inductive Generalisation\u00bb, Machine Intelligence 6, pp. 101\u2013124.","journal-title":"Machine Intelligence"},{"key":"12_CR26","unstructured":"Pople, H.E. Jr [1973]. \u00abOn the Mechanization of Abductive Logic\u00bb, Proc. International Joint Conference on Artificial Intelligence, pp. 147\u2013152."},{"key":"12_CR27","unstructured":"Provan, G.M. [1990]. \u00abThe Computational Complexity of Multiple-Context Truth Maintenance Systems\u201d, Proc. European Conference on Artificial Intelligence, pp. 523\u2013527."},{"key":"12_CR28","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1080\/00029890.1959.11989404","volume":"66","author":"W.V. Quine","year":"1959","unstructured":"Quine, W.V. [1959]. \u00abOn Cores and Prime Implicants of Truth Functions\u00bb, American Mathematical Monthly 66, pp. 755\u2013760.","journal-title":"American Mathematical Monthly"},{"key":"12_CR29","unstructured":"Reiter, R. and de Kleer, J. [1987]. \u00abFoundations of Assumption-Based Truth Maintenance Systems: Preliminary Report\u00bb, Proc. National Conference on Artificial Intelligence (AAAI 87), pp. 183\u2013188."},{"issue":"1","key":"12_CR30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A. [1965]. \u00abA Machine-oriented Logic based on the Resolution Principle\u00bb, Journal of the Association for Computing Machinery 12:1, pp. 23\u201341.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"12_CR31","unstructured":"Schmidt-Schau\u00df, M. [1986]. \u00abSome Undecidable Classes of Clause Sets\u00bb, SEKI-Report SR-86-08, Fachbereich Informatik, Kaiserslautern Universit\u00e4t."},{"key":"12_CR32","unstructured":"[Selman, B. and Levesque, H.J. [1990]. \u00abAbductive and Default Reasoning: A Computational Core\u00bb, Proc. National Conference on Artificial Intelligence (AAAI 90), pp. 343\u2013348."},{"key":"12_CR33","unstructured":"Slagle, J.R., Chang, C.L. and Lee, R.C.T. [1969]. \u00abCompleteness Theorems for Semantic Resolution in Consequence-Finding\u00bb, Proc. International Joint Conference on Artificial Intelligence, pp. 281\u2013285."},{"issue":"4","key":"12_CR34","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/T-C.1970.222917","volume":"19","author":"J.R. Slagle","year":"1970","unstructured":"Slagle, J.R., Chang, C.L. and Lee, R.C.T. [1970]. \u00abA New Algorithm for Generating Prime Implicants\u00bb, IEEE Transactions on Computers C-19(4), pp. 304\u2013310.","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR35","unstructured":"Stickel, M.E. [1988]. \u00abA Prolog-like Inference System for Computing Minimum-Cost Abductive explanations in Natural-Language Interpretation\u00bb, Proc. International Computer Science Conference, Hong-Kong."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Artificial Intelligence Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54507-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:32Z","timestamp":1619572952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54507-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545071","9783540384205"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-54507-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}