Sciweavers

1071 search results - page 20 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
TPHOL
2005
IEEE
14 years 1 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
CSL
2006
Springer
13 years 11 months ago
On Rational Trees
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
Arnaud Carayol, Christophe Morvan
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 7 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
FOIS
2006
13 years 9 months ago
Formalizing Ontology Alignment and its Operations with Category Theory
An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the te...
Antoine Zimmermann, Markus Krötzsch, Jé...
IPPS
1996
IEEE
14 years 5 days ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz