284 search results - page 53 / 57 » On Reversible Combinatory Logic |
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
EDCC
2008
Springer
13 years 11 months ago
2008
Springer
Faults attacks are a powerful tool to break some implementations of robust cryptographic algorithms such as AES [8] and DES [3]. Various methods of faults attack on cryptographic ...
LREC
2008
13 years 11 months ago
2008
Combinatorial Category Grammar is (CCG) a lexicalized grammar formalism which is expressed by syntactic category, a logical form representation. There are difficulties in represen...
IANDC
2006
13 years 9 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...