1101 search results - page 140 / 221 » Forcing in proof theory |
124
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
124
Voted
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
We describe an embedding of the ACL2 logic into higherorder logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers. Categori...
117
click to vote
SIGECOM
2006
ACM
15 years 6 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
83
Voted
ASM
2005
ASM
15 years 6 months ago
2005
ASM
AsmL is a novel executable specification language based on the theory of State Machines (ASMs). It represents one of the most powerful practical engines to write and execute ASMs...
95
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...