835 search results - page 16 / 167 » Characterizing rosy theories |
103
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
200
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
145
click to vote
ECSQARU
2005
Springer
15 years 7 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
AUTOMATICA
2010
15 years 1 months ago
2010
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...