Sciweavers

11017 search results - page 171 / 2204
» Closure Systems and their Structure
Sort
View
TSD
2000
Springer
13 years 11 months ago
Automatic Functor Assignment in the Prague Dependency Treebank
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
Zdenek Zabokrtský
ENTCS
2006
112views more  ENTCS 2006»
13 years 8 months ago
Synchronous Dataflow Pattern Matching
We introduce variant types and a pattern matching operation to synchronous dataflow languages. These languages are used in the design of reactive systems. As these systems grow in...
Grégoire Hamon
ICCS
1999
Springer
14 years 14 days ago
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...
Guy W. Mineau, Gerd Stumme, Rudolf Wille
ESOP
2009
Springer
14 years 3 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
TPHOL
2005
IEEE
14 years 1 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown