3738 search results - page 15 / 748 » Parametrized Logic Programming |
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expres...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...
ILP
2001
Springer
14 years 7 days ago
2001
Springer
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
ICFP
1999
ACM
14 years 3 days ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...