1960 search results - page 30 / 392 » The Logic of Large Enough |
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
LATA
2012
Springer
12 years 3 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
GLVLSI
2006
IEEE
14 years 1 months ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We show how to automatically generate analytic hypersequent calculi for a large class of logics containing the linearity axiom (lin) (A ⊃ B) ∨ (B ⊃ A) starting from...