5608 search results - page 35 / 1122 » On the Theory of Matchgate Computations |
AAAI
1998
15 years 2 months ago
1998
We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We pre...
116
click to vote
CIE
2005
Springer
15 years 7 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
96
Voted
JSYML
2007
15 years 1 months ago
2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
COLING
1996
15 years 2 months ago
1996
This paper presents a unified theory of verbal irony tbr developing a computational model of irony. The theory claims that an ironic utterance implicitly communicates the fact tha...