Results 1  10
of
337,999
A semantics of multiple inheritance
 Information and Computation
, 1988
"... There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types) and func ..."
Abstract

Cited by 528 (9 self)
 Add to MetaCart
There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 451 (34 self)
 Add to MetaCart
The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow
L.: Rigidity of scattering lengths and traveling times for disjoint unions of convex bodies
, 2014
"... Abstract. Obstacles K and L in IRd (d ≥ 2) are considered that are finite disjoint unions of strictly convex domains with C3 boundaries. We show that if K and L have (almost) the same scattering length spectrum, or (almost) the same travelling times, then K = L. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Obstacles K and L in IRd (d ≥ 2) are considered that are finite disjoint unions of strictly convex domains with C3 boundaries. We show that if K and L have (almost) the same scattering length spectrum, or (almost) the same travelling times, then K = L. 1
Efficiency of a Good But Not Linear Set Union Algorithm
, 1975
"... Two types of instructmns for mampulating a family of disjoint sets which partitmn a umverse of n elements are considered FIND(x) computes the name of the (unique) set containing element x UNION(A, B, C) combines sets A and B into a new set named C. A known algorithm for implementing sequences of the ..."
Abstract

Cited by 319 (15 self)
 Add to MetaCart
Two types of instructmns for mampulating a family of disjoint sets which partitmn a umverse of n elements are considered FIND(x) computes the name of the (unique) set containing element x UNION(A, B, C) combines sets A and B into a new set named C. A known algorithm for implementing sequences
The complexity of unions of disjoint sets
 In Proceedings 24th Symposium on Theoretical Aspects of Computer Science
, 2007
"... This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NPcomplete. We discover that such unions retain much of the complexity of their single components. More precisely, they are complete with respect to more general reducibilities. Moreover, we app ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NPcomplete. We discover that such unions retain much of the complexity of their single components. More precisely, they are complete with respect to more general reducibilities. Moreover, we
For
, 2013
"... Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite. 2000 Mathematics Subject Classification: 20M05. 1 ..."
Abstract
 Add to MetaCart
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite. 2000 Mathematics Subject Classification: 20M05. 1
A Correspondence Theory for Terminological Logics: Preliminary Report
 In Proc. of IJCAI91
, 1991
"... We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K (m) . To demonstrate the utility of the correspondence, we give two of its immediate byproducts. Namely, we axiomatize ALC and give a ..."
Abstract

Cited by 307 (0 self)
 Add to MetaCart
a simple proof that subsumption in ALC is PSPACEcomplete, replacing the original sixpage one. Furthermore, we consider an extension of ALC additionally containing both the identity role and the composition, union, transitivereflexive closure, range restriction, and inverse of roles. It turns out
DISJOINT UNIONS OF TOPOLOGICAL SPACES AND CHOICE
, 1997
"... Abstract. We find properties of topological spaces which are not shared by disjoint unions in the absence of some form of the Axiom of Choice. Introduction and Terminology This is a continuation of the study of the roll the Axiom of Choice plays in general topology. See also [vd], [gt], [wgt], and [ ..."
Abstract
 Add to MetaCart
Abstract. We find properties of topological spaces which are not shared by disjoint unions in the absence of some form of the Axiom of Choice. Introduction and Terminology This is a continuation of the study of the roll the Axiom of Choice plays in general topology. See also [vd], [gt], [wgt
Unions of Disjoint NPComplete Sets
"... Abstract. We study the following question: if A and B are disjoint NPcomplete sets, then is A ∪ B NPcomplete? We provide necessary and sufficient conditions under which the union of disjoint NPcomplete sets remain complete. 1 ..."
Abstract
 Add to MetaCart
Abstract. We study the following question: if A and B are disjoint NPcomplete sets, then is A ∪ B NPcomplete? We provide necessary and sufficient conditions under which the union of disjoint NPcomplete sets remain complete. 1
Results 1  10
of
337,999