메뉴 건너뛰기




Volumn 258, Issue 1-2, 2001, Pages 523-553

On the equivalence of the static and disjunctive well-founded semantics and its computation

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; THEOREM PROVING;

EID: 0034911473     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00045-1     Document Type: Article
Times cited : (7)

References (36)
  • 5
    • 0031236548 scopus 로고    scopus 로고
    • Characterizations of the disjunctive stable semantics by partial evaluation
    • Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proc. 3rd Internat. Conf., Kentucky, Lecture Notes in Computer Science, vol. 928, Springer, Berlin, 1995, pp. 85-98
    • (1997) J. Logic Programm. , vol.32 , Issue.3 , pp. 207-228
    • Brass, S.1    Dix, J.2
  • 6
    • 0032050871 scopus 로고    scopus 로고
    • Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
    • Extended abstract appeared in: Characterizing D-WFS: confluence and iterated GCWA, Logics in Artificial Intelligence, JELIA '96, Lecture Notes in Computer Science, vol. 1126, Springer, Berlin, 1996, pp. 268-283
    • (1998) J. Automat. Reason. , vol.20 , Issue.1 , pp. 143-165
    • Brass, S.1    Dix, J.2
  • 7
    • 0001254270 scopus 로고    scopus 로고
    • Semantics of (disjunctive) logic programs based on partial evaluation
    • Extended abstract appeared in: Disjunctive semantics based upon partial and bottom-up evaluation, Proc. 12th Internat. Logic Programming Conf., Tokyo, MIT Press, Cambridge, MA, 1995, pp. 199-213
    • (1999) J. Logic Programm. , vol.38 , Issue.3 , pp. 167-213
    • Brass, S.1    Dix, J.2
  • 9
    • 0006496592 scopus 로고
    • Bottom-up query evaluation with partially ordered defaults
    • S. Ceri, K. Tanaka, S. Tsur (eds.), Deductive and Object-Oriented Databases, 3rd Internat. Conf. (DOOD'93), Springer, Berlin
    • (1993) Lecture Notes in Computer Science , vol.760 , pp. 253-266
    • Brass, S.1    Lipeck, U.W.2
  • 16
    • 0004490946 scopus 로고    scopus 로고
    • Mächtigkeit von logikprogrammierung über datenbanken
    • (1996) KI , vol.3 , pp. 32-39
    • Eiter, T.1    Gottlob, G.2
  • 26
    • 84957654645 scopus 로고    scopus 로고
    • Logic and databases: A 20 year retrospective
    • D. Pedreschi, C. Zaniolo (Eds.), Proc. Internat. Workshop on Logic in Databases (LID), Springer, Berlin
    • (1996) Lecture Notes in Computer Science , vol.1154 , pp. 3-58
    • Minker, J.1
  • 28
    • 84958961954 scopus 로고    scopus 로고
    • A tableau calculus for minimal model reasoning
    • P. Miglioli, U. Moscato, D. Mundici, M. Ornaghi (Eds.), Proc. 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Terrasini, Italy, May, Springer, Berlin
    • (1996) Lecture Notes in Artificial Intelligence , vol.1071 , pp. 278-294
    • Niemelä, I.1
  • 34
    • 4444302353 scopus 로고    scopus 로고
    • An efficient computation of the extended generalized closed world assumption by support-for-negation sets
    • Proc. Internat. Conf. on Logic Programming and Automated Reasoning (LPAR'94), Springer, Berlin
    • Lecture Notes in Artifical Intelligence , vol.822 , pp. 245-259
    • Seipel, D.1


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