2585 search results - page 371 / 517 » Automating Coherent Logic |
155
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
195
click to vote
LICS
2010
IEEE
15 years 4 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, ...
163
click to vote
RR
2010
Springer
15 years 4 months ago
2010
Springer
For multimedia interpretation, and in particular for the combined interpretation of information coming from different modalities, a semantically well-founded formalization is requ...
183
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
177
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...