18 search results - page 1 / 4 » Learning with Refutation |
ALT
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
ALT
1998
Springer
13 years 11 months ago
1998
Springer
In their pioneering work, Mukouchi and Arikawa modeled a learning situation in which the learner is expected to refute texts which are not representative of L, the class of langua...
AAAI
2007
13 years 9 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
ASPDAC
2005
ACM
13 years 8 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ENTCS
2007
13 years 6 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...