2722 search results - page 246 / 545 » Automating Language Evolution |
147
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
163
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
142
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
193
click to vote
DLOG
2011
14 years 8 months ago
2011
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
198
click to vote
ICLP
2011
Springer
14 years 8 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...