PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

On the Complexity of Constraint-Based Theory Extraction
Mario Boley and Thomas Gaertner
In: 12th Int. Conf. Discovery Science, 3-5 Oct 2009, Porto, Portugal.

Abstract

In this paper we rule out output polynomial listing algorithms for the general problem of discovering theories for a conjunction of monotone and anti-monotone constraints as well as for the particular subproblem in which all constraints are frequency-based. For the general problem we prove a concrete exponential lower time bound that holds for any correct algorithm and even in cases in which the size of the theory as well as the only previous bound are constant. For the case of frequency-based constraints our result holds unless P = NP. These findings motivate further research to identify tractable subproblems and justify approaches with exponential worst case complexity.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:6762
Deposited By:Mario Boley
Deposited On:08 March 2010