{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:34:40Z","timestamp":1725564880219},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404941"},{"type":"electronic","value":"9783540450627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45062-7_46","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T02:14:10Z","timestamp":1283566450000},"page":"564-575","source":"Crossref","is-referenced-by-count":1,"title":["A Sequent Calculus for Skeptical Reasoning in Predicate Default Logic (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Robert Saxon","family":"Milnikel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/505372.505374","volume":"3","author":"P. Bonatti","year":"2002","unstructured":"Bonatti, P., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Log.\u00a03, 226\u2013278 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"46_CR2","doi-asserted-by":"publisher","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. Art. Int.\u00a013, 81\u2013132 (1980)","journal-title":"Art. Int."},{"key":"46_CR3","first-page":"1070","volume-title":"Proceedings of the 5th Annual Symposium on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Kowalski, R.A., Bowen, K.A. (eds.) Proceedings of the 5th Annual Symposium on Logic Programming, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"46_CR4","unstructured":"Moore, R.C.: Possible-world semantics for the autoepistemic logic. In: Reiter, R. (ed.) Proceedings of the Workshop on Non-Monotonic Reasoning, pp. 344\u2013354 (1984)"},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0743-1066(14)80008-3","volume":"21","author":"V.W. Marek","year":"1994","unstructured":"Marek, V.W., Nerode, A., Remmel, J.B.: The stable models of a predicate logic program. J. Log. Prog.\u00a021, 129\u2013154 (1994)","journal-title":"J. Log. Prog."},{"key":"46_CR6","first-page":"623","volume-title":"Handbook of Recursive Mathematics","author":"D. Cenzer","year":"1998","unstructured":"Cenzer, D., Remmel, J.B.: \n                    \n                      \n                    \n                    $\\pi^{0}_1$\n                   classes in mathematics. In: Ershov, Y.L., Goncharov, S.S., Marek, V.W., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol.\u00a02, pp. 623\u2013821. North-Holland, Amsterdam (1998)"},{"key":"46_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-642-76274-1_3","volume-title":"Computational Logic. Symposium Proceedings","author":"V. Lifschitz","year":"1990","unstructured":"Lifschitz, V.: On open defaults. In: Lloyd, J.W. (ed.) Computational Logic. Symposium Proceedings, pp. 80\u201395. Springer, Heidelberg (1990)"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0168-0072(02)00064-7","volume":"120","author":"R.S. Milnikel","year":"2003","unstructured":"Milnikel, R.S.: The complexity of predicate default logic over a countable domain. Ann. Pure Appl. Log.\u00a0120, 151\u2013163 (2003)","journal-title":"Ann. Pure Appl. Log."},{"key":"46_CR9","unstructured":"Bonatti, P.: A gentzen system for non-theorems. Technical Report CD-TR 93\/52, Christian Doppler Labor f\u00fcr Expertensysteme (1993)"},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0049-237X(08)71097-8","volume-title":"Handbook of Mathematical Logic","author":"J. Barwise","year":"1977","unstructured":"Barwise, J.: An introduction to first-order logic. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 5\u201346. North-Holland, Amsterdam (1977)"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2687821","volume":"7","author":"S.N. Artemov","year":"2001","unstructured":"Artemov, S.N.: Explicit provability and constructive semantics. Bull. Symbolic Logic\u00a07, 1\u201336 (2001)","journal-title":"Bull. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45062-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T21:10:03Z","timestamp":1553029803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45062-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404941","9783540450627"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45062-7_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}