Sciweavers

27 search results - page 3 / 6
» iandc 2007
Sort
View
IANDC
2007
96views more  IANDC 2007»
13 years 4 months ago
A general mathematics of names
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...
Murdoch Gabbay
IANDC
2007
117views more  IANDC 2007»
13 years 4 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
IANDC
2007
132views more  IANDC 2007»
13 years 4 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza
IANDC
2007
123views more  IANDC 2007»
13 years 4 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
IANDC
2007
81views more  IANDC 2007»
13 years 4 months ago
Some natural conditions on incremental learning
The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
Sanjay Jain, Steffen Lange, Sandra Zilles