7988 search results - page 258 / 1598 » A Useful Undecidable Theory |
118
click to vote
TIME
1994
IEEE
15 years 4 months ago
1994
IEEE
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
133
click to vote
ICDT
2010
ACM
15 years 4 months ago
2010
ACM
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
135
click to vote
MPC
2010
Springer
15 years 2 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
116
click to vote
IJCAI
2003
15 years 2 months ago
2003
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
141
click to vote
TRIER
2002
15 years 13 days ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...