Sciweavers

4767 search results - page 89 / 954
» Structures for Abstract Rewriting
Sort
View
CACM
1999
113views more  CACM 1999»
13 years 9 months ago
Object-oriented Abstractions for Distributed Programming
ion suffices ("decide which type you want and provide a full set of operations for each type"). If the application domain is, say, the administration of a university, the...
Rachid Guerraoui, Mohamed Fayad
IPPS
2006
IEEE
14 years 3 months ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
GG
2004
Springer
14 years 3 months ago
Representing First-Order Logic Using Graphs
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
Arend Rensink
INEX
2004
Springer
14 years 3 months ago
TIJAH at INEX 2004 Modeling Phrases and Relevance Feedback
This paper discusses our participation in INEX using the TIJAH XML-IR system. We have enriched the TIJAH system, which follows a standard layered database architecture, with severa...
Vojkan Mihajlovic, Georgina Ramírez, Arjen ...
TABLEAUX
2009
Springer
14 years 2 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard