메뉴 건너뛰기




Volumn 3, Issue 2, 2002, Pages 226-278

Sequent Calculi for Propositional Nonmonotonic Logics

Author keywords

Autoepistemic Logic; Circumscription; Default Logic; Rejection methods; Sequent calculi; Theory

Indexed keywords


EID: 8344243144     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/505372.505374     Document Type: Article
Times cited : (45)

References (57)
  • 1
    • 0043128785 scopus 로고    scopus 로고
    • A proof theoretical approach to default reasoning I: tableaux for default logic
    • Amati, G., Carlucci A. L., Gabbay, D., and Pibri, F. 1996. A proof theoretical approach to default reasoning I: tableaux for default logic. J. Logic and Comput. 6, 2, 205-231
    • (1996) J. Logic and Comput. , vol.6 , Issue.2 , pp. 205-231
    • Amati, G.1    Carlucci, A.L.2    Gabbay, D.3    Pibri, F.4
  • 4
    • 0041656984 scopus 로고
    • On the relation between default and modal consequence relations
    • Morgan Kaufmann
    • Bochman, A. 1994. On the relation between default and modal consequence relations. In Proceedings ofKR'94. Morgan Kaufmann, 63-74
    • (1994) Proceedings ofKR'94 , pp. 63-74
    • Bochman, A.1
  • 5
    • 84856007094 scopus 로고
    • The meaning of negative premises in transition system specifications
    • Number 510 in LNCS. Springer-Verlag
    • Bol, R. N. and Groote, J. F. 1991. The meaning of negative premises in transition system specifications. In Proceedings of ICALP 91. Number 510 in LNCS. Springer-Verlag
    • (1991) Proceedings of ICALP 91
    • Bol, R.N.1    Groote, J.F.2
  • 6
    • 8344275321 scopus 로고
    • A gentzen system for non-theorems
    • CD-TR 93/52, Christian Doppler Labor fur Expertensysteme, Technische Universitat, Wien
    • Bonatti, P. A. 1993. A gentzen system for non-theorems. Tech. Rep. CD-TR 93/52, Christian Doppler Labor fur Expertensysteme, Technische Universitat, Wien
    • (1993) Tech. Rep.
    • Bonatti, P.A.1
  • 7
    • 0028494181 scopus 로고
    • Autoepistemic logic programming
    • Bonatti, P. A. 1994. Autoepistemic logic programming. J. Auto. Reason. 13, 35-67
    • (1994) J. Auto. Reason. , vol.13 , pp. 35-67
    • Bonatti, P.A.1
  • 8
    • 84958976903 scopus 로고    scopus 로고
    • Sequent calculi for default and autoepistemic logics
    • In Number 1071 in LNAI. Springer-Verlag, Berlin
    • Bonatti, P. A. 1996. Sequent calculi for default and autoepistemic logics. In Proceedings of TABLEAUX'96. Number 1071 in LNAI. Springer-Verlag, Berlin, 127-142
    • (1996) Proceedings of TABLEAUX'96 , pp. 127-142
    • Bonatti, P.A.1
  • 9
    • 84958744600 scopus 로고    scopus 로고
    • A sequent calculus for skeptical default logic
    • Number 1227 in LNAI. Springer Verlag
    • Bonatti, P. A. and Olivetti, N. 1997. A sequent calculus for skeptical default logic. In Proceedings of TABLEAUX'97. Number 1227 in LNAI. Springer Verlag, 107-121
    • (1997) Proceedings of TABLEAUX'97 , pp. 107-121
    • Bonatti, P.A.1    Olivetti, N.2
  • 10
    • 0002793440 scopus 로고    scopus 로고
    • A sequent calculus for circumscription
    • In Number 1414 in LNCS. Springer-Verlag
    • Bonatti, P. A. and Olivetti, N. 1998. A sequent calculus for circumscription. In Proceedings of CSL'97. Number 1414 in LNCS. Springer-Verlag, 98-114
    • (1998) Proceedings of CSL'97 , pp. 98-114
    • Bonatti, P.A.1    Olivetti, N.2
  • 11
    • 0030164857 scopus 로고    scopus 로고
    • Querying disjunctive databases through nonmonotonic logics
    • Bonatti, P. A. and Eiter, T. 1996. Querying disjunctive databases through nonmonotonic logics. Theor. Comput. Sci. 160, 321-363
    • (1996) Theor. Comput. Sci. , vol.160 , pp. 321-363
    • Bonatti, P.A.1    Eiter, T.2
  • 12
    • 0026188535 scopus 로고
    • Cumulative default logic: in defense of nonmonotonic inference rules
    • Brewka, G. 1991. Cumulative default logic: in defense of nonmonotonic inference rules. Artificial Intelligence 50, 183-205
    • (1991) Artificial Intelligence , vol.50 , pp. 183-205
    • Brewka, G.1
  • 14
    • 84972539999 scopus 로고
    • A formal system for the non-theorems of the propositional calculus
    • Caicedo, X. 1978. A formal system for the non-theorems of the propositional calculus. Notre Dame J. Formal Logic 19, 147-151
    • (1978) Notre Dame J. Formal Logic , vol.19 , pp. 147-151
    • Caicedo, X.1
  • 15
    • 34249965580 scopus 로고
    • The method of axiomatic rejection for the intuitionistic propositional calculus
    • Dutkiewicz, R. 1989. The method of axiomatic rejection for the intuitionistic propositional calculus. Studia Logica 48, 449-459
    • (1989) Studia Logica , vol.48 , pp. 449-459
    • Dutkiewicz, R.1
  • 17
    • 84947742837 scopus 로고    scopus 로고
    • Non-elementary speed-ups in default logic
    • Number 1244 in LNAI
    • Egly, U. and Tompits, H. 1997b. Non-elementary speed-ups in default logic. In Proceedings of ECSQARU-FAPR'97. Number 1244 in LNAI. 237-251
    • (1997) Proceedings of ECSQARU-FAPR'97. , pp. 237-251
    • Egly, U.1    Tompits, H.2
  • 19
    • 0027608575 scopus 로고
    • Propositional circumscription and extended closed world reasoning are np-complete
    • Eiter, T. and Gottlob, G. 1993. Propositional circumscription and extended closed world reasoning are np-complete. Theor. Comput. Sci. 114, 231-245
    • (1993) Theor. Comput. Sci. , vol.114 , pp. 231-245
    • Eiter, T.1    Gottlob, G.2
  • 20
    • 0002752749 scopus 로고
    • Theoretical foundations for non-monotonic reasoning in expert systems
    • K. R. Apt, Ed. Springer-Verlag, Berlin
    • Gabbay, D. 1985. Theoretical foundations for non-monotonic reasoning in expert systems. In Logics and Models of Concurrent Systems, K. R. Apt, Ed. Springer-Verlag, Berlin
    • (1985) Logics and Models of Concurrent Systems
    • Gabbay, D.1
  • 22
    • 85027530913 scopus 로고
    • Transition system specifications with negative premises
    • Number 458 in LNCS. Springer-Verlag
    • Groote, J. F. 1990. Transition system specifications with negative premises. In Proceedings of Concur 90. Number 458 in LNCS. Springer-Verlag
    • (1990) Proceedings of Concur 90
    • Groote, J.F.1
  • 23
    • 84957620402 scopus 로고
    • A first step towards autoepistemic logic programming
    • Jiang, Y. J. 1992. A first step towards autoepistemic logic programming. Computers and Artificial Intelligence 10, 5, 419-441
    • (1992) Computers and Artificial Intelligence , vol.10 , Issue.5 , pp. 419-441
    • Jiang, Y.J.1
  • 24
    • 0025263359 scopus 로고
    • Some computational aspects of circumscription
    • Kolaitis, P. G. and Papadimitriou, C. H. 1990. Some computational aspects of circumscription. J. ACM 37, 1-14
    • (1990) J. ACM , vol.37 , pp. 1-14
    • Kolaitis, P.G.1    Papadimitriou, C.H.2
  • 25
    • 0024048199 scopus 로고
    • On the relationship between default and autoepistemic logic
    • Konolige, K. 1988. On the relationship between default and autoepistemic logic. Artificial Intelligence 35, 343-382.
    • (1988) Artificial Intelligence , vol.35 , pp. 343-382
    • Konolige, K.1
  • 26
    • 0013452305 scopus 로고
    • On the relation between autoepistemic logic and circumscription
    • Konolige, K. 1989. On the relation between autoepistemic logic and circumscription. In Proceedings of IJCAI-89
    • (1989) Proceedings of IJCAI-89
    • Konolige, K.1
  • 27
    • 0025462359 scopus 로고
    • Nonmonotonic reasoning, preferential models and cumulative logics
    • Kraus, S., Lehmann, D., and Magidor, M. 1990. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44, 1, 167-207
    • (1990) Artificial Intelligence , vol.44 , Issue.1 , pp. 167-207
    • Kraus, S.1    Lehmann, D.2    Magidor, M.3
  • 29
    • 0025403234 scopus 로고
    • All I know: a study in autoepistemic logic
    • Levesque, H. J. 1990. All I know: a study in autoepistemic logic. Artificial Intelligence 42, 263-309
    • (1990) Artificial Intelligence , vol.42 , pp. 263-309
    • Levesque, H.J.1
  • 31
    • 0003453263 scopus 로고
    • Foundations of Logic Programming
    • Springer-Verlag
    • Lloyd, J. W. 1984. Foundations of Logic Programming. Springer-Verlag
    • (1984)
    • Lloyd, J.W.1
  • 32
    • 0003482325 scopus 로고
    • Aristotle's syllogistic from the standpoint of modern formallogic
    • Clarendon Press, Oxford
    • Lukasiewicz, J. 1951. Aristotle's syllogistic from the standpoint of modern formallogic. Clarendon Press, Oxford
    • (1951)
    • Lukasiewicz, J.1
  • 33
    • 0006449414 scopus 로고
    • Non-Monotonic Reasoning
    • Ellis Horwood Limited, Chichester, England
    • Lukasziewicz, W. 1990. Non-Monotonic Reasoning. Ellis Horwood Limited, Chichester, England
    • (1990)
    • Lukasziewicz, W.1
  • 34
    • 84910776762 scopus 로고
    • General theory of cumulative inference
    • M. Reinfrank, J. D. Kleer, M. L. Ginsberg, and E. Sandewall, Eds. Number 346 inLNAI. SpringerVerlag, Berlin
    • Makinson, D. 1989. General theory of cumulative inference. In Non-monotonic Reasoning, M. Reinfrank, J. D. Kleer, M. L. Ginsberg, and E. Sandewall, Eds. Number 346 inLNAI. SpringerVerlag, Berlin, 1-18
    • (1989) Non-monotonic Reasoning , pp. 1-18
    • Makinson, D.1
  • 35
    • 85024273026 scopus 로고    scopus 로고
    • Logic Programming and Non-monotonic Reasoning: Proceedings of the 3rd Internatinal Conference
    • Number 928 in LNAI. SpringerVerlag, Berlin
    • Marek, W., Nerode, A., and Trusczynski, M., Eds. 1995. Logic Programming and Non-monotonic Reasoning: Proceedings of the 3rd Internatinal Conference. Number 928 in LNAI. SpringerVerlag, Berlin
    • Marek, W.1    Nerode, A.2    Trusczynski, M.3
  • 36
    • 84957658157 scopus 로고
    • Computing intersections of autoepistemic expansions
    • Marek, W. and Trusczynnski, M. 1991. Computing intersections of autoepistemic expansions
    • (1991)
    • Marek, W.1    Trusczynnski, M.2
  • 37
    • 0003675587 scopus 로고
    • Nonmonotonic Logics-Context-Dependent Reasoning
    • springer-Verlag
    • Marek, W. and Truszczynski, M. 1993. Nonmonotonic Logics-Context-Dependent Reasoning. springer-Verlag
    • (1993)
    • Marek, W.1    Truszczynski, M.2
  • 38
    • 37349044608 scopus 로고
    • Circumscription: a form of non-monotonic reasoning
    • Mccarthy, J. 1980. Circumscription: a form of non-monotonic reasoning. Artificial Intelligence 13, 27-39
    • (1980) Artificial Intelligence , vol.13 , pp. 27-39
    • Mccarthy, J.1
  • 39
    • 0022661717 scopus 로고
    • Applications of circumscription in formalizing common sense knowledge
    • Mccarthy, J. 1986. Applications of circumscription in formalizing common sense knowledge. Artificial Intelligence 28, 89-116
    • (1986) Artificial Intelligence , vol.28 , pp. 89-116
    • Mccarthy, J.1
  • 40
    • 0021819131 scopus 로고
    • Semantical considerations on non-monotonic logic
    • Moore, R. C. 1985. Semantical considerations on non-monotonic logic. Artificial Intelligence 25, 1, 75-94
    • (1985) Artificial Intelligence , vol.25 , Issue.1 , pp. 75-94
    • Moore, R.C.1
  • 41
    • 85030754328 scopus 로고
    • An extended framework for default reasoning
    • Number 380 in LNCS. Springer-Verlag
    • Nait Abdallah, M. A. 1989. An extended framework for default reasoning. In Proceedings of FCT'89. Number 380 in LNCS. Springer-Verlag, 339-348
    • (1989) Proceedings of FCT'89 , pp. 339-348
    • Abdallah, N.1
  • 42
    • 85024264130 scopus 로고    scopus 로고
    • Logic Programming and Nonmonotonic Reasoning: Proceedings of the 1st International Workshop
    • Eds. 1991. MIT Press, Cambridge, MA
    • Nerode, A., Marek, W., and Subrahmanian, V. S., Eds. 1991. Logic Programming and Nonmonotonic Reasoning: Proceedings of the 1st International Workshop. MIT Press, Cambridge, MA
    • Nerode, A.1    Marek, W.2    Subrahmanian, V.S.3
  • 43
    • 0039149025 scopus 로고    scopus 로고
    • A decision method for autoepistemic logics
    • Niemelä, I. 1995. A decision method for autoepistemic logics. J. Auto. Reason. 14, 3-42
    • J. Auto. Reason , vol.14 , pp. 3-42
    • Niemelä, I.1
  • 44
    • 0004483721 scopus 로고    scopus 로고
    • Implementing circumscription using a tableau method
    • John Wiley & Sons, Ltd
    • Niemelä, I. 1996a. Implementing circumscription using a tableau method. In Proceedings of ECAI. John Wiley & Sons, Ltd
    • (1996) Proceedings of ECAI
    • Niemelä, I.1
  • 45
    • 84958961954 scopus 로고    scopus 로고
    • A tableau calculus for minimal model reasoning
    • Number 1071 in LNAI. Springer-Verlag, Berlin
    • Niemelä, I. 1996b. A tableau calculus for minimal model reasoning. In Proceedings of TABLEAUX'96. Number 1071 in LNAI. Springer-Verlag, Berlin, 278-294
    • (1996) Proceedings of TABLEAUX'96 , pp. 278-294
    • Niemelä, I.1
  • 46
    • 0343328274 scopus 로고
    • Tableaux and sequent calculus for minimal entailment
    • Olivetti, N. 1992. Tableaux and sequent calculus for minimal entailment. J. Auto. Reason. 9, 99-139
    • (1992) J. Auto. Reason. , vol.9 , pp. 99-139
    • Olivetti, N.1
  • 47
    • 85024260089 scopus 로고
    • Logic Programming and Non-monotonic Reasoning: Proceedings of the 2nd International Workshop
    • MIT Press, Cambridge, Massachusetts
    • Pereira, L. M. and Nerode, A., Eds. 1993. Logic Programming and Non-monotonic Reasoning: Proceedings of the 2nd International Workshop. MIT Press, Cambridge, Massachusetts
    • (1993)
    • Pereira, L.M.1    Nerode, A.2
  • 48
    • 0024606665 scopus 로고
    • An algorithm to compute circumscription
    • Przymusinski, T. 1989. An algorithm to compute circumscription. Artificial Intelligence 38, 49-73
    • (1989) Artificial Intelligence , vol.38 , pp. 49-73
    • Przymusinski, T.1
  • 49
    • 49149147322 scopus 로고
    • A logic for default reasoning
    • Reiter, R. 1980. A logic for default reasoning. Artificial Intelligence 13, 81-132
    • (1980) Artificial Intelligence , vol.13 , pp. 81-132
    • Reiter, R.1
  • 50
    • 0028529609 scopus 로고
    • Tableau-based characterization and theorem proving for default logic
    • Risch, V. and Schwind, C. B. 1994. Tableau-based characterization and theorem proving for default logic. J. Auto. Reason. 13, 223-242
    • (1994) J. Auto. Reason. , vol.13 , pp. 223-242
    • Risch, V.1    Schwind, C.B.2
  • 51
    • 38249037346 scopus 로고
    • Decidability and definability with circumscription
    • Schlipf, J. 1987. Decidability and definability with circumscription. Annals of Pure and Applied Logics 35, 173-191
    • (1987) Annals of Pure and Applied Logics , vol.35 , pp. 173-191
    • Schlipf, J.1
  • 52
    • 52649138853 scopus 로고
    • Completeness proofs for the intuitionistic sentential calculus
    • In Summaries of Talks Presented at the Summer Institute for Symbolic Logic (Itaha, Cornell University). Princeton: Institute for Defense Analyses, Communications Research Division
    • Scott, D. 1957. Completeness proofs for the intuitionistic sentential calculus. In Summaries of Talks Presented at the Summer Institute for Symbolic Logic (Itaha, Cornell University). Princeton: Institute for Defense Analyses, Communications Research Division, 231-242
    • (1957) , pp. 231-242
    • Scott, D.1
  • 55
  • 56
    • 84958775612 scopus 로고
    • Complementary logics for classical propositional languages
    • Varzi, A. 1992. Complementary logics for classical propositional languages. Kriterion. Zeitschrift für Philosophie 4, 20-24
    • (1992) Kriterion. Zeitschrift für Philosophie , vol.4 , pp. 20-24
    • Varzi, A.1
  • 57
    • 84912910459 scopus 로고
    • On reducing parallel circumscription
    • Yuan, L. Y. and Wang, C. H. 1988. On reducing parallel circumscription. In Proceedings of AAAI'88. 460-464
    • (1988) Proceedings of AAAI'88 , pp. 460-464
    • Yuan, L.Y.1    Wang, C.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.