110 search results - page 20 / 22 » A Tutorial on Proof Theoretic Foundations of Logic Programmi... |
PODS
2005
ACM
14 years 7 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
SIGSOFT
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
EDBT
1990
ACM
13 years 11 months ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
PODS
2002
ACM
14 years 7 months ago
2002
ACM
Research on information extraction from Web pages (wrapping) has seen much activity in recent times (particularly systems implementations), but little work has been done on formal...