{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T14:22:11Z","timestamp":1750170131914},"reference-count":70,"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\/bf00881829","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T16:11:47Z","timestamp":1104163907000},"page":"1-40","source":"Crossref","is-referenced-by-count":9,"title":["Default reasoning by deductive planning"],"prefix":"10.1007","volume":"15","author":[{"given":"Michael","family":"Thielscher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Allen, J., Hendler, J. and Tate, A. (ed.):Readings in Planning, Morgan Kaufmann, 1990."},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1111\/j.1467-8640.1991.tb00393.x","volume":"7","author":"C. B\u00e4ckstr\u00f6m","year":"1991","unstructured":"B\u00e4ckstr\u00f6m, C. and Klein, I.: Planning in polynomial time: The SAS-PUBS class,Computational Intelligence 7(3) (1991), 181?197.","journal-title":"Computational Intelligence"},{"key":"CR3","first-page":"1430","volume-title":"Complexity results SAS+ planning","author":"C. B\u00e4ckstr\u00f6m","year":"1993","unstructured":"B\u00e4ckstr\u00f6m, C. and Nebel, B.: Complexity results SAS+ planning, in R. Bajcsy (ed.),Proc. Int. Joint. Conf. Artificial Intelligence (IJCAI), Chamb\u00e9ry, France, Morgan Kaufmann (Aug. 1993), pp. 1430?1435."},{"key":"CR4","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":"CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF03037438","volume":"4","author":"W. Bibel","year":"1986","unstructured":"Bibel, W.: A deductive solution for plan generation,New Generation Computing 4 (1986), 115?132.","journal-title":"New Generation Computing"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Bibel, W.:Automated Theorem Proving, 2nd, revised edn, Vieweg, 1987.","DOI":"10.1007\/978-3-322-90102-6"},{"key":"CR7","first-page":"16","volume-title":"Proc. German Ann. Conf. Artificial Intelligence (KI)","author":"S.-E. Bornscheuer","year":"1994","unstructured":"Bornscheuer, S.-E. and Thielscher, M.: Representing concurrent actions and solving conflicts, in B. Nebel and L. Dreschler-Fischer (eds),Proc. German Ann. Conf. Artificial Intelligence (KI), Saarbr\u00fccken, Germany, Springer, Berlin (Sep. 1994), pp. 16?27."},{"issue":"2","key":"CR8","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,Artificial Intelligence J. 50(2) (1991), 183?205.","journal-title":"Artificial Intelligence J."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-58216-9_37","volume-title":"Proc. Int. Conf. Logic Programming and Automated Reasoning (LPAR), Vol. 822of LNAI","author":"S. Br\u00fcning","year":"1994","unstructured":"Br\u00fcning, S.: Towards efficient calculi for resource-oriented deductive planning, in F. Pfenning (ed.),Proc. Int. Conf. Logic Programming and Automated Reasoning (LPAR), Vol. 822of LNAI, Kiev, Ukraine, Springer, Berlin, 1994, pp. 174?188."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF00297251","volume":"44","author":"H.-J. B\u00fcrckert","year":"1988","unstructured":"B\u00fcrckert, H.-J., Herold, A., Kapur, D., Siekmann, J. H., Stickel, M. E., Tepp, M. and Zhang, H.: Opening the AC-unification race,J. Automated Reasoning 44 (1988), 465?474.","journal-title":"J. Automated Reasoning"},{"key":"CR11","unstructured":"Bylander, T.: Complexity results for planning, inProc. Int. Joint Conf. Artificial Intelligence (IJCAI), Sydney, 1991, pp. 274?279."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning,Artificial Intelligence J. 69 (1994), 165?204.","journal-title":"Artificial Intelligence J."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","volume":"17","author":"M. Cardoli","year":"1993","unstructured":"Cardoli, M. and Schaerf, M.: A survey of complexity results for non-monotonic logics,J. Logic Programming 17 (1993), 127?160.","journal-title":"J. Logic Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0004-3702(87)90092-0","volume":"32","author":"D. Chapman","year":"1987","unstructured":"Chapman, D.: Planning for conjunctive goals,Artificial Intelligence J. 32 (1987), 333?377.","journal-title":"Artificial Intelligence J."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Workshop Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"Clark, K. L.: Negation as failure, in H. Gallaire and J. Minker (eds),Workshop Logic and Data Bases, Plenum, New York, 1978, pp. 293?322."},{"key":"CR16","unstructured":"Delgrande, J. P. and Jackson, W. K.: Default logic revised, inProc. Int. Conf. Principles of Knowledge Representation and Reasoning (KR), Cambridge, MA, 1991, pp. 118?127."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(94)90106-6","volume":"70","author":"J. P. Delgrande","year":"1994","unstructured":"Delgrande, J. P., Schaub, T. and Jackson, W. K.: Alternative approaches to default logic,Artificial Intelligence J. 70 (1994), 167?237.","journal-title":"Artificial Intelligence J."},{"key":"CR18","first-page":"50","volume-title":"Proc. European Workshop on Logics in AI (JELIA), Vol. 838of LNAI","author":"Y. Dimopoulos","year":"1994","unstructured":"Dimopoulos, Y.: The computational value of joint consistency, in L. Pereira and D. Pearce (eds),Proc. European Workshop on Logics in AI (JELIA), Vol. 838of LNAI, Springer, Berlin, 1994, pp. 50?65."},{"key":"CR19","volume-title":"A Mathematical Introduction to Logic","year":"1972","unstructured":"Enderton, H. B. (ed.):A Mathematical Introduction to Logic, Academic Press, Orlando, 1972."},{"key":"CR20","series-title":"Research Notes in Artificial Intelligence","volume-title":"Reasoning with Incomplete Information","author":"D. W. Etherington","year":"1988","unstructured":"Etherington, D. W.:Reasoning with Incomplete Information, Research Notes in Artificial Intelligence, Pitman\/Morgan Kaufmann, London, 1988."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R. E. Fikes","year":"1971","unstructured":"Fikes, R. E. and Nilsson, N. J.: STRIPS: A new approach to the application of theorem proving to problem solving,Artificial Intelligence J. 2 (1971), 189?208.","journal-title":"Artificial Intelligence J."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(89)90028-9","volume":"6","author":"J. H. Gallier","year":"1989","unstructured":"Gallier, J. H. and Raatz, S.: Extending SLD-resolution to equation Horn clauses using E-unification,J. Logic Programming 6 (1989), 3?44.","journal-title":"J. Logic Programming"},{"issue":"1","key":"CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic,J. Theoretical Computer Sci. 50(1) (1987), 1?102.","journal-title":"J. Theoretical Computer Sci."},{"key":"CR24","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 non-monotonic logics,J. Logic and Computation 2 (1992), 397?425.","journal-title":"J. Logic and Computation"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.21236\/ADA459656","volume-title":"Application of theorem proving to problem solving","author":"C. Green","year":"1969","unstructured":"Green, C.: Application of theorem proving to problem solving, inProc. Int. Joint Conf. Artificial Intelligence (IJCAI), Morgan Kaufmann, Los Altos, CA, 1969, pp. 219?239."},{"key":"CR26","first-page":"177","volume-title":"Equational logic programming, actions and change","author":"G. Gro\u00dfe","year":"1992","unstructured":"Gro\u00dfe, G. and H\u00f6lldobler, S, Schneeberger, J., Sigmund, U. and Thielscher, M.: Equational logic programming, actions and change, in K. Apt (ed.),Proc. Int. Joint Conf. and Symp. on Logic Programming (IJCSLP), MIT Press, Washington, 1992, pp. 177?191."},{"key":"CR27","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0015791","volume-title":"Foundations of Equational Logic Programming, Vol. 353 ofLNAI","author":"S. H\u00f6lldobler","year":"1989","unstructured":"H\u00f6lldobler, S.:Foundations of Equational Logic Programming, Vol. 353 ofLNAI, Springer, Berlin, 1989."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF03037518","volume":"8","author":"S. H\u00f6lldobler","year":"1990","unstructured":"H\u00f6lldobler, S. and Schneeberger, J.; A new deductive approach to planning,New Generation Computing 8 (1990), 225?244.","journal-title":"New Generation Computing"},{"key":"CR29","first-page":"164","volume-title":"Actions and specificity","author":"S. H\u00f6lldobler","year":"1993","unstructured":"H\u00f6lldobler, S. and Thielscher, M.: Actions and specificity, in D. Miller (ed.),Proc. Int. Logic Programming Symp. (ILPS), MIT Press, Vancouver, 1993, pp. 164?180."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"H\u00f6lldobler, S. and Thielscher, M.: Computing change and specificity with equational logic programs,Ann. Mathematics and Artificial Intelligence, special issue on Processing of Declarative Knowledge, 1995.","DOI":"10.1007\/BF01530895"},{"issue":"3","key":"CR31","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(84)90010-4","volume":"3","author":"J. Jaffar","year":"1984","unstructured":"Jaffar, J., Lassez, J.-L., and Maher, M. J.: A theory of complete logic programs with equality,J. Logic Programming 3(3) (1984), 211?223.","journal-title":"J. Logic Programming"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/3-540-16780-3_113","volume-title":"Proc. Int. Conf. Automated Deduction (CADE), Vol. 230 ofLNCS","author":"D. Kapur","year":"1986","unstructured":"Kapur, D. and Narendran, P.: NP-completeness of the set unification and matching-problems, in J. H. Siekmann (ed.),Proc. Int. Conf. Automated Deduction (CADE), Vol. 230 ofLNCS, Oxford, Springer, Berlin (July 1986), pp. 489?495."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","volume":"49","author":"H. Kautz","year":"1991","unstructured":"Kautz, H. and Selman, B.: Hard problems for simple default logics,Artificial Intelligence J. 49 (1991), 243?279.","journal-title":"Artificial Intelligence J."},{"key":"CR34","volume-title":"Logic for Problem Solving, Vol. 7 ofArtificial Intelligence Series","author":"R. Kowalski","year":"1979","unstructured":"Kowalski, R.:Logic for Problem Solving, Vol. 7 ofArtificial Intelligence Series, Elsevier, Amsterdam, 1979."},{"key":"CR35","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF03037383","volume":"4","author":"R. Kowalski","year":"1986","unstructured":"Kowalski, R. and Sergot, M.: A logic based calculus of events,New Generation Computing 4 (1986), 67?95.","journal-title":"New Generation Computing"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: On the semantics of STRIPS, in M. P. Georgeff and A. L. Lansky (eds),Proc. Workshop on Reasoning about Actions and Plans, Morgan Kaufmann, 1986.","DOI":"10.1016\/B978-0-934613-30-9.50004-4"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-642-76274-1_3","volume-title":"Computational Logic","author":"V. Lifschitz","year":"1990","unstructured":"Lifschitz, V.: On open defaults, in J. W. Lloyd (ed.),Computational Logic, Springer, Berlin, 1990, pp. 80?95."},{"key":"CR38","series-title":"Series Symbolic Computation","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"Lloyd, J. W.:Foundations of Logic Programming, 2nd extended ed., Series Symbolic Computation, Springer, Berlin, 1987.","edition":"2nd extended"},{"key":"CR39","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":"CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02906-0","volume-title":"Nonmonotonic Logics: Context-Dependent Reasoning","author":"W. Marek","year":"1993","unstructured":"Marek, W. and Truszczy?ski, M.:Nonmonotonic Logics: Context-Dependent Reasoning, Springer, Berlin, 1993."},{"key":"CR41","first-page":"153","volume-title":"Nonmonotonic and Inductive Logic (NIL), Vol. 659 ofLNAI","author":"W. Marek","year":"1993","unstructured":"Marek, W. and Truszczy?ski, M.: Normal form results for default logics, in G. Brewka, K. P. Jantke and P. H. Schmitt (eds),Nonmonotonic and Inductive Logic (NIL), Vol. 659 ofLNAI, Springer, Berlin, 1993, pp. 153?174."},{"key":"CR42","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-53487-3_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science, Vol. 472 ofLNCS","author":"M. Masseron","year":"1990","unstructured":"Masseron, M., Tollu, C. and Vauzielles, J.: Generating plans in linear logic, inFoundations of Software Technology and Theoretical Computer Science, Vol. 472 ofLNCS, Springer, Berlin, 1990, pp. 63?75."},{"key":"CR43","doi-asserted-by":"crossref","unstructured":"McCarthy, J.: Situations and actions and causal laws, Stanford Artificial Intelligence Project, Memo 2, 1963.","DOI":"10.21236\/AD0785031"},{"key":"CR44","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing common-sense knowledge,Artificial Intelligence J. 28 (1986), 89?116.","journal-title":"Artificial Intelligence J."},{"key":"CR45","first-page":"463","volume":"4","author":"J. McCarthy","year":"1969","unstructured":"McCarthy, J. and Hayes, P. J.: Some philosophical problems from the standpoint of artificial intelligence,Machine Intelligence 4 (1969), 463?502.","journal-title":"Machine Intelligence"},{"key":"CR46","first-page":"211","volume-title":"The Psychology of Computer Vision","author":"M Minsky","year":"1975","unstructured":"Minsky, M: A framework for representing knowledge, in P. Winston (ed.),The Psychology of Computer Vision, McGraw-Hill, New York, 1975, pp. 211?277."},{"issue":"1","key":"CR47","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.: A logical framework for default reasoning,Artificial Intelligence J. 36(1) (1988), 27?47.","journal-title":"Artificial Intelligence J."},{"key":"CR48","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1111\/j.1467-8640.1989.tb00319.x","volume":"5","author":"D. Poole","year":"1989","unstructured":"Poole, D.: Explanation and prediction: An architecture for default and abductive reasoning,Comput. Intelligence 5 (1989), 97?110.","journal-title":"Comput. Intelligence"},{"key":"CR49","first-page":"333","volume-title":"Proc. Int. Conf. Principles of Knowledge Representation and Reasoning (KR)","author":"D. Poole","year":"1989","unstructured":"Poole, D.: What the lottery paradox tells us about default reasoning, in R. Brachman, H. J. Levesque and R. Reiter (eds),Proc. Int. Conf. Principles of Knowledge Representation and Reasoning (KR), Toronto, Morgan Kaufmann, 1989, pp. 333?340."},{"issue":"1","key":"CR50","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03037149","volume":"9","author":"D. Poole","year":"1991","unstructured":"Poole, D.: Compiling a default reasoning system into prolog,New Generation Computing 9(1) (1991), 3?38.","journal-title":"New Generation Computing"},{"key":"CR51","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 J. 13 (1980), 81?132.","journal-title":"Artificial Intelligence J."},{"key":"CR52","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/B978-0-12-450010-5.50026-8","volume-title":"Artificial Intelligence and Mathematical Theory of Computation","author":"R. Reiter","year":"1991","unstructured":"Reiter, R.: The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression, in V. Lifschitz (ed.),Artificial Intelligence and Mathematical Theory of Computation, Academic Press, New York, 1991, pp. 359?380."},{"key":"CR53","unstructured":"Reiter, R. and Criscuolo, G.: On interacting defaults, inProc. Int. Joint. Conf. Artificial Intelligence (IJCAI), Vancouver, 1981, pp. 1270?1276."},{"key":"CR54","unstructured":"Risch, V.: Les Tableaux Analytiques au Service des Logiques de Defaults, PhD Thesis, Universit\u00e9 Aix-Marseille II, G.I.A., Parc Scientifique et Technologique de Luminy (April 1993) (in French)."},{"key":"CR55","unstructured":"Rothschild, A. and Schaub, T.: A computational approach to default logics, in G. Brewka and C. Witteveen (eds),Dutch\/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications, Vol. 2, 1993, pp. 1?14."},{"key":"CR56","volume-title":"A Structure for Plans and Behavior","author":"E. D. Sacerdoti","year":"1977","unstructured":"Sacerdoti, E. D.:A Structure for Plans and Behavior, Elsevier, Amsterdam, 1977."},{"key":"CR57","volume-title":"Considerations on Default Logics","author":"T. Schaub","year":"1992","unstructured":"Schaub, T.: Considerations on Default Logics, PhD Thesis, FG Intellektik, TH Darmstadt, Germany (Nov. 1992)."},{"key":"CR58","unstructured":"Schaub, T.: On constrained default theories, in B. Neumann (ed.),Proc. European Conf. on Artificial Intelligence (ECAI), 1992, pp. 304?308."},{"key":"CR59","first-page":"312","volume-title":"Proc. European Conf. Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU)","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 (ECSQARU), Springer, Berlin, 1993, pp. 312?317."},{"key":"CR60","unstructured":"Schaub, T.: A new methodology for query-answering in default logics via structure-oriented theorem proving, Technical report, IRISA, Campus de Beaulieu, F-35042 Rennes Cedex, France (Jan. 1994)."},{"key":"CR61","volume-title":"Proc. Int. Conf. Automated Deduction (CADE), Vol. 449 ofLNAI","author":"C. B. Schwind","year":"1990","unstructured":"Schwind, C. B.: A tableau-based theorem prover for a decidable subset of default logic, in M. E. Stickel (ed.),Proc. Int. Conf. Automated Deduction (CADE), Vol. 449 ofLNAI. Kaiserslautern, Germany, Springer, Berlin, 1990."},{"key":"CR62","first-page":"310","volume-title":"A tableau-based characterization for default logic","author":"C. B. Schwind","year":"1991","unstructured":"Schwind, C. B. and Risch, V.: A tableau-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":"CR63","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00244285","volume":"8","author":"J. C. Shepherdson","year":"1992","unstructured":"Shepherdson, J. C.: SLDNF-resolution with equality,J. Automated Reasoning 8 (1992), 297?306.","journal-title":"J. Automated Reasoning"},{"key":"CR64","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(86)90003-2","volume":"30","author":"D. E. Smith","year":"1986","unstructured":"Smith, D. E., Genesereth, M. R. and Ginsberg, M. L.: Controlling recursive inference,Artificial Intelligence J. 30 (1986), 343?389.","journal-title":"Artificial Intelligence J."},{"key":"CR65","volume-title":"First-Order Logic","author":"R. M. Smullyan","year":"1971","unstructured":"Smullyan, R. M.:First-Order Logic, Springer, Berlin, 1971."},{"key":"CR66","unstructured":"Stillman, J.: The complexity of propositional default logics, inProc. AAAI Nat. Conf. Artificial Intelligence, 1992, pp. 794?799."},{"issue":"2","key":"CR67","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0004-3702(93)90004-U","volume":"60","author":"M. Thielscher","year":"1993","unstructured":"Thielscher, M.: On prediction in theorist,Artificial Intelligence J. 60(2) (1993), 283?292.","journal-title":"Artificial Intelligence J."},{"key":"CR68","volume-title":"An analysis of systematic approaches to reasoning about actions and change","author":"M. Thielscher","year":"1994","unstructured":"Thielscher, M.: An analysis of systematic approaches to reasoning about actions and change, in P. Jorrand (ed.),Int. Conf. Artificial Intelligence: Methodology, Systems, Applications (AIMSA), Sofia, Bulgaria, Sep. 1994, World Scientific Publishing Co., Singapore."},{"key":"CR69","unstructured":"Thielscher, M.: On the completeness of SLDENF-resolution, Technical Report AIDA-94-08, FG Intellektik, TH Darmstadt, Germany (Oct. 1994). Available by anonymous ftp from 130.83.26.1 in\/pub\/AIDA\/Tech-Reports\/1994."},{"key":"CR70","first-page":"207","volume-title":"Proc. Int. Conf. Logic Programming (ICLP)","author":"M. Thielscher","year":"1994","unstructured":"Thielscher, M.: Representing actions in equational logic programming, in P. V. Hentenryck (ed.),Proc. Int. Conf. Logic Programming (ICLP), Santa Margherita Ligure, Italy, MIT Press, 1994, pp. 207?224."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881829\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881829","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\/BF00881829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995]]}},"alternative-id":["BF00881829"],"URL":"https:\/\/doi.org\/10.1007\/bf00881829","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}