186 search results - page 31 / 38 » Preference-Based Default Reasoning |
LPNMR
2001
Springer
14 years 6 hour ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
There are case-based recommender systems that generate personalized recommendations for users exploiting the knowledge contained in past recommendation cases. These systems assume ...
WSC
2004
13 years 9 months ago
2004
Mortgage-Backed-Securities (MBS), as the largest investment class of fixed income securities, have always been hard to price. Because of the following reasons, normal numerical me...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
CLUSTER
2009
IEEE
14 years 2 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...