89 search results - page 1 / 18 » Abduction and the Dualization Problem |
DIS
2003
Springer
13 years 10 months ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
FIMI
2003
13 years 6 months ago
2003
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
IPL
2002
13 years 4 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
AGP
1997
IEEE
13 years 9 months ago
1997
IEEE
We propose an algorithm for learning abductive logic programs from examples. We consider the Abductive Concept Learning framework, an extension of the Inductive Logic Programming ...