Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

LOPSTR
2007
Springer

favoriteEmaildiscussreport

103views Automated Reasoning» more LOPSTR 2007»

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

14 years 7 days ago

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

Download clip.dia.fi.upm.es

Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo

Real-time Traffic

LOPSTR 2007 |

claim paper

Related Content

» Unrestricted AndParallel Execution of Logic Programs with Dependency Directed Backtracking

» SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions

» Stratified type inference for generalized algebraic data types

» Discriminative sum types locate the source of type errors

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	LOPSTR
Authors	Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo

Comments (0)