Sciweavers

16 search results - page 3 / 4
» amai 2005
Sort
View
AMAI
2005
Springer
13 years 5 months ago
Logic programming with infinite sets
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...
Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Ma...
AMAI
2005
Springer
13 years 5 months ago
Auction design with costly preference elicitation
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
David C. Parkes
AMAI
2005
Springer
13 years 5 months ago
Generalizations of matched CNF formulas
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
Stefan Szeider
AMAI
2005
Springer
13 years 5 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
AMAI
2005
Springer
13 years 5 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan