{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:55Z","timestamp":1761620875067},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995]]},"DOI":"10.1007\/bf00881832","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T16:11:47Z","timestamp":1104163907000},"page":"95-165","source":"Crossref","is-referenced-by-count":27,"title":["A new methodology for query answering in default logics via structure-oriented theorem proving"],"prefix":"10.1007","volume":"15","author":[{"given":"T.","family":"Schaub","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Baader, F. and Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms, in B. Nebel, C. Rich, and W. Swartout (eds),Proc. 3rd Int. Conf. Principles of Knowledge Representation and Reasoning, Cambridge, MA, pp. 306?317 October 1992."},{"key":"CR2","unstructured":"Besnard, P., Quiniou, R. and Quinton, P.: A theorem-prover for a decidable subset of default logic, inProc. AAAI Nat. Conf. Artificial Intelligence, 1983, pp. 27?30."},{"key":"CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W. Bibel","year":"1987","unstructured":"Bibel, W.:Automated Theorem Proving, 2nd edn, Vieweg, Braunschweig, 1987.","edition":"2nd edn"},{"key":"CR4","first-page":"153","volume-title":"Nonmonotonic and Inductive Logic","author":"S. Brass","year":"1991","unstructured":"Brass, S.: Deduction with supernormal defaults, in P. Schmitt, G. Brewka and K. Jantke (eds),Nonmonotonic and Inductive Logic, Springer, Berlin, 1991, pp. 153?174."},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0004-3702(91)90099-6","volume":"50","author":"G. Brewka","year":"1991","unstructured":"Brewka, G.: Cumulative default logic: In defense of nonmonotonic inference rules,Artificial Intelligence 50(2) (1991), 183?205.","journal-title":"Artificial Intelligence"},{"key":"CR6","volume-title":"Nonmonotonic Reasoning: Logical Foundations of Commonsense","author":"G. Brewka","year":"1991","unstructured":"Brewka, G.:Nonmonotonic Reasoning: Logical Foundations of Commonsense, Cambridge University Press, Cambridge, 1991."},{"key":"CR7","volume-title":"European Workshop on Logics in Artificial Intelligence (JELIA'94)","author":"G. Brewka","year":"1994","unstructured":"Brewka, G.: Adding priorities and specificity to default logic, in L. Pereira and D. Pearce (eds),European Workshop on Logics in Artificial Intelligence (JELIA'94), Springer, Berlin, 1994."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Cadoli, M., Eiter, T. and Gottlob, G.: Default logic as a query language, in J. Doyle, P. Torasso and E. Sandewall (eds),Proc. 4th Int. Conf. Principles of Knowledge Representation and Reasoning, 1994.","DOI":"10.1016\/B978-1-4832-1452-8.50106-8"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Cadoli, M. and Schaerf, M.: A survey on complexity results for non-monotonic logics,J. Logic Programming 17 (1993).","DOI":"10.1016\/0743-1066(93)90029-G"},{"key":"CR10","unstructured":"Delgrande, J. and Jackson, W.: Default logic revisited, in J. Allen, R. Fikes and E. Sandewall (eds),Proc. 2nd Int. Conf. Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, 1991, pp. 118?127."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(94)90106-6","volume":"70","author":"J. Delgrande","year":"1994","unstructured":"Delgrande, J., Schaub, T. and Jackson, W.: Alternative approaches to default logic,Artificial Intelligence 70 (1994), 167?237.","journal-title":"Artificial Intelligence"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0021964","volume-title":"European Workshop on Logics in Artificial Intelligence","author":"Y. Dimopoulos","year":"1994","unstructured":"Dimopoulos, Y.: The computational value of joint consistency, in L. Pereira and D. Pearce (eds),European Workshop on Logics in Artificial Intelligence, Springer, Berlin, 1994, pp. 50?65."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","volume":"12","author":"J. Doyle","year":"1979","unstructured":"Doyle, J.: A truth maintenance system,Artificial Intelligence 12 (1979), 231?272.","journal-title":"Artificial Intelligence"},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-84222-0","volume-title":"Relative Complexities of First Order Calculi","author":"E. Eder","year":"1992","unstructured":"Eder, E.:Relative Complexities of First Order Calculi, Vieweg, Braunschweig, 1992."},{"key":"CR15","series-title":"Research Notes in Artificial Intelligence","volume-title":"Reasoning with Incomplete Information","author":"D. Etherington","year":"1988","unstructured":"Etherington, D.:Reasoning with Incomplete Information, Research Notes in Artificial Intelligence, Pitman\/Morgan Kaufmann, London, 1988."},{"key":"CR16","unstructured":"Etherington, D. and Reiter, R.: On inheritance hierarchies with exceptions, inProc. AAAI Nat. Conf. Artificial Intelligence, 1983, pp. 104?108."},{"key":"CR17","unstructured":"Gelfond, M. and Lifschitz, V.: Logic programs with classical negation, inProc. Int. Conf. Logic Programming, 1990, pp. 579?597."},{"issue":"3","key":"CR18","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"Gottlob, G.: Complexity results for nonmonotonic logics,J. Logic and Computation 2(3) (1992), 397?425.","journal-title":"J. Logic and Computation"},{"key":"CR19","unstructured":"Junker, U. and Konolige, K.: Computing the extensions of autoepistemic and default logic with a TMS, inProc. AAAI Nat. Conf. Artificial Intelligence, 1990."},{"issue":"2","key":"CR20","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","volume":"35","author":"K. Konolige","year":"1988","unstructured":"Konolige, K.: On the relation between default and autoepistemic logic,Artificial Intelligence 35(2) (1988), 343?382.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00244282","volume":"8","author":"R. Letz","year":"1992","unstructured":"Letz, R., Bayerl, S., Schumann, J. and Bibel, W.Setheo: A high-performance theorem prover,J. Automated Reasoning 8(2) (1992), 183?212.","journal-title":"J. Automated Reasoning"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-8640.1988.tb00086.x","volume":"4","author":"W. ?ukaszewicz","year":"1988","unstructured":"?ukaszewicz, W.: Considerations on default logic-an alternative approach,Computational Intelligence 4 (1988), 1?16.","journal-title":"Computational Intelligence"},{"key":"CR23","unstructured":"Mercer, R.: Using default logic to derive natural language suppositions, inProc. Canadian Soc. Computational Studies of Intelligence Conference, 1988, pp. 14?21."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R. Moore","year":"1985","unstructured":"Moore, R.: Semantical considerations on nonmonotonic logics,Artificial Intelligence 25 (1985), 75?94.","journal-title":"Artificial Intelligence"},{"key":"CR25","unstructured":"Neugebauer, G.: From horn clauses to first order logic: A graceful ascent, Technical Report AIDA-92-21, FG Intellektik, FB Informatik, TH Darmstadt, 1992."},{"key":"CR26","unstructured":"Neugebauer, G. and Schaub, T.: A pool-based connection calculus, Technical Report AIDA-91-2, FG Intellektik, FB Informatik, TH Darmstadt, Alexanderstra\u00dfe 10, D-64283 Darmstadt, Germany, January 1991."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I.: Decision procedure for autoepistemic logic, inProc. Conf. Automated Deduction, Argonne, 1988, pp. 675?684.","DOI":"10.1007\/BFb0012865"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I.: A decision method for nonmonotonic reasoning based on autoepistemic reasoning, in J. Doyle, P. Torasso and E. Sandewall (eds),Proc. 4th Int. Conf. Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, 1994, pp. 473?484.","DOI":"10.1016\/B978-1-4832-1452-8.50139-1"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-1-4612-4792-0_13","volume-title":"The Knowledge Frontier: Essays in the Representation of Knowledge, Chapter 13","author":"D. Poole","year":"1987","unstructured":"Poole, D., Goebel, R. and Aleliunas, R.: Theorist: A logical reasoning system for defaults and diagnosis, in N. Cercone and G. McCalla (eds),The Knowledge Frontier: Essays in the Representation of Knowledge, Chapter 13, Springer, New York, 1987, pp. 331?352."},{"issue":"1?2","key":"CR30","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(1?2) (1980), 81?132.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"CR31","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles,Artificial Intelligence 32(1) (1987), 57?96.","journal-title":"Artificial Intelligence"},{"key":"CR32","unstructured":"Risch, V.: Les Tableaux Analytiques au Service des Logiques de Defauts, PhD Thesis, Universit\u00e9 Aix-Marseille II, G.I.A., Parc Scientifique et Technologique de Luminy, April 1993."},{"key":"CR33","unstructured":"Rothschild, A.: Algorithmische Untersuchungen zu Defaultlogiken, Master Thesis, FG Intellektik, FB Informatik, TH Darmstadt, Alexanderstra\u00dfe 10, D-64283 Darmstadt, 1993."},{"key":"CR34","unstructured":"Schaub, T.: Assertional default theories: A semantical view, in J. Allen, R. Fikes and E. Sandewall (eds),Proc. 2nd Int. Conf. Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, 1991, pp. 496?506."},{"key":"CR35","first-page":"304","volume-title":"Proc. European Conf. Symbolic and Quantitative Approaches to Uncertainty","author":"T. Schaub","year":"1991","unstructured":"Schaub, T.: On commitment and cumulativity in default logics, in R. Kruse and P. Siegel (eds),Proc. European Conf. Symbolic and Quantitative Approaches to Uncertainty, Springer, Berlin, 1991, pp. 304?309."},{"key":"CR36","unstructured":"Schaub, T.: Considerations on Default Logics, PhD Thesis, Technische Hochshule Darmstadt, Alexanderstra\u00dfe 10, D-64283 Darmstadt, Germany, November 1992."},{"key":"CR37","first-page":"304","volume-title":"Proc. European Conf. on Artificial Intelligence","author":"T. Schaub","year":"1992","unstructured":"Schaub, T.: On constrained default theories, in B. Neumann (ed.),Proc. European Conf. on Artificial Intelligence, Wiley, New York, 1992, pp. 304?308."},{"key":"CR38","first-page":"312","volume-title":"Proc. European Conf. Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"T. Schaub","year":"1993","unstructured":"Schaub, T.: Variations of constrained default logic, in M. Clarke, R. Kruse and S. Moral (eds),Proc. European Conf. Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Springer, Berlin, 1993, pp. 312?317."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1007\/3-540-58495-1_58","volume-title":"8th Int. Symp. Methodologies for Intelligent Systems","author":"T. Schaub","year":"1994","unstructured":"Schaub, T.: Computing queries from prioritized default theories, in Z. Ras and M. Zemankova (eds),8th Int. Symp. Methodologies for Intelligent Systems, Springer, Berlin, 1994, pp. 584?593."},{"key":"CR40","unstructured":"Schaub, T. and Thielscher, M.: A method for skeptical reasoning in constrained default logic, Technical Report, FG Intellektik, FB Informatik, TH Darmstadt, 1994."},{"key":"CR41","volume-title":"CADE-10","author":"C. Schwind","year":"1990","unstructured":"Schwind, C.: A tableaux-based theorem prover for a decidable subset of default logic, in M. E. Stickel (ed.),CADE-10, Springer, Berlin, 1990."},{"key":"CR42","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-54659-6_107","volume-title":"Proc. European Conf. Symbolic and Quantitative Approaches to Uncertainty","author":"C. Schwind","year":"1991","unstructured":"Schwind, C. and Risch, V.: A tableaux-based characterization for default logic, in R. Kruse (ed.),Proc. European Conf. Symbolic and Quantitative Approaches to Uncertainty, Springer, Berlin, 1991, pp. 310?317."},{"key":"CR43","unstructured":"Slaney, J. SCOTT: A model-guided theorem prover, inProc. Int. Joint Conf. on Artificial Intelligence, 1993, pp. 109?114."},{"key":"CR44","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF03037328","volume":"2","author":"M. Stickel","year":"1984","unstructured":"Stickel, M.: A Prolog technology theorem prover,New Generation Computing 2 (1984), 371?383.","journal-title":"New Generation Computing"},{"issue":"1","key":"CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00881829","volume":"15","author":"M. Thielscher","year":"1995","unstructured":"Thielscher, M. and Schaub, T.: Default reasoning by deductive planning,J. Automated Reasoning 15(1) (1995), 1?40.","journal-title":"J. Automated Reasoning"},{"issue":"4","key":"CR46","doi-asserted-by":"crossref","first-page":"485","DOI":"10.3233\/FI-2016-1372","volume":"8","author":"A. Zhang","year":"1990","unstructured":"Zhang, A. and Marek, W.: On the classification and existence of structures in default logic,Fundamenta Informaticae 8(4) (1990), 485?499.","journal-title":"Fundamenta Informaticae"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881832.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881832\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T00:07:30Z","timestamp":1586045250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995]]}},"alternative-id":["BF00881832"],"URL":"https:\/\/doi.org\/10.1007\/bf00881832","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}