210 search results - page 2 / 42 » Definability and automorphisms in abstract logics |
CP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
FSTTCS
2009
Springer
13 years 10 months ago
2009
Springer
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequen...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
AAAI
2010
13 years 8 months ago
2010
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
ASIAN
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...