메뉴 건너뛰기




Volumn , Issue , 2005, Pages 627-634

Solving logic program conflict through strong and weak forgettings

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROPERTIES; CONFLICT SOLVING; LOGIC PROGRAMS; PROPOSITIONAL THEORIES;

EID: 84880705131     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (11)
  • 1
    • 0032687460 scopus 로고    scopus 로고
    • Semantics of (disjunctive) logic programs based on partial evaluation
    • S. Brass and J. Dix. Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic programming, 40(1):1-46, 1999.
    • (1999) Journal of Logic Programming , vol.40 , Issue.1 , pp. 1-46
    • Brass, S.1    Dix, J.2
  • 2
    • 0347303162 scopus 로고    scopus 로고
    • On properties of update sequences based on causal rejection
    • DOI 10.1017/S1471068401001247
    • T. Eiter, M. Fink, G. Sabbatini, and H. Tompits. On properties of update sequences based on causal rejection. Theory and Practice of Logic programming, 2:711-767, 2002. (Pubitemid 135712036)
    • (2002) Theory and Practice of Logic Programming , vol.2 , Issue.6 , pp. 711-767
    • Eiter, T.1    Fink, M.2    Sabbatini, G.3    Tompits, H.4
  • 3
    • 26944489478 scopus 로고    scopus 로고
    • Resolving inconsistencies by variable forgetting
    • J. Lang and P. Marquis. Resolving inconsistencies by variable forgetting. In Proceedings of KR2002, pages 239-250, 2002.
    • (2002) Proceedings of KR2002 , pp. 239-250
    • Lang, J.1    Marquis, P.2
  • 8
    • 0035336688 scopus 로고    scopus 로고
    • On strongest necessary and weakest sufficient conditions
    • DOI 10.1016/S0004-3702(01)00070-4, PII S0004370201000704
    • F. Lin. On the strongest necessary and weakest sufficient conditions. Artificial Intelligence, 128:143-159, 2001. (Pubitemid 32421512)
    • (2001) Artificial Intelligence , vol.128 , Issue.1-2 , pp. 143-159
    • Lin, F.1
  • 10
    • 29344465129 scopus 로고    scopus 로고
    • Updating extended logic programs through abduction
    • C. Sakama and K. Inoue. Updating extended logic programs through abduction. In Proceedings of LPNMR'99, pages 2-17, 1999.
    • (1999) Proceedings of LPNMR'99 , pp. 2-17
    • Sakama, C.1    Inoue, K.2
  • 11
    • 84866948128 scopus 로고    scopus 로고
    • Reasoning about knowledge by variable forgetting
    • K. Su, G. Lv, and Y. Zhang. Reasoning about knowledge by variable forgetting. In Proceedings of KR2004, pages 576-586, 2004.
    • (2004) Proceedings of KR2004 , pp. 576-586
    • Su, K.1    Lv, G.2    Zhang, Y.3


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