Abstract
The theory of parameterized computational complexity introduced in [DF1-3] appears to be of wide applicability in the study of the complexity of concrete problems [ADF,BDFW,BFH,DEF,FHW,FK]. We believe the theory may be of particular importance to practical applications of logic formalisms in programming language design and in system specification. The reason for this relevance is that while many computational problems in logic are extremely intractable generally, realistic applications often involve a “hidden parameter” according to which the computational problem may be feasible according to the more sensitive criteria of fixed-parameter tractability that is the central issue in parameterized computational complexity. We illustrate how this theory may apply to problems in logic, programming languages and linguistics by describing some examples of both tractability and intractability results in these areas. It is our strong expectation that these results are just the tip of the iceberg of interesting applications of parameterized complexity theory to logic and linguistics. Our main results are as follows. (1) The problem of determining whether a word x can be derived in k steps in a context-sensitive grammar G (Short CSL Derivation) is complete for the parameterized complexity class W[1]. (2) The problem Minimum Axiom Set [GJ] is complete for the parameterized complexity class W[P]. The latter result has the added significance of providing a starting point for a proof of the important structural result W[P]=monotone W[P]. We also report on the parameterized complexity of reachability in Petri nets (equivalently, vector addition systems) and of some problems concerning phonological derivation in linguistic theory.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, R. Downey and M. Fellows, “Fixed-Parameter Intractability II,” Proc. 10th Symposium on Theoretical Aspects of Computer Science (STACS) (1993), 374–385, Springer-Verlag, Berlin, Lecture Notes in Computer Science.
G. Barton, R. Berwick, and E. Ristad, Computational Complexity and Natural Language, MIT Press, Cambridge, MA, 1987.
R. Berwick, The Acquisition of Syntactic Knowledge, MIT Press, Cambridge, MA, 1985.
H. Bodlaender, R. Downey, M. Fellows and H. T. Wareham, “The Parameterized Complexity of Sequence Alignment and Consensus,” Proceedings of the Fifth Symposium on Combinatorial Pattern Matching (CPM) 1994, to appear.
H. Bodlaender, M. Fellows and M. Hallett, “Beyond NP-Completeness for Problems of Bounded Width: Hardness for the W Hierarchy,” Proceedings of the ACM Symposium on the Theory of Computing (STOC) 1994, to appear.
L. Cai and J. Chen, “On the Amount of Nondeterminism and the Power of Verifying,” to appear in Proc. International Conference on the Mathematical Foundations of Computer Science (MFCS), 1993.
L. Cai and J. Chen, “On Fixed-Parameter Tractability and Approximability of NP-hard Optimization Problems,” to appear in Proc. Israeli Conf. on Theoretical Computer Science (ISTCS), 1993.
L. Cai, J. Chen, R. G. Downey and M. R. Fellows, “Parameterized Complexity and Finite Advice,” to appear in Proc. Asian Logic Conference, 1993.
N. Chomsky and M. Halle, The Sound Pattern of English, Harper and Row, New York, 1968.
M. Davis, “Unsolvable Problems,” in the Handbook of Mathematical Logic, J. Barwise (ed.), Elsevier, 1977, p. 580.
R. G. Downey, P. A. Evans and M. R. Fellows, “Parameterized Learning Complexity,” to appear in Proc. Sixth ACM Workshop on Computational Learning Theory (COLT), 1993.
R. G. Downey and M. R. Fellows, “Fixed Parameter Tractability and Completeness,” Congr. Num., 87 (1992) 161–187.
R. G. Downey and M. R. Fellows, “Fixed Parameter Tractability and Completeness I: Basic Results,” to appear in SIAM J. Comp.
R. G. Downey and M. R. Fellows, “Fixed Parameter Tractability and Completeness II: On Completeness for W[1],” to appear in Theoretical Computer Science A.
R. G. Downey and M. R. Fellows, “Fixed Parameter Intractability (Extended Abstract),” Proceedings of the Seventh Annual IEEE Conference on Structure in Complexity Theory (1992), 36–49.
R. G. Downey and M. R. Fellows, “Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W-Hierarchy,” to appear in Proc. 1992 Dagstuhl Workshop on Structural Complexity Theory (Cambridge University Press).
R. G. Downey and M. R. Fellows, “Parameterized Computational Feasibility,” to appear in Proc. Second Cornell Workshop on Feasible Mathematics (Birkhauser, Boston).
R. G. Downey and M. R. Fellows, Parameterized Complexity, monograph in preparation.
M. R. Fellows, M. T. Hallett and H. T. Wareham, “DNA Physical Mapping: Three Ways Difficult,” to appear in Proc. First European Symposium on Algorithms, 1993.
M. R. Fellows and N. Koblitz, “Fixed-Parameter Complexity and Cryptography,” Proceedings of the Tenth International Conference on Algebraic Algorithms and Error-Correcting Codes (AAECC 10), Springer-Verlag, Lecture Notes in Computer Science, 1993.
M. Halle and G. Clements, Problem Book in Phonology, MIT Press, Cambridge, MA, 1983.
F. Henglein and H. G. Mairson, “The Complexity of Type Inference for Higher-Order Typed Lambda Calculi.” In Proc. Symp. on Principles of Programming Languages (POPL) (1991), 119–130.
A. Kornai and Z. Tuza, “Narrowness, Pathwidth and Their Application in Natural Language Processing,” Discrete Applied Mathematics 36 (1992), 87–92.
P. G. Kolaitis and M. N. Thakur, “Approximation Properties of NP Minimization Classes,” Proc. 6th Structure in Complexity Theory Conference (1991), 353–366.
H. R. Lewis, “Complexity Results for Classes of Quantificational Formulas,” J. Computer and Systems Sciences 21 (1980), 317–353.
O. Lichtenstein and A. Pneuli, “Checking that Finite-State Concurrent Programs Satisfy Their Linear Specification,” in Proc. 12th Ann. ACM Symp. on Principles of Programming Languages (1985), 97–107.
C. H. Papadimitriou and M. Yannakakis, “On the Complexity of Computing the V-C Dimension,” Proceedings of the 1993 IEEE Conf. on Structure in Complexity Theory, (1993).
E. Ristad, The Language Complexity Game, MIT Press, Cambridge, MA, 1993.
E. Ristad, “Complexity of the Simplified Segmental Phonology”, CS-TR-388-92, revised May 1993. Submitted to Computational Linguistics.
J. Tsotsos, “Analyzing Vision at the Complexity Level”, Behavioral and Brain Sciences, 13, 423–469, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Downey, R.G., Fellows, M.R., Kapron, B.M., Hallett, M.T., Wareham, H.T. (1994). The parameterized complexity of some problems in logic and linguistics. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive