1805 search results - page 97 / 361 » A Theory of Closure Operators |
135
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
117
click to vote
LICS
2000
IEEE
15 years 8 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
165
click to vote
ESOP
2006
Springer
15 years 8 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
129
click to vote
AI
2007
Springer
15 years 4 months ago
2007
Springer
Argumentation theory has become an important topic in the field of AI. The basic idea is to construct arguments in favor and against a statement, to select the “acceptable” o...
130
click to vote
IJCM
2010
15 years 2 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...