Sciweavers

10 search results - page 2 / 2
» Order-Sorted Feature Theory Unification
Sort
View
IJAR
2008
129views more  IJAR 2008»
13 years 7 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
ICFP
2005
ACM
14 years 7 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
WWW
2005
ACM
14 years 8 months ago
A uniform approach to accelerated PageRank computation
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...
Frank McSherry
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
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 ...
Boris Yakobowski, Didier Rémy
ICCV
1998
IEEE
13 years 11 months ago
Hyperbolic "Smoothing" of Shapes
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...
Kaleem Siddiqi, Allen Tannenbaum, Steven W. Zucker