On the complexity of constraint-based theory extraction

Mario Boley; Thomas Gärtner

doi:10.1007/978-3-642-04747-3_10

On the complexity of constraint-based theory extraction

Mario Boley, Thomas Gärtner

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Discovery Science - 12th International Conference, DS 2009, Proceedings
Pages	92-106
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-04747-3_10
State	Published - 2009
Externally published	Yes
Event	12th International Conference on Discovery Science, DS 2009 - Porto, Portugal Duration: 3 Oct 2009 → 5 Oct 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5808 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th International Conference on Discovery Science, DS 2009
Country/Territory	Portugal
City	Porto
Period	3/10/09 → 5/10/09

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-04747-3_10

Cite this

Boley, M., & Gärtner, T. (2009). On the complexity of constraint-based theory extraction. In Discovery Science - 12th International Conference, DS 2009, Proceedings (pp. 92-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5808 LNAI). https://doi.org/10.1007/978-3-642-04747-3_10

@inproceedings{4cbb7d684326461a886b457bd1e9074f,

title = "On the complexity of constraint-based theory extraction",

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.",

author = "Mario Boley and Thomas G{\"a}rtner",

year = "2009",

doi = "10.1007/978-3-642-04747-3_10",

language = "English",

isbn = "3642047467",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "92--106",

booktitle = "Discovery Science - 12th International Conference, DS 2009, Proceedings",

note = "12th International Conference on Discovery Science, DS 2009 ; Conference date: 03-10-2009 Through 05-10-2009",

}

Boley, M & Gärtner, T 2009, On the complexity of constraint-based theory extraction. in Discovery Science - 12th International Conference, DS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5808 LNAI, pp. 92-106, 12th International Conference on Discovery Science, DS 2009, Porto, Portugal, 3/10/09. https://doi.org/10.1007/978-3-642-04747-3_10

On the complexity of constraint-based theory extraction. / Boley, Mario; Gärtner, Thomas.
Discovery Science - 12th International Conference, DS 2009, Proceedings. 2009. p. 92-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5808 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the complexity of constraint-based theory extraction

AU - Boley, Mario

AU - Gärtner, Thomas

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71049148966&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-04747-3_10

DO - 10.1007/978-3-642-04747-3_10

M3 - Conference contribution

AN - SCOPUS:71049148966

SN - 3642047467

SN - 9783642047466

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 92

EP - 106

BT - Discovery Science - 12th International Conference, DS 2009, Proceedings

T2 - 12th International Conference on Discovery Science, DS 2009

Y2 - 3 October 2009 through 5 October 2009

ER -

On the complexity of constraint-based theory extraction

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this