메뉴 건너뛰기




Volumn 20, Issue 1-4, 1997, Pages 1-12

On kernels, defaults and even graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0031506653     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018972125742     Document Type: Article
Times cited : (15)

References (11)
  • 1
    • 85035084069 scopus 로고
    • The complexity of sparse sets in P
    • Lecture Notes in Computer Science
    • E. Allender, The complexity of sparse sets in P, in: Proc. Symp. on Structure in Complexity Theory, Lecture Notes in Computer Science 223 (1986) pp. 1-11.
    • (1986) Proc. Symp. on Structure in Complexity Theory , vol.223 , pp. 1-11
    • Allender, E.1
  • 3
    • 0013026117 scopus 로고
    • A graph theoretic approach to Default Logic
    • Y. Dimopoulos and V. Magirou, A graph theoretic approach to Default Logic, Information & Computation 112 (1994) 239-256.
    • (1994) Information & Computation , vol.112 , pp. 239-256
    • Dimopoulos, Y.1    Magirou, V.2
  • 4
    • 0030408302 scopus 로고    scopus 로고
    • Graph theoretical structures in Logic Programs and Default Theories
    • Y. Dimopoulos and A. Torres, Graph theoretical structures in Logic Programs and Default Theories, Theoretical Computer Science 170 (1996) 209-244.
    • (1996) Theoretical Computer Science , vol.170 , pp. 209-244
    • Dimopoulos, Y.1    Torres, A.2
  • 8
    • 85029531871 scopus 로고
    • On finding extensions of Default Theories
    • eds. J. Biskup and R. Hull, Lecture Notes in Computer Science
    • C.H. Papadimitriou and M. Sideri, On finding extensions of Default Theories, in: Proc. of the International Conference on Database Theory, eds. J. Biskup and R. Hull, Lecture Notes in Computer Science 646 (1992).
    • (1992) Proc. of the International Conference on Database Theory , vol.646
    • Papadimitriou, C.H.1    Sideri, M.2
  • 11


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