Sciweavers

160 search results - page 13 / 32
» Structural characterizations of schema-mapping languages
Sort
View
CIE
2005
Springer
14 years 1 months ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov
ICFP
2007
ACM
14 years 7 months ago
Implicit phasing for R6RS libraries
The forthcoming Revised6 Report on Scheme differs from previous reports in that the language it describes is structured as a set of libraries. It also provides a syntax for defini...
Abdulaziz Ghuloum, R. Kent Dybvig
EDBT
2000
ACM
13 years 11 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
CSL
2008
Springer
13 years 9 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
ACTA
2006
74views more  ACTA 2006»
13 years 7 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer