Sciweavers

4128 search results - page 686 / 826
» Learning and using relational theories
Sort
View
CSL
2004
Springer
15 years 3 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
ATAL
2003
Springer
15 years 3 months ago
Capturing agent autonomy in roles and XML
A key question in the field of agent-oriented software engineering is how the kind and extent of autonomy owned by computational agents can be appropriately captured. As long as ...
Gerhard Weiß, Michael Rovatsos, Matthias Nic...
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
15 years 2 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
ATAL
2006
Springer
15 years 1 months ago
Failures of the VCG mechanism in combinatorial auctions and exchanges
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
Vincent Conitzer, Tuomas Sandholm
IJCAI
1993
14 years 11 months ago
The Range of Applicability of Nonmonotonic Logics for the Inertia Problem
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
Erik Sandewall