Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
448
The Differential Fixpoint Operator with Subsumption
, 1993
"... Declarative languages for deductive and object-oriented databases require some high-level mechanism for specifying semantic control knowledge. This paper proposes user-supplied subsumption information as a paradigm to specify desired, prefered or useful deductions at the meta level. For this pur ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
. For this purpose we augment logic programming by subsumption relations and succeed to extend the classical theorems for least models, fixpoints and bottom-up evaluation accordingly. Moreover, we can provide a differential fixpoint operator for efficient query evaluation. This operator discards subsumed tuples
A note on strong dinaturality, initial algebras and uniform parameterized fixpoint operators
"... ..."
The Semantics of Predicate Logic as a Programming Language
- JOURNAL OF THE ACM
, 1976
"... Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract
-
Cited by 808 (18 self)
- Add to MetaCart
Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract
-
Cited by 592 (12 self)
- Add to MetaCart
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs
Inductive Fixpoints in Higher Order Logic
, 2004
"... We show that an analogue of the domain-theoretic least fixpoint operator can be defined in a purely set-theoretic framework. It can be formalized in classical higher order logic, serving as a solid foundation for proving termination of (possibly nested) recursive programs in a variety of mechanized ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We show that an analogue of the domain-theoretic least fixpoint operator can be defined in a purely set-theoretic framework. It can be formalized in classical higher order logic, serving as a solid foundation for proving termination of (possibly nested) recursive programs in a variety of mechanized
Inductive Fixpoints in Higher Order Logic
"... We show that an analogue of the domain-theoretic least fixpoint operator can be defined in a purely set-theoretic framework. It can be formalized in classical higher order logic, serving as a solid foundation for proving termina-tion of (possibly nested) recursive programs in a variety of mechanized ..."
Abstract
- Add to MetaCart
We show that an analogue of the domain-theoretic least fixpoint operator can be defined in a purely set-theoretic framework. It can be formalized in classical higher order logic, serving as a solid foundation for proving termina-tion of (possibly nested) recursive programs in a variety
On Fixpoint Objects and Gluing Constructions
, 1997
"... This article 1 has two parts: In the first part, we present some general results about fixpoint objects. The minimal categorical structure required to model soundly the equational type theory which combines higher order recursion and computation types (introduced by [4]) is shown to be precisely a ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
a let-category possessing a fixpoint object. Functional completeness for such categories is developed. We also prove that categories with fixpoint operators do not necessarily have a fixpoint object. In the second part, we extend Freyd's gluing construction for cartesian closed categories
Fixpoint Iteration with Subsumption in Deductive Databases
, 1995
"... Declarative languages for deductive and object-oriented databases require some high-level mechanism for specifying semantic control knowledge. This paper proposes user-supplied subsumption information as a paradigm to specify desired, prefered or useful deductions at the meta level. For this purpose ..."
Abstract
-
Cited by 23 (9 self)
- Add to MetaCart
. For this purpose we augment logic programming by subsumption relations and succeed to extend the classical theorems for least models, fixpoints and bottom-up evaluation accordingly. Moreover, we provide a differential fixpoint operator for efficient query evaluation in deductive databases. This operator discards
The Octagon Abstract Domain
, 2007
"... ... domain for static analysis by abstract interpretation. It extends a former numerical abstract domain based on Difference-Bound Matrices and allows us to represent invariants of the form (±x ± y ≤ c), where x and y are program variables and c is a real constant. We focus on giving an efficient re ..."
Abstract
-
Cited by 321 (24 self)
- Add to MetaCart
representation based on Difference-Bound Matrices—O(n 2) memory cost, where n is the number of variables—and graph-based algorithms for all common abstract operators—O(n 3) time cost. This includes a normal form algorithm to test equivalence of representation and a widening operator to compute least fixpoint
Results 1 - 10
of
448
