2432 search results - page 132 / 487 » Cryptographic logical relations |
91
Voted
CADE
2008
Springer
16 years 1 months ago
2008
Springer
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
124
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
83
Voted
ECSQARU
2007
Springer
15 years 6 months ago
2007
Springer
A sufficient condition is given for a probability function in Inductive Logic (with relations of all arities) satisfying spectrum exchangeability to additionally satisfy Language ...
97
Voted
CSL
2005
Springer
15 years 6 months ago
2005
Springer
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
77
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...