Compilability of Abduction

10/09/2002
by   Paolo Liberatore, et al.
0

Abduction is one of the most important forms of reasoning; it has been successfully applied to several practical problems such as diagnosis. In this paper we investigate whether the computational complexity of abduction can be reduced by an appropriate use of preprocessing. This is motivated by the fact that part of the data of the problem (namely, the set of all possible assumptions and the theory relating assumptions and manifestations) are often known before the rest of the problem. In this paper, we show some complexity results about abduction when compilation is allowed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2020

Logical characterizations of computational complexity classes

Descriptive complexity theory is an important area in the study of compu...
research
06/12/2022

50 Years of Computational Complexity: Hao Wang and the Theory of Computation

If Turing's groundbreaking paper in 1936 laid the foundation of the theo...
research
02/25/2021

Generalized Parametric Path Problems

Parametric path problems arise independently in diverse domains, ranging...
research
04/29/2011

Limits of Preprocessing

We present a first theoretical analysis of the power of polynomial-time ...
research
12/22/2022

Exceeding Computational Complexity Trial-and-Error Dynamic Action and Intelligence

Computational complexity is a core theory of computer science, which dic...
research
02/23/2022

On the complexity of Chow and Hurwitz forms

We consider the bit complexity of computing Chow forms and their general...

Please sign up or login with your details

Forgot password? Click here to reset