Sciweavers

176 search results - page 32 / 36
» On the analysis of queries with counting constraints
Sort
View
SIGSOFT
2000
ACM
14 years 29 days ago
COM revisited: tool-assisted modelling of an architectural framework
Designing architectural frameworks without the aid of formal modeling is error prone. But, unless supported by analysis, formal modeling is prone to its own class of errors, in wh...
Daniel Jackson, Kevin J. Sullivan
WEBI
2010
Springer
13 years 6 months ago
Research Interests: Their Dynamics, Structures and Applications in Web Search Refinement
For most scientists, their research interests are dynamically changing all the time. Through an analysis of research interests, we find that all the changes are with some character...
Yi Zeng, Erzhong Zhou, Yulin Qin, Ning Zhong
AIPS
2008
13 years 11 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
PODS
2008
ACM
174views Database» more  PODS 2008»
14 years 8 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 8 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...