10 search results - page 2 / 2 » Order-Sorted Feature Theory Unification |
140
Voted
IJAR
2008
15 years 2 months ago
2008
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
132
Voted
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
137
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
135
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
123
Voted
ICCV
1998
IEEE
15 years 7 months ago
1998
IEEE
We have been developing a theory of generic 2-D shape based on a reaction-diffusion model from mathematical physics. The description of a shape is derived from the singularities o...