7988 search results - page 61 / 1598 » A Useful Undecidable Theory |
IJSEKE
2010
13 years 3 months ago
2010
LATA
2010
Springer
14 years 3 months ago
2010
Springer
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
PODS
1997
ACM
14 years 1 months ago
1997
ACM
We consider the problem of answering datalog queries using materialized views. The ability to answer queries using views is crucial in the context of information integration. Prev...
CAV
2004
Springer
14 years 2 months ago
2004
Springer
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...