6554 search results - page 48 / 1311 » Constraint Logic Programming |
135
Voted
ICFP
2008
ACM
16 years 2 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 ...
124
click to vote
PPDP
2004
Springer
15 years 8 months ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
119
Voted
ISSTA
2004
ACM
15 years 8 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
103
Voted
DOCENG
2009
ACM
15 years 9 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
139
Voted
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...