Searching for "The Complexity of Logic-Based Abduction." – sorted by Relevance.
-
The Complexity of Logic-Based Abduction
- The Complexity of Logic-Based Abduction Thomas Eiter, Georg Gottlob Christian Doppler Labor fur
- Cited by 124 (28 self) – Add To MetaCart
-
Semantics and Complexity of Abduction from Default Theories
- fragments were identied in [35, 58]. The complexity of logic-based abduction from classical theories has
- Cited by 14 (2 self) – Add To MetaCart
-
K.: The Complexity of Futile Questioning
- of logic-based abduction. 3. Q-ALL SAT and Q-MIN UNSAT Define a literal to be a variable or a negated
- Cited by 1 (1 self) – Add To MetaCart
-
An effective algorithm for the futile questioning problem
- abduction. Eiter and Gottlob [1995] describe several applications and investigate the complexity of logic-based
- Cited by 6 (2 self) – Add To MetaCart
-
Compilability of Abduction
- studied by Bylander et al. (1989), while the first attempts to investigate the complexity of logic-based
- Cited by 2 (0 self) – Add To MetaCart

