6 search results - page 1 / 2 » Compilability of Abduction |
KR
2004
Springer
13 years 10 months ago
2004
Springer
We describe a technique for speeding up inference for model-based abduction tasks that trades off inference time and/or space for the fraction of queries correctly answered. We co...
AAAI
2000
13 years 6 months ago
2000
AAAI
2000
13 years 6 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
EON
2008
13 years 6 months ago
2008
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
IJCAI
2001
13 years 6 months ago
2001
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...