2022 search results - page 247 / 405 » Complexity of Non-Monotonic Logics |
173
click to vote
CSCLP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
186
click to vote
ECML
2007
Springer
16 years 18 days ago
2007
Springer
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...
183
click to vote
EPIA
2007
Springer
16 years 18 days ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
174
click to vote
ILP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
265
click to vote
ILP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...