274 search results - page 11 / 55 » Weighted Automata and Weighted Logics |
IJCAI
2007
13 years 9 months ago
2007
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
ECAI
2004
Springer
14 years 26 days ago
2004
Springer
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
CAV
2012
Springer
11 years 10 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
EUSFLAT
2009
13 years 5 months ago
2009
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...