2989 search results - page 49 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
FORMATS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
FMCAD
2008
Springer
14 years 11 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
ICFCA
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
EMNLP
2008
14 years 11 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...