{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:56:23Z","timestamp":1768449383299,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/bf00881799","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T07:36:06Z","timestamp":1104132966000},"page":"399-420","source":"Crossref","is-referenced-by-count":38,"title":["Dualities between alternative semantics for logic programming and nonmonotonic reasoning"],"prefix":"10.1007","volume":"10","author":[{"given":"Chitta R.","family":"Baral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Bidoit, N. and Froidevaux, C., ?General logicl databases and programs default logic semantics and stratification?,J. Information and Computation, in print (1988)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02341854","volume":"8","author":"C. Baral","year":"1992","unstructured":"Baral, C. and Subrahmanian, V. S., ?Stable and extension class theory for logic programs and default logics?, technical report CS-TR-2402, Dept of Computer Science, University of Maryland (February 1990). Presented at the Third International Workshop on Non-Monotonic Reasoning, South Lake Tahoe, May 1990.J. Automated Reasoning 8, 345?366 (1992).","journal-title":"J. Automated Reasoning"},{"key":"CR3","unstructured":"Van Gelder, A., ?The alternating fixpoint of logic programs with negation?, inProceedings of the Symposium on Principles of Database Systems (1989) pp. 1?10."},{"key":"CR4","unstructured":"Gelfond, M. and Lifschitz, V., ?The stable model semantics for logic programming?,Proc. 5th International Conference and Symposium on Logic Programming (eds. R. A. Kowalski and K. A. Bowen), pp. 1070?1080, Seattle, Washington, August 15?19 (1988)."},{"key":"CR5","unstructured":"Gelfond, M. and Lifschitz, V.,Logic Programs with Classical Negation. Proc. 7th International Conference on Logic Programming, MIT Press, pp. 579?597, 1991."},{"key":"CR6","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, 343?382 (1988).","journal-title":"Artificial Intelligence"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Lloyd, J.,Foundations of Logic Programming, Springer-Verlag, 2nd edition (1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3233\/FI-1989-12209","volume":"12","author":"W. Marek","year":"1989","unstructured":"Marek, W., ?Stable theories in autoepistemic logic?,Fundamenta Informaticae 12, 243?254 (1989).","journal-title":"Fundamenta Informaticae"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Marek, W. and Subrahmanian, V. S., ?The relationship between stable, supported, default and auto-epistemic semantics for general logic programs?, inProc. ICLP 89 (eds. G. Levi and M. Martelli), pp. 600?620, 1989. Extended version inTheoretical Computer Science, Vol. 103, pp. 365?386 (1992).","DOI":"10.1016\/0304-3975(92)90019-C"},{"key":"CR10","unstructured":"Marek, W. and Truszczynski, M., ?Relating autoepistemic and default logics?, technical report, Department of Computer Science, University of Kentucky at Lexington (1989). Also appears inProc. KR 89."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Marek, W. and Truszczynski, M., ?Stable semantics for logic programs and default theories?, inProceedings of NACLP 89, pp. 243?256 (1989).","DOI":"10.3233\/FI-1989-12209"},{"key":"CR12","unstructured":"Marek, W., Shvarts, G., Truszczynski, M., ?Modal non-monotonic logics: ranges, characterization, computation?, to appear inProc. KR 91."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","volume":"29","author":"D. McDermott","year":"1982","unstructured":"McDermott, D., ?Non-monotonic logic II: Non-monotonic modal theories?,J. ACM 29, 33?57 (1982).","journal-title":"J. ACM"},{"key":"CR14","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 logic?,Artificial Intelilgence 25, 75?94 (1985).","journal-title":"Artificial Intelilgence"},{"key":"CR15","unstructured":"Przymusinski, T., ?Three-valued formalizations of non-monotonic reasoning and logic programming?, inProc. First International Conference on Knowledge Representation and Reasoning (1989)."},{"issue":"1","key":"CR16","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 or 2), 81?132 (1980).","journal-title":"Artificial Intelligence"},{"key":"CR17","unstructured":"Shvarts, G., ?Auto-epistemic modal logics?, inProc. TARAK-1990 (R. Parikh, ed.), pp. 97?109, Morgan Kaufmann (1990)."},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. Smyth","year":"1978","unstructured":"Smyth, M., ?Power domains?,J. Computer and System Sciences 16(1), 23?36 (1978).","journal-title":"J. Computer and System Sciences"},{"key":"CR19","unstructured":"Van Gelder, A., Ross, K., and Schlipf, J. S., ?Unfounded sets and well-founded semantics for general logic programs?, inProc. 7th Symposium on Principles of Database Systems, pp. 221?230 (1988). Full version inJACM 38(3), 620?650 (1991)."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881799.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881799\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,21]],"date-time":"2024-12-21T19:05:09Z","timestamp":1734807909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00881799"],"URL":"https:\/\/doi.org\/10.1007\/bf00881799","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}