188 search results - page 24 / 38 » Logic of Proofs for Bounded Arithmetic |
111
click to vote
LOGCOM
2010
14 years 6 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
JAR
2008
14 years 11 months ago
2008
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equat...
107
click to vote
CSL
2010
Springer
15 years 24 days ago
2010
Springer
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
ICCAD
2010
IEEE
14 years 9 months ago
2010
IEEE
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
101
click to vote
CADE
2012
Springer
13 years 2 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...