Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
422,183
Unification and Anti-Unification in the Calculus of Constructions
- In Sixth Annual IEEE Symposium on Logic in Computer Science
, 1991
"... We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variables (the variables subject to instantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed -calculus by Miller. Most general unifiers and ..."
Abstract
-
Cited by 74 (17 self)
- Add to MetaCart
and least common antiinstances are shown to exist and are unique up to a simple equivalence. The unification algorithm is used for logic program execution and type and term reconstruction in the current implementation of Elf and has shown itself to be practical. The main application of the anti-unification
Metaphors and Anti-Unification
"... A classical approach of modeling metaphoric expressions uses a source concept network that is mapped to a target concept network. Both networks are usually represented as algebras. We present a representation using the mathematically sound framework of anti-unification. We will interpret metaphors a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
A classical approach of modeling metaphoric expressions uses a source concept network that is mapped to a target concept network. Both networks are usually represented as algebras. We present a representation using the mathematically sound framework of anti-unification. We will interpret metaphors
Unification and Anti-Unification in the Calculus of Constructions
"... We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variables (the variables subject to instantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed λ-calculus by Miller. Most general unifiers and ..."
Abstract
- Add to MetaCart
and least common antiinstances are shown to exist and are unique up to a simple equivalence. The unification algorithm is used for logic program execution and type and term reconstruction in the current implementation of Elf and has shown itself to be practical. The main application of the anti-unification
Anti-Unification with Type Classes
- JOURNÉES FRANCOPHONES DES LANGAGES APPLICATIFS (JFLA) (2013)" JFLA’13
, 2013
"... ..."
The Semantics Of Constraint Logic Programs
- JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract
-
Cited by 872 (14 self)
- Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing agent ..."
Abstract
-
Cited by 502 (16 self)
- Add to MetaCart
, indeterministic choice, interleaving, and hiding, and provides a mutual recur-sion operator. cc(.L,-t) is (intentionally!) very similar to Milner’s CCS, but for the radically different under-lying concept of communication, which, in fact, pro-’ The class is founded on the notion of “constraint logic pro-gramming
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract
-
Cited by 864 (25 self)
- Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
A Library of Anti-Unification Algorithms
"... Abstract. Generalization problems arise in many branches of artificial intelli-gence: machine learning, analogical and case-based reasoning, cognitive mod-eling, knowledge discovery, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open-s ..."
Abstract
- Add to MetaCart
Abstract. Generalization problems arise in many branches of artificial intelli-gence: machine learning, analogical and case-based reasoning, cognitive mod-eling, knowledge discovery, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract
-
Cited by 616 (76 self)
- Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Results 1 - 10
of
422,183
