567 search results - page 86 / 114 » Probabilistic Reasoning With Answer Sets |
164
Voted
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
RECSYS
2009
ACM
15 years 4 months ago
2009
ACM
Recommender systems aim to substantially reduce information overload by suggesting lists of similar items that users may find interesting. Caching has been a useful technique for...
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
KR
2004
Springer
15 years 3 months ago
2004
Springer
We describe a technique for speeding up inference for model-based abduction tasks that trades off inference time and/or space for the fraction of queries correctly answered. We co...
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...