583 search results - page 100 / 117 » Preferences in Answer Set Programming |
121
click to vote
ICALP
1995
Springer
15 years 5 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
122
click to vote
LANMR
2007
15 years 2 months ago
2007
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
114
click to vote
SEMWEB
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
120
click to vote
JAIR
2011
14 years 8 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
204
click to vote
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...