7988 search results - page 1051 / 1598 » A Useful Undecidable Theory |
150
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
194
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
We perform a theoretical study of the following queryview security problem: given a view V to be published, does V logically disclose information about a confidential query S? The...
186
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
221
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
201
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...