3481 search results - page 132 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
SAC
2009
ACM
15 years 4 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
106
click to vote
PLANX
2007
14 years 11 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
SMALLTALK
2007
Springer
15 years 4 months ago
2007
Springer
119
click to vote
ICLP
2003
Springer
15 years 3 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
LPNMR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...