Sciweavers

12 search results - page 3 / 3
» Computable Versions of Baire's Category Theorem
Sort
View
ATAL
2005
Springer
15 years 2 months ago
Liberalizing protocols for argumentation in multi-agent systems
This publication summarizes research on the the design and implementation of liberalized version of existing truth-finding protocols for argumentation, such as the standard two-a...
Gerard Vreeswijk
FOCS
1998
IEEE
15 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello