Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,480
Description Logic Programs: Combining Logic Programs with Description Logic
, 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract
-
Cited by 529 (46 self)
- Add to MetaCart
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in poly-nomial time by transforming them into a special kind of graph-reachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract
-
Cited by 454 (34 self)
- Add to MetaCart
functions must distribute over the confluence operator (either union or intersection). This class of prob-lems includes—but is not limited to—the classical separ-able problems (also known as “gen/kill ” or “bit-vector” problems)—e.g., reaching definitions, available expres-sions, and live variables
Linear Modeling Of mRNA Expression Levels During CNS Development And Injury
, 1999
"... this paper, we will leave out the inputs to these genes. Since the least squares solution essentially solves a linear regression for each gene independently, failure to achieve a biologically plausible model for some of the genes does not imply that the rest of the model is unreliable. The sum of in ..."
Abstract
-
Cited by 239 (3 self)
- Add to MetaCart
signaling biochemistry. It is not known whether it plays a more central role than the other mGluR's, so this may point to an interesting hypothesis. (However, note that at least 6 other mGluR's are missing from the 65 genes in the intersection of the spinal cord and hippocampus data sets, so
On the Decidability of Query Containment under Constraints
"... Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we addr ..."
Abstract
-
Cited by 256 (56 self)
- Add to MetaCart
address it within a setting where constraints are specified in the form of special inclusion dependencies over complex expressions, built by using intersection and difference of relations, special forms of quantification, regular expressions over binary relations, and cardinality constraints. These types
Efficient Additive Kernels via Explicit Feature Maps
"... Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied to the non-linear intersection kernel, expanding the applicability of this model to much larger problems. In this paper ..."
Abstract
-
Cited by 245 (9 self)
- Add to MetaCart
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied to the non-linear intersection kernel, expanding the applicability of this model to much larger problems. In this paper
Type Inclusion Constraints and Type Inference
- In Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture
, 1993
"... We present a general algorithm for solving systems of inclusion constraints over type expressions. The constraint language includes function types, constructor types, and liberal intersection and union types. We illustrate the application of our constraint solving algorithm with a type inference sys ..."
Abstract
-
Cited by 234 (21 self)
- Add to MetaCart
We present a general algorithm for solving systems of inclusion constraints over type expressions. The constraint language includes function types, constructor types, and liberal intersection and union types. We illustrate the application of our constraint solving algorithm with a type inference
Intersection Types and Computational Effects
, 2000
"... We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for polymorphism adopted in the revised definition of Standard ML. It differs in that it is not tied to let-expressions and re ..."
Abstract
-
Cited by 71 (7 self)
- Add to MetaCart
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for polymorphism adopted in the revised definition of Standard ML. It differs in that it is not tied to let-expressions
Programming with Intersection Types and Bounded Polymorphism
, 1991
"... representing the official policies, either expressed or implied, of the U.S. Government. ..."
Abstract
-
Cited by 77 (4 self)
- Add to MetaCart
representing the official policies, either expressed or implied, of the U.S. Government.
On the Intersection of XPath Expressions
- IDEAS
, 2005
"... XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the last years some of the characteristics of XPath have been discussed. Examples include the containment of two XPath expressio ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
expressions p and p ′ (p ⊆ p ′). To the best of our knowledge the intersection of two XPath expressions (p ∩ p ′ ) has not been treated yet. The intersection of p and p ′ is the set that contains all XML nodes that are selected both by p and p ′. In the context of indexes in XML databases the emptiness
Two dimensional gauge theories revisited
- J. Geom. Phys
, 1992
"... Two dimensional quantum Yang-Mills theory is reexamined using a non-abelian version of the Duistermaat-Heckman integration formula to carry out the functional integral. This makes it possible to explain properties of the theory that are inaccessible to standard methods and to obtain general expressi ..."
Abstract
-
Cited by 200 (3 self)
- Add to MetaCart
expressions for intersection pairings on moduli spaces of flat connections on a two dimensional surface. The latter expressions agree, for gauge group SU(2), with formulas obtained recently by several methods. This paper will be devoted to a renewed study of two dimensional Yang-Mills theory without matter, a
Results 1 - 10
of
1,480
