Sciweavers

14 search results - page 2 / 3
» On the intermediate logic of open subsets of metric spaces
Sort
View
AMAI
2008
Springer
13 years 5 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 8 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
JSYML
2010
120views more  JSYML 2010»
13 years 8 days ago
Universally measurable subgroups of countable index
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
Christian Rosendal
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 5 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
AAAI
2006
13 years 7 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith