{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:01:18Z","timestamp":1747627278809,"version":"3.40.5"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1018938324292","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"165-199","source":"Crossref","is-referenced-by-count":4,"title":["Building a knowledge base: an example"],"prefix":"10.1007","volume":"25","author":[{"given":"Michael","family":"Gelfond","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Gabaldon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"325529_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-61488-5","volume-title":"Reasoning with Logic Programming","author":"J.J. Alferes","year":"1996","unstructured":"J.J. Alferes and L.M. Pereira, Reasoning with Logic Programming, Lecture Notes in Artificial Intelligence (Springer, Berlin, 1996)."},{"key":"325529_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1988","unstructured":"K. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, San Mateo, CA, 1988) pp. 89-148."},{"key":"325529_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-54415-1_50","volume-title":"Proc. of the International Conference on Theoretical Aspects of Computer Software","author":"K. Apt","year":"1991","unstructured":"K. Apt and D. Pedreschi, Proving termination in general Prolog programs, in: Proc. of the International Conference on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Vol. 526 (Springer, Berlin, 1991) pp. 265-289."},{"issue":"3","key":"325529_CR4","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1145\/177492.177673","volume":"16","author":"K. Apt","year":"1994","unstructured":"K. Apt and A. Pellegrini, On the occur-check free logic programs, ACM Trans. Programming Languages and Systems 16(3) (1994) 687-726.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"325529_CR5","first-page":"1","volume":"12","author":"C. Baral","year":"1994","unstructured":"C. Baral and M. Gelfond, Logic programming and knowledge representation, J. Logic Programming 12 (1994) 1-80.","journal-title":"J. Logic Programming"},{"key":"325529_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0743-1066(97)10011-5","volume":"35","author":"C. Baral","year":"1998","unstructured":"C. Baral, M. Gelfond and O. Kosheleva, Expanding queries to incomplete databases by interpolating general logic programs, J. Logic Programming 35 (1998) 195-230.","journal-title":"J. Logic Programming"},{"key":"325529_CR7","unstructured":"N. Bidoit and C. Froidevaux, Minimalism subsumes default logic and circumscription, in: Proc. of LICS-87 (1987) pp. 89-97."},{"key":"325529_CR8","unstructured":"D. Chan, Constructive negation based on the completed databases, in: Proc. 5th International Conference and Symposium on Logic Programming (1988) pp. 111-125."},{"issue":"2","key":"325529_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0743-1066(95)00151-4","volume":"27","author":"W. Chen","year":"1996","unstructured":"W. Chen, Extending Prolog with nonmonotonic reasoning, J. Logic Programming 27(2) (1996) 169-183.","journal-title":"J. Logic Programming"},{"issue":"3","key":"325529_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","volume":"24","author":"W. Chen","year":"1995","unstructured":"W. Chen, T. Swift and D. Warren, Efficient top-down computation of queries under the well-founded semantics, J. Logic Programming 24(3) (1995) 161-201.","journal-title":"J. Logic Programming"},{"key":"325529_CR11","unstructured":"P. Cholewinski, W. Marek and M. Truszczynski, Default reasoning system DeReS, in: Proc. of KR-96 (1996) pp. 518-528."},{"key":"325529_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. Clark","year":"1978","unstructured":"K. Clark, Negation as failure, in: Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum Press, NY, 1978) pp. 293-322."},{"key":"325529_CR13","unstructured":"P. Dembinski and J. Maluszynski, AND-parallelism with intelligent backtracking for annotated logic programs, in: Logic Programming: Proc. of the International Symposium on Logic Programming, eds. V. Saraswat and K. Ueda (1985) pp. 25-38."},{"key":"325529_CR14","volume-title":"Logic Programming: Systematic Program Development","author":"Y. Deville","year":"1990","unstructured":"Y. Deville, Logic Programming: Systematic Program Development (Addison-Wesley, Reading, MA, 1990)."},{"key":"325529_CR15","doi-asserted-by":"crossref","unstructured":"P.M. Dung and T.C. Son, Nonmonotonic inheritance, argumentation, and logic programming, in: Proceedings of LPNMR (1995) pp. 316-329.","DOI":"10.1007\/3-540-59487-6_23"},{"key":"325529_CR16","unstructured":"P.M. Dung and T.C. Son, An argumentation-theoretic approach to reasoning with specificity, in: Proceedings of KR '96 (1996) pp. 407-18."},{"key":"325529_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/3-540-63255-7_27","volume-title":"Proc. 4th LPNMR","author":"T. Eiter","year":"1997","unstructured":"T. Eiter, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello, A deductive system for non-monotonic reasoning, in: Proc. 4th LPNMR, Lecture Notes in Computer Science, Vol. 1265 (Springer, Berlin, 1997) pp. 363-374."},{"key":"325529_CR18","unstructured":"D. Etherington and R. Reiter, On inheritance hierarchies with exceptions, in: Proceedings of AAAI-83 (1983) pp. 104-108."},{"issue":"1","key":"325529_CR19","first-page":"51","volume":"1","author":"F. Pages","year":"1994","unstructured":"F. Pages, Consistency of Clark's completion and existence of stable models, J. Methods Logic Comput. Sci. 1(1) (1994) 51-60.","journal-title":"J. Methods Logic Comput. Sci."},{"key":"325529_CR20","unstructured":"M. Gelfond and A. Gabaldon, From functional specifications to logic programs, in: Logic Programming: Proc. of the 1997 International Symposium, ed. J. Maluszynski (1997) pp. 355-371."},{"key":"325529_CR21","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proc. of the 5th International Conference and Symposium, eds. R. Kowalski and K. Bowen (1988) pp. 1070-1080."},{"key":"325529_CR22","unstructured":"M. Gelfond and V. Lifschitz, Logic programs with classical negation, in: Logic Programming: Proc. of the 7th International Conference, eds. D. Warren and P. Szeredi (1990) pp. 579-597."},{"key":"325529_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1991) 365-385.","journal-title":"New Generation Computing"},{"key":"325529_CR24","first-page":"403","volume":"13","author":"M. Gelfond","year":"1990","unstructured":"M. Gelfond and H. Przymusinska, Formalization of inheritance reasoning in autoepistemic logic, Fund. Inform. 13 (1990) 403-45.","journal-title":"Fund. Inform."},{"issue":"1","key":"325529_CR25","first-page":"59","volume":"16","author":"M. Gelfond","year":"1992","unstructured":"M. Gelfond and H. Przymusinska, On consistency and completeness of autoepistemic theories, Fund. Inform. 16(1) (1992) 59-92.","journal-title":"Fund. Inform."},{"issue":"1","key":"325529_CR26","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1142\/S0218194096000053","volume":"6","author":"M. Gelfond","year":"1996","unstructured":"M. Gelfond and H. Przymusinska, Towards a theory of elaboration tolerance: logic programming approach, J. Software Eng. Knowledge Eng. 6(1) (1996) 89-112.","journal-title":"J. Software Eng. Knowledge Eng."},{"key":"325529_CR27","doi-asserted-by":"crossref","unstructured":"J.F. Horty, Some direct theories of non-monotonic inheritance, in: Handbook of Logic in Artificial Intelligence and Logic Programming, eds. D. Gabbay, C. Hogger and J.A. Robinson (1994).","DOI":"10.1093\/oso\/9780198537472.003.0003"},{"issue":"2\u20133","key":"325529_CR28","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(90)90057-7","volume":"42","author":"J.F. Horty","year":"1990","unstructured":"J.F. Horty, R.H. Thomason and D.S. Touretzky, A skeptical theory of inheritance in nonmonotonic semantic networks, Artificial Intelligence 42(2\u20133) (1990) 311-348.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"325529_CR29","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"K. Kunen","year":"1989","unstructured":"K. Kunen, Signed data dependencies in logic programs, J. Logic Programming 7(3) (1989) 231-245.","journal-title":"J. Logic Programming"},{"key":"325529_CR30","unstructured":"V. Lifschitz, Restricted monotonicity, in: Proc. of AAAI-93 (1993) pp. 432-37."},{"key":"325529_CR31","unstructured":"V. Lifschitz, Foundations of logic programming, in: Principles of Knowledge Representation, ed. G. Brewka (CSLI Publications, 1996) pp. 69-128."},{"key":"325529_CR32","unstructured":"V. Lifschitz and H. Turner, Splitting a logic program, in: Proc. 11th ICLP, ed. P. Van Hentenryck (1994) pp. 23-38."},{"key":"325529_CR33","unstructured":"F. Lin, A study of nonmonotonic reasoning, Ph.D. thesis, Stanford University (1991)."},{"key":"325529_CR34","unstructured":"W. Marek and V.S. Subrahmanian, The relationship between logic program semantics and non-monotonic reasoning, in: Proc. of the 6th International Conference on Logic Programming, eds. G. Levi and M. Martelli (1989) pp. 600-617."},{"key":"325529_CR35","unstructured":"N. McCain and H. Turner, Language independence and language tolerance in logic programs, in: Proc. of the 11th International Conference on Logic Programming (1994) pp. 38-57."},{"key":"325529_CR36","volume-title":"Proc. of JICSLP-96","author":"L. Niemela","year":"1996","unstructured":"L. Niemela and P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proc. of JICSLP-96 (MIT Press, Cambridge, MA, 1996)."},{"key":"325529_CR37","unstructured":"L. Pereira and J. Alferes, Well-founded semantics for logic programs with explicit negation, in: Proc. of the 10th European Conference on Artificial Intelligence (1992) pp. 102-106."},{"key":"325529_CR38","unstructured":"T. Przymusinki, On constructive negation in logic programming, in: Proc. of the North American Conference of Logic Programming (1989) pp. 16-20."},{"key":"325529_CR39","first-page":"119","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1978","unstructured":"R. Reiter, On closed world data bases, in: Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum Press, New York, 1978) pp. 119-140."},{"key":"325529_CR40","doi-asserted-by":"crossref","unstructured":"R. Reiter, A logic for default reasoning, Artificial Intelligence 13(1\u20132) 81-132.","DOI":"10.1016\/0004-3702(80)90014-4"},{"issue":"2\u20133","key":"325529_CR41","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0004-3702(92)90057-5","volume":"55","author":"L.A. Stein","year":"1992","unstructured":"L.A. Stein, Resolving ambiguity in non-monotonic inheritance hierarchies, Artificial Intelligence 55(2\u20133) (1992) 259-310.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"325529_CR42","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0743-1066(14)80003-4","volume":"15","author":"K. Stroetmann","year":"1993","unstructured":"K. Stroetmann, A completeness result for SLDNF-resolution, J. Logic Programming 15(4) (1993) 337-355.","journal-title":"J. Logic Programming"},{"key":"325529_CR43","volume-title":"The Mathematics of Inheritance Systems","author":"D. Touretzky","year":"1986","unstructured":"D. Touretzky, The Mathematics of Inheritance Systems (Morgan Kaufmann, Los Altos, CA, 1986)."},{"key":"325529_CR44","unstructured":"H. Turner, A monotonicity theorem for extended logic programs, in: Proc. 10th ICLP, ed. D.S. Warren (1993) pp. 567-585."},{"key":"325529_CR45","unstructured":"H. Turner, Signed logic programs, in: Proc. of ILPS, ed. M. Bruynooghe (1994) pp. 61-75."},{"issue":"3","key":"325529_CR46","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Van Gelder","year":"1991","unstructured":"A. Van Gelder, K. Ross and J. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38(3) (1991) 620-650.","journal-title":"Journal of the ACM"},{"key":"325529_CR47","unstructured":"X. Wang, J.H. You and L.Y. Yuan, A default interpretation of defeasible network, in: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97) (1997) pp. 156-161."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018938324292.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018938324292\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018938324292.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:49:35Z","timestamp":1747547375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018938324292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":47,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["325529"],"URL":"https:\/\/doi.org\/10.1023\/a:1018938324292","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}