154 search results - page 15 / 31 » Proof Complexity of Non-classical Logics |
ICCAD
2010
IEEE
14 years 8 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...
LICS
1989
IEEE
15 years 1 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
DLT
2008
14 years 11 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
WOLLIC
2010
Springer
15 years 3 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
ISMVL
1999
IEEE
15 years 2 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...