{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:57:12Z","timestamp":1648864632495},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf01530785","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T03:07:12Z","timestamp":1113880032000},"page":"189-213","source":"Crossref","is-referenced-by-count":0,"title":["Modular specifications with supernormal defaults"],"prefix":"10.1007","volume":"12","author":[{"given":"Stefan","family":"Brass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"G. Antoniou, Modules in computer science and artificial intelligence, Osnabr\u00fccker Schriften zur Mathematik I-26, Universit\u00e4t Osnabr\u00fcck (1991)."},{"key":"CR2","unstructured":"A.B. Baker and M.L. Ginsberg, A theorem prover for prioritized circumscription, in:Proc. 11th Int. Joint Conf. on Artificial Intelligence (IJCAI), 1989, pp. 463?467."},{"key":"CR3","volume-title":"Research Report RR-92-58","author":"F. Baader","year":"1992","unstructured":"F. Baader and B. Hollunder, How to prefer more specific defaults in terminological default logic, Research Report RR-92-58, DFKI, Kaiserslautern (1992)."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"S. Brass and U.W. Lipeck, Specifying closed world assumptions for logic databases, in: J. Demetrovics and B. Thalheim (eds.),2nd Symp. on Mathematical Fundamentals of Database Syst. (MFDBS' 89), LNCS 364 (Springer, 1989) pp. 68?84.","DOI":"10.1007\/3-540-51251-9_6"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"S. Brass and U.W. Lipeck, Semantics of inheritance in logical object specifications, in: C. Delobel, M. Kifer and Y. Masunaga (eds.),Deductive and Object-Oriented Databases, 2nd Int. Conf. (DOOD' 91), LNCS 566 (Springer, 1991) pp. 411?430.","DOI":"10.1007\/3-540-55015-1_22"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"S. Brass and U.W. Lipeck, Bottom-up query evaluation with partially ordered defaults, in:Proc. 3rd Int. Conf. on Deductive and Object-Oriented Databases (DOOD '93), LNCS 760 (Springer, 1993) pp. 253?266.","DOI":"10.1007\/3-540-57530-8_16"},{"key":"CR7","unstructured":"S. Brass, Logic programs viewed as modular specifications, Research Report, Institut f\u00fcr Informatik, Universit\u00e4t Hannover (1992)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"S. Brass, Deduction with supernormal defaults, in: G. Brewka, K.P. Jantke and P.H. Schmitt (eds.),Nonmonotonic and Inductive Logics, 2nd Int. Workshop (NIL '91), LNAI 659 (Springer, 1993) pp. 153?174.","DOI":"10.1007\/BFb0030392"},{"key":"CR9","unstructured":"S. Brass, On the semantics of supernormal defaults, in: R. Bajcsy (ed.),Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI '93) (Morgan Kaufmann, 1993) pp. 578?583."},{"key":"CR10","unstructured":"G. Brewka,Nonmonotonic Reasoning: Logical Foundations of Commonsense (Cambridge University Press, 1991)."},{"key":"CR11","unstructured":"J. Dix, Default theories of Poole-type and a method for constructing cumulative versions of default logic, in: B. Neumann (ed.),Proc. 10th European Conf. on Artificial Intelligence (ECAI '92), (Wiley, 1992) pp. 289?293."},{"key":"CR12","unstructured":"J.P. Delgrande and W.K. Jackson, Default logic revisited, in: J. Allen, R. Fikes and E. Sandewall (eds.),Principles of Knowledge Representation and Reasoning, Proc. 2nd Int. Conf. (KR '91) (Morgan Kaufmann, 1991) pp. 118?127."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","volume":"39","author":"M.L. Ginsberg","year":"1989","unstructured":"M.L. Ginsberg, A circumscriptive theorem prover, Artificial Intelligence 39 (1989) 209?230.","journal-title":"Artificial Intelligence"},{"key":"CR14","unstructured":"G. Gottlob, The power of beliefsor Translating default logic into standard autoepistemic logic, in: R. Bajcsy (ed.),Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI '93) (Morgan Kaufmann, 1993) pp. 570?575."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","volume":"33","author":"S. Hanks","year":"1987","unstructured":"S. Hanks and D. McDermott, Nonmonotonic logic and temporal projection, Artificial Intelligence 33 (1987) 379?412.","journal-title":"Artificial Intelligence"},{"key":"CR16","unstructured":"V. Lifschitz, Pointwise circumscription, in: M.L. Ginsberg (ed.),Readings in Nonmonotonic Reasoning (Morgan Kaufmann, 1987) pp. 179?193."},{"key":"CR17","unstructured":"Y. Moinard, Pointwise circumscription is equivalent to predicate completion (sometimes), in: R.A. Kowalski and K.A. Bowen (eds.),Logic Programming, Proc. 5th Int. Conf. and Symp. (MIT Press, 1988) pp. 1097?1105."},{"key":"CR18","unstructured":"W. Marek and M. Truszczy?ski, Stable models for logic programs and default theories, in:Logic Programming, Proc. North American Conf. (MIT Press, 1989)."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"W. Marek and M. Truszczy?ski,Nonmonotonic Logic: Context-Dependent Reasoning (Springer, 1993).","DOI":"10.1007\/978-3-662-02906-0"},{"key":"CR20","unstructured":"R.A. O'Keefe, Towards an algebra for constructing logic programs, in:Symp. on Logic Programming, 1985, pp. 152?160."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","volume":"36","author":"D. Poole","year":"1988","unstructured":"D. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1988) 27?47.","journal-title":"Artificial Intelligence"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03037149","volume":"9","author":"D. Poole","year":"1991","unstructured":"D. Poole, Compiling a default reasoning system into prolog, New Generation Comput. 9 (1991) 3?38.","journal-title":"New Generation Comput."},{"key":"CR23","first-page":"1106","volume-title":"Weakly perfect model semantics for logic programs","author":"H. Przymusinska","year":"1988","unstructured":"H. Przymusinska and T.C. Przymusinski, Weakly perfect model semantics for logic programs, in: R.A. Kowalski and K.A. Bowen (eds.),Logic Programming, Proc. 5th Int. Conf. and Symp. (MIT Press, Cambridge, Mass., 1988) pp. 1106?1122."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/B978-0-934613-40-8.50009-9","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T.C. Przymusinski","year":"1988","unstructured":"T.C. Przymusinski, On the declarative semantics of deductive databases and logic programs, in: J. Minker (ed.),Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, Calif., 1988) pp. 193?216."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T.C. Przymusinski","year":"1989","unstructured":"T.C. Przymusinski, An algorithm to compute circumscription, Artificial Intelligence 38 (1989) 49?73.","journal-title":"Artificial Intelligence"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"M. Ryan, Defaults and revision in structured theories, in:Proc. IEEE Symp. on Logic in Computer Science (LICS '91), 1991, pp. 362?373.","DOI":"10.1109\/LICS.1991.151660"},{"key":"CR27","first-page":"37","volume":"15","author":"C. Sernadas","year":"1990","unstructured":"C. Sernadas, J. Fiadeiro and A. Sernadas, Modular construction of logic knowledge bases: An algebraic approach, Information Syst. 15 (1990) 37?59.","journal-title":"An algebraic approach, Information Syst."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0743-1066(92)90042-2","volume":"12","author":"D.T. Sanella","year":"1992","unstructured":"D.T. Sanella and L.A. Wallen, A calculus for the construction of modular prolog programs, J. Logic Progr. 12 (1992) 147?177.","journal-title":"J. Logic Progr."},{"key":"CR29","unstructured":"W.M. Turski and T.S.E. Maibaum,The Specification of Computer Programs (Addison-Wesley, 1987)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530785\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530785.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530785\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:04:16Z","timestamp":1586217856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":29,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF01530785"],"URL":"https:\/\/doi.org\/10.1007\/bf01530785","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}