143 search results - page 22 / 29 » Fixed-Parameter Complexity of Semantics for Logic Programs |
106
click to vote
ICFP
2008
ACM
15 years 11 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 ...
210
click to vote
POPL
2003
ACM
15 years 12 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
106
click to vote
PEPM
2009
ACM
15 years 4 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
SEMCO
2007
IEEE
15 years 6 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
169
click to vote
ICLP
2009
Springer
16 years 8 days ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...