|
Volumn , Issue , 1993, Pages 202-213
|
On the feasibility of checking temporal integrity constraints
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
CONSTRAINT THEORY;
LOGIC PROGRAMMING;
TEMPORAL LOGIC;
DATABASE SYSTEMS;
|
EID: 0027887430
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/153850.153876 Document Type: Conference Paper |
Times cited : (6)
|
References (16)
|