3119 search results - page 218 / 624 » General Default Logic |
118
click to vote
CORR
2006
Springer
15 years 25 days ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
116
Voted
CORR
2006
Springer
15 years 25 days ago
2006
Springer
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
116
Voted
TCAD
1998
15 years 13 days ago
1998
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
117
Voted
TCS
2010
14 years 11 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
115
Voted
EMNLP
2010
14 years 10 months ago
2010
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...