Results 1 
5 of
5
Semantic Representations And Query Languages For OrSets
 IN PROCEEDINGS OF 12TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
, 1993
"... Orsets were introduced by Imielinski, Naqvi and Vadaparty for dealing with limited forms of disjunctive information in database queries. Independently, Rounds used a similar notion for representing disjunctive and conjunctive information in the context of situation theory. In this paper we formulat ..."
Abstract

Cited by 29 (18 self)
 Add to MetaCart
Orsets were introduced by Imielinski, Naqvi and Vadaparty for dealing with limited forms of disjunctive information in database queries. Independently, Rounds used a similar notion for representing disjunctive and conjunctive information in the context of situation theory. In this paper we formulate a query language with adequate expressive power for orsets. Using the notion of normalization of orsets, queries at the "structural" and "conceptual" levels are distinguished. Losslessness of normalization is established for a large class of queries. We have obtained upper bounds for the cost of normalization. An approach related to that of Rounds is used to provide semantics for orsets. We also treat orsets in the context of partial information in databases.
A Semantic Theory for ValuePassing Processes Late Approach  Part I: A Denotational Model and Its Complete Axiomatization
, 1995
"... A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete language is given, an instantiation of the general class. An equationally based proof system is defined and shown to be sound and complete with respect to the model.
Resolution in the Smyth Powerdomain
 Proceedings of the 13rd International Conference on Mathematical Foundations of Programming Semantics (MFPS'97), ENTCS
, 1998
"... The purposes of this paper are (i) to give a new, efficient representation of Smyth powerdomains as 0inhabited information systems, following the style of Scott; (ii) to introduce, as a consequence of this representation, a generalized resolution method for an arbitrary Smyth powerdomain and show t ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The purposes of this paper are (i) to give a new, efficient representation of Smyth powerdomains as 0inhabited information systems, following the style of Scott; (ii) to introduce, as a consequence of this representation, a generalized resolution method for an arbitrary Smyth powerdomain and show the soundness and completeness of this method. The connection of (i) with (ii) comes from the observation that the elements of a Smyth powerdomain are semantically equivalent to the basic notion of "clauses" as used in the area of logic programming. 1 Introduction This paper proposes a generalized resolution rule for an arbitrary Smyth powerdomain, which we believe gives some insight into the foundations of proof systems for different kinds of logics. It began as a paper in domain theory, the mathematical foundation for denotational semantics of programming languages, developed, as is wellknown, by Dana Scott and others. It works with the concept of information systems, Scott's method for ...
Algebraic Characterization of Edible Powerdomains
, 1993
"... Powerdomains like mixes, sandwiches, snacks and scones are typically used to provide semantics of collections of descriptions of partial data. In particular, they were used to give semantics of databases with partial information. In this paper we argue that to be able to put these constructions into ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Powerdomains like mixes, sandwiches, snacks and scones are typically used to provide semantics of collections of descriptions of partial data. In particular, they were used to give semantics of databases with partial information. In this paper we argue that to be able to put these constructions into the context of a programming language it is necessary to characterize them as free (ordered) algebras. Two characterizations  for mixes and snacks  are already known, and in the first part of the paper we give characterizations for scones and sandwiches and provide an alternative characterization of snacks. The algebras involved have binary and unary operations and relatively simple equational theories. We then define a new construction, which is in essence all others put together (hence called salad) and give its algebraic characterization. It is also shown how all algebras considered in the paper are related in a natural way, that is, in a way that corresponds to embeddings of their p...
An InformationSystem Representation Of The Smyth Powerdomain
 International Symposium on Domain Theory
, 1999
"... . This paper provides a representation of the Smyth powerdomain as information systems. A new notion of ideal elements, called disjunctive states, is introduced. Disjunctive states are built from clauses over the token set of the underlying information system in order to represent disjunctive in ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. This paper provides a representation of the Smyth powerdomain as information systems. A new notion of ideal elements, called disjunctive states, is introduced. Disjunctive states are built from clauses over the token set of the underlying information system in order to represent disjunctive information. At the heart of this representation is a hyperresolution rule, whose completeness hinges upon a crucial combinatorial lemma for the proper bookkeeping of intermediate clauses. Our main representation result uses the HoffmanMislove Theorem to establish an orderisomorphism between disjunctive states and compact, saturated sets. As an application, we provide a couple of specific Smyth powerdomain examples that are useful for disjunctive logic programming. Moreover, the notion of disjunctive state is immediately applicable to sequent structures, or nondeterministic information systems. We show that the hyperresolution rule is sound and complete for sequent structures as we...