Results 1  10
of
1,356
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 558 (0 self)
 Add to MetaCart
] is a bounded interval in R, in modern language the original statement of the theorem was that L 2 ([a, b]) is complete and abstractly isomorphic to l 2. According to [Jah03, p. 385], the name “Hilbert space ” was first used in 1908 by A. Schönflies, apparently to refer to what we today call l 2. Von
Constraint propagation algorithms for temporal reasoning
 Readings in Qualitative Reasoning about Physical Systems
, 1986
"... Abstract: This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of intervalbased and pointbased temporal representations. Computing the consequences of t ..."
Abstract

Cited by 428 (5 self)
 Add to MetaCart
of temporal assertions is shown to be computationally intractable in the intervalbased representation, but not in the pointbased one. However, a fragment of the interval language can be expressed using the point language and benefits from the tractability of the latter. The present paper departs from
Axiomatising Divergence
, 2002
"... This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time  branching time spectrum with silent moves, partially solving an open problem posed in [5 ..."
Abstract
 Add to MetaCart
This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time  branching time spectrum with silent moves, partially solving an open problem posed
A Sound and complete axiomatisations of coalgebraic language equivalence
"... Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence ca ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of Talgebras. We apply our framework to the concrete example of weighted automata, for which we present a new sound and complete calculus for weighted language equivalence. As a special case, we obtain nondeterministic automata, where we recover Rabinovich’s sound and complete calculus for language
Axiomatising divergence
 Information and Computation
, 2005
"... Abstract. This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time – branching time spectrum with silent moves, partially solving an open problem po ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time – branching time spectrum with silent moves, partially solving an open problem
Relational Queries Computable in Polynomial Time
 Information and Control
, 1986
"... We characterize the polynomial time computable queries as those expressible in relational calculus plus a least fixed point operator and a total ordering on the universe. We also show that even without the ordering one application of fixed point suffices to express any query expressible with several ..."
Abstract

Cited by 318 (17 self)
 Add to MetaCart
Query languages for relational databases have received considerable attention. In 1972 Codd showed that two natural languages for queries  one algebraic and the other a version of first order predicate calculus  have identical powers of expressibility, [Cod72]. Query languages which
Relational completeness of data base sublanguages
 Database Systems
, 1972
"... ABSTRACT: In the near future, we can expect a great variety of languages to be proposed for interrogating and updating data bases. This paper attempts to provide a theoretical basis which may be used to determine how complete a selection capability is provided in a proposed data sublanguage independ ..."
Abstract

Cited by 212 (0 self)
 Add to MetaCart
ABSTRACT: In the near future, we can expect a great variety of languages to be proposed for interrogating and updating data bases. This paper attempts to provide a theoretical basis which may be used to determine how complete a selection capability is provided in a proposed data sublanguage
Semantics and Complexity of SPARQL
"... SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the database aspects of SPARQL, concentrating in its graph pattern matching facility. We provide a compositional semantics for the core part of SPARQL, and study the complexity of th ..."
Abstract

Cited by 277 (25 self)
 Add to MetaCart
of the evaluation of several fragments of the language. Among other complexity results, we show that the evaluation of general SPARQL patterns is PSPACEcomplete. We identify a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can
Complete Axiomatisations of Properties of Finite Sets
, 2008
"... We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, both taking a finite set as argument. We present a basic Hilbertstyle axiomatisation, and study its completeness. The ma ..."
Abstract
 Add to MetaCart
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, both taking a finite set as argument. We present a basic Hilbertstyle axiomatisation, and study its completeness
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 276 (27 self)
 Add to MetaCart
that for the determinate language, the set of resting points of a process completely characterizes its behavior on all inputs, since each process can be identified with a closure operator over the underlying constraint system. Very natural definitions of parallel composition, communication and hiding are given
Results 1  10
of
1,356