5084 search results - page 43 / 1017 » Proving Possibility Properties |
WG
1992
Springer
14 years 1 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
APAL
2000
13 years 9 months ago
2000
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...
ECCC
2011
13 years 4 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
ACTA
2002
13 years 9 months ago
2002
We consider XML documents described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties...
AUSAI
2006
Springer
14 years 1 months ago
2006
Springer
This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized ...