메뉴 건너뛰기




Volumn 1085, Issue , 1996, Pages 231-245

An abductive proof procedure for conditional logic programming

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

EID: 84947914773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61313-7_76     Document Type: Conference Paper
Times cited : (2)

References (18)
  • 1
    • 84990602723 scopus 로고
    • Combining knowledge bases consisting of first-order theories
    • C. Baral, S. Kraus, J. Minker, V. S. Subrahmanian. Combining knowledge bases consisting of first-order theories. J. Automated Reasoning, vol. 8, n. 1, pp. 45-71, 1992.
    • (1992) J. Automated Reasoning , vol.8 , Issue.1 , pp. 45-71
    • Baral, C.1    Kraus, S.2    Minker, J.3    Subrahmanian, V.S.4
  • 3
    • 0343676690 scopus 로고
    • Proving theorems in a multi-source environment
    • Chambery
    • L. Cholvy. Proving theorems in a multi-source environment. In Proc. IJCAI-93, pages 66-71, Chambery, 1993.
    • (1993) Proc. IJCAI-93 , pp. 66-71
    • Cholvy, L.1
  • 4
    • 0026294853 scopus 로고
    • Negations as hypotheses: An abductive foundation for logic programming
    • P. M. Dung. Negations as hypotheses: an abductive foundation for logic programming. In Proc. ICLP-91 Conference, pages 3-17, 1991.
    • (1991) Proc. ICLP-91 Conference , pp. 3-17
    • Dung, P.M.1
  • 5
    • 0003076098 scopus 로고
    • On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming
    • P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming. In Proc. IJCAI’93, pages 852-857, 1993.
    • (1993) Proc. IJCAI’93 , pp. 852-857
    • Dung, P.M.1
  • 6
    • 0002061313 scopus 로고
    • Abduction compared with negation by failure
    • Lisbon
    • K. Eshghi and R. Kowalski. Abduction compared with negation by failure. In Proc. 6th ICLP, pages 234-254, Lisbon, 1989.
    • (1989) Proc. 6th ICLP , pp. 234-254
    • Eshghi, K.1    Kowalski, R.2
  • 8
    • 0021636426 scopus 로고
    • NProlog: An extension of Prolog with hypothetical implications.I
    • D. M. Gabbay and N. Reyle. NProlog: An extension of Prolog with hypothetical implications.I. Journal of Logic Programming, (4):319-355, 1984.
    • (1984) Journal of Logic Programming , Issue.4 , pp. 319-355
    • Gabbay, D.M.1    Reyle, N.2
  • 10
    • 21844495750 scopus 로고
    • Hypothetical updates, priority and inconsistency in a logic programming language
    • LNAI 928
    • Dov Gabbay, Laura Giordano, Alberto Martelli, and Nicola Olivetti. Hypothetical updates, priority and inconsistency in a logic programming language. In Proc. LPNMR-95, LNAI 928, pages 203-216, 1995.
    • (1995) Proc. LPNMR-95 , pp. 203-216
    • Gabbay, D.1    Giordano, L.2    Martelli, A.3    Olivetti, N.4
  • 11
    • 0002443032 scopus 로고
    • Logic programs with classical negation
    • Jerusalem
    • M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proc. ICLP-90, pages 579-597, Jerusalem, 1990.
    • (1990) Proc. ICLP-90 , pp. 579-597
    • Gelfond, M.1    Lifschitz, V.2
  • 12
    • 0002822087 scopus 로고
    • The acceptability semantics for logic programs
    • Santa Margherita Ligure
    • A.C. Kakas, P. Mancarella, P.M. Dung. The acceptability semantics for logic programs. In Proc. 11th ICLP, Santa Margherita Ligure, pages 504-519, 1994.
    • (1994) Proc. 11th ICLP , pp. 504-519
    • Kakas, A.C.1    Mancarella, P.2    Dung, P.M.3
  • 13
    • 0040081053 scopus 로고
    • Ordered logic programming with sets
    • N. Leone and P. Rullo. Ordered logic programming with sets. J. of Logic and Computation, 3(6):621-642, 1993.
    • (1993) J. of Logic and Computation , vol.3 , Issue.6 , pp. 621-642
    • Leone, N.1    Rullo, P.2
  • 15
    • 85030461733 scopus 로고
    • Aparicio Contradiction Removal within the Well Founded Semantics
    • L.M. Pereira, J.J. Alferes, J.N. Aparicio Contradiction Removal within the Well Founded Semantics. Proc. LPNMR-91, (1991) 105-119.
    • (1991) Proc. LPNMR-91 , pp. 105-119
    • Pereira, L.M.1    Alferes, J.J.J.N.2
  • 17
    • 84947912880 scopus 로고
    • Computing the acceptability semantics
    • F. Toni and A. Kakas. Computing the acceptability semantics. In Proc. LPNMR-95, pages 401-415, 1995.
    • (1995) Proc. LPNMR-95 , pp. 401-415
    • Toni, F.1    Kakas, A.2


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