4573 search results - page 795 / 915 » Automated Reasoning |
224
click to vote
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
232
click to vote
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
188
click to vote
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
Suspension-based tabling systems have to save and restore computation states belonging to OR branches. Stack freezing combined with (forward) trailing is among the better-known imp...
225
click to vote
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
210
click to vote
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...