Sciweavers

5 search results - page 1 / 1
» Annotation Algorithms for Unrestricted Independent And-Paral...
Sort
View
LOPSTR
2007
Springer
13 years 11 months ago
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo
IJCAI
1989
13 years 6 months ago
Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking
A model of unrestricted And-parallel execution for logic programs is described, based on Dependency Directed Backtracking (DDBT) aimed at improving the efficiency of execution whi...
Nikos Drakos
FUIN
2010
130views more  FUIN 2010»
13 years 3 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
POPL
2006
ACM
14 years 5 months ago
Stratified type inference for generalized algebraic data types
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
François Pottier, Yann Régis-Gianas
ICFP
2003
ACM
14 years 4 months ago
Discriminative sum types locate the source of type errors
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
Matthias Neubauer, Peter Thiemann