367 search results - page 13 / 74 » A Rewriting Logic Sampler |
116
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
121
Voted
FDL
2003
IEEE
15 years 5 months ago
2003
IEEE
Reconfigurable Systolic Arrays are a generalization of Systolic Arrays where node operations and interconnections can be redefined even at run time. This flexibility increases the...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
115
Voted
AAAI
2008
15 years 2 months ago
2008
Logic programming with negation offers a compelling approach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion semantics, unde...
110
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...