{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:37Z","timestamp":1725456397010},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645702"},{"type":"electronic","value":"9783540693536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0028009","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:02:06Z","timestamp":1132642926000},"page":"98-114","source":"Crossref","is-referenced-by-count":2,"title":["A sequent calculus for circumscription"],"prefix":"10.1007","author":[{"given":"P. A.","family":"Bonatti","sequence":"first","affiliation":[]},{"given":"N.","family":"Olivetti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1093\/logcom\/6.2.205","volume":"6","author":"G. Amati","year":"1996","unstructured":"G. Amati, L. Carlucci Aiello, D. Gabbay, F. Pirri. A proof theoretical approach to default reasoning I: tableaux for default logic. Journal of Logic and Computation, 6(2):205\u2013231, 1996.","journal-title":"Journal of Logic and Computation"},{"key":"6_CR2","unstructured":"C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian. Implementing stable semantics by linear programming. In [38]."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"A. Bochman. On the relation between default and modal consequence relations. In Proc. of KR'94, 63\u201374, Morgan Kaufmann, 1994.","DOI":"10.1016\/B978-1-4832-1452-8.50103-2"},{"key":"6_CR4","series-title":"LNAI 1071","first-page":"127","volume-title":"Proc. of TABLEA UX'96","author":"P.A. Bonatti","year":"1996","unstructured":"P.A. Bonatti. Sequent calculi for default and autoepistemic logics. In Proc. of TABLEA UX'96, LNAI 1071, pp. 127\u2013142, Springer-Verlag, Berlin, 1996."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF00881911","volume":"13","author":"P.A. Bonatti","year":"1994","unstructured":"P.A. Bonatti. Autoepistemic logic programming. Journal of Automated Reasoning, 13:35\u201367, 1994.","journal-title":"Journal of Automated Reasoning"},{"key":"6_CR6","volume-title":"A Gentzen system for non-theorems. Technical Report CD-TR 93\/52, Christian Doppler Labor f\u00fcr Expertensysteme","author":"P.A. Bonatti","year":"1993","unstructured":"P.A. Bonatti. A Gentzen system for non-theorems. Technical Report CD-TR 93\/52, Christian Doppler Labor f\u00fcr Expertensysteme, Technische Universit\u00e4t, Wien, September 1993."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"P.A. Bonatti, N. Olivetti. A sequent calculus for skeptical default logic. In Proc. of TABLEAUX'97, LNAI 1227, pp. 107\u2013121, 1997.","DOI":"10.1007\/BFb0027408"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0004-3702(91)90099-6","volume":"50","author":"G. Brewka","year":"1991","unstructured":"G. Brewka. Cumulative default logic: in defense of nonmonotonic inference rules. Artificial Intelligence 50:183\u2013205, 1991.","journal-title":"Artificial Intelligence"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0004-3702(92)90051-X","volume":"54","author":"M. Cadoli","year":"1992","unstructured":"M. Cadoli, T. Eiter, G. Gottlob. An efficient method for eliminating varying predicates from a circumscription. Art. Int., 54:397\u2013410, 1992.","journal-title":"Art. Int."},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1305\/ndjfl\/1093888218","volume":"19","author":"X. Caicedo","year":"1978","unstructured":"X. Caicedo. A formal system for the non-theorems of the propositional calculus. Notre Dame Journal of Formal Logic, 19:147\u2013151, (1978).","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF00370199","volume":"48","author":"R. Dutkiewicz","year":"1989","unstructured":"R. Dutkiewicz. The method of axiomatic rejection for the intuitionistic propositional calculus. Studia Logica, 48:449\u2013459, (1989).","journal-title":"Studia Logica"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"U. Egly, H. Tompits. Non-elementary speed-ups in default reasoning. In Proceedings ECSQARU-FAPR'97, LNAI 1244, pp. 237\u2013251, 1997.","DOI":"10.1007\/BFb0035626"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","volume":"114","author":"T. Eiter","year":"1993","unstructured":"T. Eiter, G. Gottlob. Propositional Circumscription and Extended Closed World Reasoning are \u03c0 inp 2 -complete. TCS, 114:231\u2013245, 1993.","journal-title":"TCS"},{"volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","year":"1994","key":"6_CR14","unstructured":"D. Gabbay et al. (eds). Handbook of Logic in Artificial Intelligence and Logic Programming, Vol.III, Clarendon Press, Oxford, 1994."},{"key":"6_CR15","volume-title":"Logics and Models of Concurrent Systems","author":"D. Gabbay","year":"1985","unstructured":"D. Gabbay. Theoretical foundations for non-monotonic reasoning in expert systems. In K.R. Apt (ed.) Logics and Models of Concurrent Systems. Springer-Verlag, Berlin, 1985."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","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(2):209\u2013230, (1989).","journal-title":"Artificial Intelligence"},{"issue":"5","key":"6_CR17","first-page":"419","volume":"10","author":"Y.J. Jiang","year":"1992","unstructured":"Y.J. Jiang. A first step towards autoepistemic logic programming. Computers and Artificial Intelligence, 10(5):419\u2013441, (1992).","journal-title":"Computers and Artificial Intelligence"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/78935.78936","volume":"37","author":"P.G. Kolaitis","year":"1990","unstructured":"P.G. Kolaitis, C.H. Papadimitriou. Some Computational Aspects of Circumscription. JACM, 37:1\u201314, 1990.","journal-title":"JACM"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","volume":"35","author":"K. Konolige","year":"1988","unstructured":"K. Konolige. On the Relationship between Default and Autoepistemic Logic. Artificial Intelligence, 35:343\u2013382, 1988. + Errata, same journal, 41:115, 1989\/90.","journal-title":"Artificial Intelligence"},{"key":"6_CR20","unstructured":"K. Konolige. On the Relation Between Autoepistemic Logic and Circumscription. In Proceedings IJCAI-89, 1989."},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"S. Kraus, D. Lehmarm and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44(1):167\u2013207, (1990).","journal-title":"Artificial Intelligence"},{"key":"6_CR22","unstructured":"P. Kuhna. Circumscription and minimal models for propositional logics. In Proc. of the First Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, 1993."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(90)90056-6","volume":"42","author":"H.J. Levesque","year":"1990","unstructured":"H.J. Levesque. All I know: a study in autoepistemic logic. Artificial Intelligence, 42:263\u2013309, (1990).","journal-title":"Artificial Intelligence"},{"key":"6_CR24","unstructured":"V. Lifschitz. Computing Circumscription. Proc. of IJCAI'85, 121\u2013127, 1985."},{"key":"6_CR25","volume-title":"Aristotle's syllogistic from the standpoint of modern formal logic.","author":"J. Lukasiewicz","year":"1951","unstructured":"J. Lukasiewicz. Aristotle's syllogistic from the standpoint of modern formal logic. Clarendon Press, Oxford, 1951."},{"key":"6_CR26","volume-title":"Non-Monotonic Reasoning","author":"W. Lukaszewicz","year":"1990","unstructured":"W. Lukaszewicz. Non-Monotonic Reasoning. Ellis Horwood Limited, Chichester, England, 1990."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"J. McCarthy. Applications of circumscription in formalizing common sense knowledge. Artificial Intelligence, 28:89\u2013116, 1986.","journal-title":"Artificial Intelligence"},{"key":"6_CR28","first-page":"1","volume-title":"Non-monotonic Reasoning","author":"D. Makinson","year":"1989","unstructured":"D. Makinson. General theory of cumulative inference. In M. Reinfrank, J. De Kleer, M.L. Ginsberg and E. Sandewall (eds.) Non-monotonic Reasoning, LNAI 346, Springer-Verlag, Berlin, 1989, 1\u201318."},{"volume-title":"Logic Programming and Nonmonotonic Reasoning: Proc. of the Third Int. Conference","year":"1995","key":"6_CR29","unstructured":"W. Marek, A. Nerode, M. Truszczy\u0144ski (eds).Logic Programming and Nonmonotonic Reasoning: Proc. of the Third Int. Conference. LNAI 928, Springer-Verlag, Berlin, 1995."},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"W. Marek, M. Truszczy\u0144ski. Nonmonotonic Logics-Context-Dependent Reasoning. Springer, 1993.","DOI":"10.1007\/978-3-662-02906-0"},{"key":"6_CR31","unstructured":"W. Marek, M. Truszczy\u0144ski. Computing intersections of autoepistemic expansions. In [33]."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"M.A. Nait Abdallah. An extended framework for default reasoning. In Proc. of FCT'89, LNCS 380, 339\u2013348, Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51498-8_33"},{"volume-title":"Logic Programming and Nonmonotonic Reasoning: Proc. of the First Int. Workshop","year":"1991","key":"6_CR33","unstructured":"A. Nerode, W. Marek, V.S. Subrahmanian (eds.). Logic Programming and Nonmonotonic Reasoning: Proc. of the First Int. Workshop, MIT Press, Cambridge, Massachusetts, 1991."},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4. Decision procedures for autoepistemic logic. Proc. LADE-88, LNCS 310, Springer-Verlag, 1988.","DOI":"10.1007\/BFb0012865"},{"key":"6_CR35","first-page":"278","volume-title":"Proc, of TABLEA UX'96","author":"I. Niemel\u00e4","year":"1996","unstructured":"I. Niemel\u00e4. {cA tableau calculus for minimal model reasoning}. In Proc, of TABLEA UX'96, LNAI 1071, pp. 278\u2013294, Springer-Verlag, Berlin, 1996."},{"key":"6_CR36","unstructured":"I. Niemel\u00e4. Implementing circumscription using a tableau method. In Proc. of ECAI, John Wiley & Sons, Ltd., 1996."},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00247828","volume":"9","author":"N. Olivetti","year":"1992","unstructured":"N. Olivetti. Tableaux and sequent calculus for minimal entailment. Journal of Automated Reasoning, 9:99\u2013139, (1992).","journal-title":"Journal of Automated Reasoning"},{"volume-title":"Logic Programming and Non-monotonic Reasoning: Proc. of the Second Int. Workshop","year":"1993","key":"6_CR38","unstructured":"L. M. Pereira, A. Nerode (eds.). Logic Programming and Non-monotonic Reasoning: Proc. of the Second Int. Workshop, MIT Press, Cambridge, Massachusetts, 1993."},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T. Przymusinski","year":"1989","unstructured":"T. Przymusinski. An algorithm to compute circumscription. Art. Int., 38:49\u201373, 1989.","journal-title":"Art. Int."},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81\u2013132, (1980).","journal-title":"Artificial Intelligence"},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF00881957","volume":"13","author":"V. Risch","year":"1994","unstructured":"V. Risch, C.B. Schwind. Tableau-based characterization and theorem proving for default logic. Journal of Automated Reasoning, 13:223\u2013242, 1994.","journal-title":"Journal of Automated Reasoning"},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0168-0072(87)90062-5","volume":"35","author":"J. Schlipf","year":"1987","unstructured":"J. Schlipf. Decidability and Defmability with Circumscription. Annals of Pure and Applied Logics, 35:173\u2013191, 1987.","journal-title":"Annals of Pure and Applied Logics"},{"key":"6_CR43","unstructured":"D. Scott. Completeness proofs for the intuitionistic sentential calculus. Summaries of Talks Presented at the Summer Institute for Symbolic Logic (Itaha, Cornell University, July 1957), Princeton: Institute for Defense Analyses, Communications Research Division, 1957, 231\u2013242."},{"key":"6_CR44","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02121863","volume":"29","author":"J. Slupecki","year":"1971","unstructured":"J. Slupecki, G. Bryll, U. Wybraniec-Skardowska. Theory of rejected propositions. Studia Logica, 29:75\u2013115, (1971).","journal-title":"Studia Logica"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"M. Tiomkin. Proving unprovability. In Proc. of LICS'88, 1988.","DOI":"10.1109\/LICS.1988.5097"},{"key":"6_CR46","first-page":"112","volume":"19","author":"A. Varzi","year":"1990","unstructured":"A. Varzi. Complementary sentential logics. Bulletin of the Section of Logic, 19:112\u2013116, (1990).","journal-title":"Bulletin of the Section of Logic"},{"key":"6_CR47","first-page":"460","volume":"88","author":"L.Y. Yuan","year":"1988","unstructured":"L.Y. Yuan, C.H. Wang. On reducing parallel circumscription. Proc. of AAAI'88, 460\u2013464, 1988.","journal-title":"Proc. of AAAI'"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:51:41Z","timestamp":1586573501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540645702","9783540693536"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/bfb0028009","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}