2152 search results - page 343 / 431 » On Automating the Calculus of Relations |
218
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
195
Voted
ICLP
2009
Springer
16 years 1 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...
199
Voted
ICLP
2009
Springer
16 years 1 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...
200
Voted
ICLP
2009
Springer
16 years 1 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...
100
Voted
CHI
2009
ACM
16 years 1 months ago
2009
ACM
We discuss the problem of assessing and aiding user performance in dynamic tasks that require rapid selection among multiple information sources. Motivated by research in human se...