395 search results - page 65 / 79 » Encoding Algorithms for Logic Synthesis |
108
click to vote
ESOP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
109
click to vote
PPDP
2005
Springer
15 years 7 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
166
Voted
AAAI
2010
15 years 3 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
142
Voted
RR
2010
Springer
15 years 5 days ago
2010
Springer
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped co...
CSL
2008
Springer
15 years 4 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...