Sciweavers

159 search results - page 6 / 32
» ELAN from a rewriting logic point of view
Sort
View
VLDB
2007
ACM
104views Database» more  VLDB 2007»
14 years 8 months ago
Unifying Data and Domain Knowledge Using Virtual Views
The database community is on a constant quest for better integration of data management and knowledge management. Recently, with the increasing use of ontology in various applicat...
Lipyeow Lim, Haixun Wang, Min Wang
RTA
2009
Springer
14 years 2 months ago
An Explicit Framework for Interaction Nets
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
Marc de Falco
CORR
2011
Springer
202views Education» more  CORR 2011»
12 years 11 months ago
First-order Logic: Modality and Intensionality
Contemporary use of the term ’intension’ derives from the traditional logical Frege-Russell’s doctrine that an idea (logic formula) has both an extension and an intension. Al...
Zoran Majkic
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
ISCA
2007
IEEE
103views Hardware» more  ISCA 2007»
14 years 2 months ago
Ginger: control independence using tag rewriting
The negative performance impact of branch mis-predictions can be reduced by exploiting control independence (CI). When a branch mis-predicts, the wrong-path instructions up to the...
Andrew D. Hilton, Amir Roth