메뉴 건너뛰기




Volumn 62, Issue 1, 2001, Pages 15-42

Semantics and expressive power of nondeterministic constructs in deductive databases

Author keywords

Declarative semantics; Deductive databases; Expressive power; Fixpoint; Logic based languages; Nondeterminism; Operational semantics

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SYSTEMS PROGRAMMING; FORMAL LOGIC; MATHEMATICAL OPERATORS; QUERY LANGUAGES;

EID: 0035250708     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1699     Document Type: Article
Times cited : (19)

References (32)
  • 10
    • 0002554758 scopus 로고
    • Relational completeness of database sublanguages
    • (R. Rustin, Ed.), Prentice-Hall, Englewood Cliffs, NJ
    • (1972) Data Base Systems , pp. 33-64
    • Codd, E.F.1


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