1743 search results - page 41 / 349 » Generalized Modal Satisfiability |
128
click to vote
ACTA
2005
15 years 3 months ago
2005
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
116
click to vote
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
A user-oriented multimodal interface (MMI) framework is proposed. Considering the complexities of media connotations and uncertainties of the user’s demands, content-based retri...
128
click to vote
SIAMNUM
2010
14 years 10 months ago
2010
We study equations to describe incompressible generalized Newtonian fluids, where the extra stress tensor satisfies a nonstandard anisotropic asymptotic growth condition. An implic...
105
click to vote
SIAMNUM
2011
14 years 10 months ago
2011
We consider the methods xδ n+1 = xδ n − gαn (F (xδ n)∗F (xδ n))F (xδ n)∗(F (xδ n)− yδ) for solving nonlinear ill-posed inverse problems F (x) = y using the only ava...
137
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...