{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:56Z","timestamp":1761620876571},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bf00881957","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T07:38:56Z","timestamp":1104133136000},"page":"223-242","source":"Crossref","is-referenced-by-count":31,"title":["Tableau-based characterization and theorem proving for default logic"],"prefix":"10.1007","volume":"13","author":[{"given":"Vincent","family":"Risch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camilla B.","family":"Schwind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Besnard, P., Quiniou, R., and Quinton, P.: A theorem-prover for a decidable subset of default logic,Proc. AAAI, (1983), pp. 27?30."},{"key":"CR2","unstructured":"Beth, E. W.:The Foundations of Mathematics, North-Holland, 1959."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Besnard, P. and Siegel, P.: Supposition-based logic for automated nonmonotonic reasoning,Proc. 9th Conference on Automated Deduction, Argonne, 1988.","DOI":"10.1007\/BFb0012860"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","volume":"25","author":"G. Bossu","year":"1985","unstructured":"Bossu, G. and Siegel, P.: Saturation, nonmonotonic reasoning and the closed-world assumption,Artificial Intelligence 25 (1985), 13?63.","journal-title":"Artificial Intelligence"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Brown, F. M.: A common sense theory of nonmonotonic reasoning,Proc. 8th Conference on Automated Deduction, Oxford, Lecture Notes in Computer Science,230, Springer-Verlag, 1986, pp. 209?228.","DOI":"10.1007\/3-540-16780-3_92"},{"issue":"1","key":"CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(87)90081-6","volume":"31","author":"D. W. Etherington","year":"1987","unstructured":"Etherington, D. W.: Formalizing nonmonotonic reasoning systems,Artificial Intelligence 31(1), (1987), 81?132.","journal-title":"Artificial Intelligence"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Fitting, M.:First-Order Logic and Automated Theorem Proving, Texts and Monographs in Computer Science, Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4684-0357-2"},{"issue":"3","key":"CR8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1093\/logcom\/2.3.349","volume":"2","author":"M. Fitting","year":"1992","unstructured":"Fitting, M., Marek, V., and Truszczynski, M.: The pure logic of necessitation,J. Logic and Computation 2(3) (1992), 349?373.","journal-title":"J. Logic and Computation"},{"key":"CR9","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.: A circumscriptive theorem prover,Artificial Intelligence 39 (1989), 209?230.","journal-title":"Artificial Intelligence"},{"key":"CR10","unstructured":"Gueirreiro, R. A., Casanova, M. A., and Hermely, A. S.: Contributions to a proof theory for generic defaults,Proc. 9th European Conference on Artificial Intelligence, 1990, pp. 213?218."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Junker, U. and Brewka, G.: Handling partially ordered defaults in TMS,Proc. European Conference on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France, Lecture Notes in Computer Science548, Springer-Verlag, 1991, pp. 211?218.","DOI":"10.1007\/3-540-54659-6_91"},{"key":"CR12","unstructured":"Junker, U. and Konolige, K.: Computing the extensions of autoepistemic and default logics with a truth maintenance system,Proc. AAAI-90, Boston, 1990, pp. 278?283."},{"key":"CR13","unstructured":"Kuhna, P.: Circumscription and minimal models for propositional logics,Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, pp. 143?155, 1991, MPI-I-93-213."},{"key":"CR14","unstructured":"Lafon, E. and Schwind, C.: A theorem prover for action performance,Proc. 8th European Conference on Artificial Intelligence, 1988, pp. 541?546."},{"key":"CR15","unstructured":"Lifschitz, V.: Computing circumscription,Proc. International Joint Conference on Artificial Intelligence, 1985, pp. 121?127."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Levy, F.: Computing extensions of default theories,Proc. European Conference on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France, Lecture Notes in Computer Science548, Springer-Verlag, 1991, pp. 219?226.","DOI":"10.1007\/3-540-54659-6_92"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-8640.1988.tb00086.x","volume":"4","author":"W. Lukaszewicz","year":"1988","unstructured":"Lukaszewicz, W.: Considerations on default logic ? an alternative approach,Computational Intelligence 4 (1988), 1?16.","journal-title":"Computational Intelligence"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription a form of non-monotonic reasoning,Artificial Intelligence 13 (1980), 27?39.","journal-title":"Artificial Intelligence"},{"key":"CR19","unstructured":"Moore, R.: Autoepistemic logic, inNonstandard Logics for Automated Reasoning (eds P. Smets, A. Mamdani, D. Dubois, and H. Prade), Academic Press, pp. 105?136."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I.: Decision procedure for autoepistemic logic,Proc. 9th Conference on Automated Deduction, Springer-Verlag, 1988, pp. 676?684.","DOI":"10.1007\/BFb0012865"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00247828","volume":"9","author":"N. Olivetti","year":"1992","unstructured":"Olivetti, N.: Tableaux and sequent calculus for minimal entailment,J. Automated Reasoning 9 (1992), 99?139.","journal-title":"J. Automated Reasoning"},{"key":"CR22","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.: An algorithm to compute circumscription,Artificial Intelligence 38 (1989), 49?73.","journal-title":"Artificial Intelligence"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning,Artificial Intelligence 13 (1980), 81?132.","journal-title":"Artificial Intelligence"},{"key":"CR24","unstructured":"Risch, V.: Une caract\u00e9risation en termes de tableaux s\u00e9mantiques pour la logique des d\u00e9faults au sens de Lukaszewicz, 1992,Revue d'Intelligence Artificielle 7(1) (1993)."},{"key":"CR25","unstructured":"Sch\u00fctte, K.: Beweistheorie, Springer-Verlag, 1960."},{"key":"CR26","unstructured":"Schwind, C.: Un d\u00e9monstrateur de th\u00e9or\u00e8mes pour des logiques modales et temporelles en PROLOG,5th Congress AFCET Reconnaissance des Formes et Intelligence Artificielle, Grenoble, France, 1985, pp. 897?913."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"Schwind, C.: A tableau based theorem prover for a decidable subset of default logic,Proc. 10th Conference on Automated Deduction, Springer-Verlag, 1990, pp. 541?546.","DOI":"10.1007\/3-540-52885-7_112"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Smullyan, R.:First-Order Logic, Springer-Verlag, 1968.","DOI":"10.1007\/978-3-642-86718-7"},{"key":"CR29","unstructured":"Thistlewaite, P. B., McRobbie, M. D., and Meyer, R. R.:Automated Theorem Proving in Non-Classical Logics, Pitman, 1988."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881957.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881957\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T23:54:11Z","timestamp":1586044451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994]]}},"alternative-id":["BF00881957"],"URL":"https:\/\/doi.org\/10.1007\/bf00881957","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}