322 search results - page 5 / 65 » Combinations of Abstract Domains for Logic Programming |
85
Voted
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
100
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
LPNMR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
113
click to vote
DLOG
2009
14 years 9 months ago
2009
Abstract. The paper describes how interpretations of multimedia documents can be formally derived using abduction over domain knowledge represented in an ontology. The approach use...
72
Voted
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...