On the complexity of Maslov's class K̅
Article No.: 35, Pages 1 - 14
Abstract
Maslov's class K is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that K has the exponential-sized model property, and hence its satisfiability problem is NExpTime-complete. Additionally, we get new complexity results on related fragments studied in the literature, and propose a new decidable extension of the uniform one-dimensional fragment (without equality). Our approach involves a use of satisfiability games tailored to K and a novel application of paradoxical tournament graphs.
References
[1]
Wilhelm Ackermann. 1928. Über die Erfüllbarkeit gewisser Zählausdrücke. Math. Ann. 100 (1928), 638--649.
[2]
Egon Börger, Erich Grädel, and Yuri Gurevich. 1997. The classical decision problem. Springer.
[3]
Alonzo Church. 1956. Introduction to Mathematical Logic (6th ed.). Vol. I. Princeton University Press.
[4]
Burton Draben and Warren D. Goldfarb. 1979. The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesly.
[5]
Paul Erdös. 1963. On a Problem in Graph Theory. The Mathematical Gazette 47 (1963), 220 -- 223.
[6]
Christian G. Fermüller, Alexander Leitsch, Ullrich Hustadt, and Tanel Tammet. 2001. Resolution Decision Procedures. In Handbook of Automated Reasoning (in 2 volumes), John Alan Robinson and Andrei Voronkov (Eds.). Elsevier and MIT Press, 1791--1849.
[7]
Christian G. Fermüller, Alexander Leitsch, Tanel Tammet, and N. K. Zamov. 1993. Resolution Methods for the Decision Problem. Lecture Notes in Computer Science, Vol. 679. Springer.
[8]
Reference contains Cyrillic text. See PDF CCCP 98 (1968), 26--87.
[9]
Joyce Friedman. 1963. A Semi-Decision Procedure for the Functional Calculus. J. ACM 10, 1 (jan 1963), 1--24.
[10]
Martin Fürer. 1983. The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In Logic and Machines: Decision Problems and Complexity, Proceedings of the Symposium "Rekursive Kombinatorik" 1983 (Lecture Notes in Computer Science, Vol. 171). Springer, 312--319.
[11]
Kurt Gödel. 1933. Zum Entscheidungsproblem des logischen Funktionenkalkuils. Monatshefte fur Mathematik und Physik 40 (1933), 433--443.
[12]
Warren D. Goldfarb. 1984. The unsolvability of the Gödel class with identity. J. Symb. Logic 49 (1984), 1237--1252.
[13]
Warren D. Goldfarb. 1993. Random models and solvable Skolem classes. Journal of Symbolic Logic 58(3) (1993), 908--914.
[14]
Ronald Graham and Joel H. Spencer. 1971. A Constructive Solution to a Tournament Problem. Canad. Math. Bull. 14, 1 (1971), 45--48.
[15]
Yuri Gurevich and Saharon Shelah. 1983. Random Models and the Gödel Case of the Decision Problem. J. Symbolic Logic 48, 4 (1983), 1120--1124.
[16]
Lauri Hella and Antti Kuusisto. 2014. One-dimensional Fragment of First-order Logic. In Proceedings of Advances in Modal Logic, 2014. 274--293.
[17]
Ullrich Hustadt. 1999. Resolution-based decision procedures for subclasses of first-order logic. Ph. D. Dissertation. Universität des Saarlandes, Saarbrücken, Germany.
[18]
Ullrich Hustadt and Renate A. Schmidt. 1999. Maslov's Class K Revisited. In Automated Deduction - CADE-16, 16th International Conference on Automated Deduction 1999, Proceedings (Lecture Notes in Computer Science, Vol. 1632). Springer, 172--186.
[19]
Ullrich Hustadt, Renate A. Schmidt, and Lilia Georgieva. 2004. A Survey of Decidable First-Order Fragments and Description Logics. Journal of Relational Methods in Computer Science 1 (2004), 2004.
[20]
Emanuel Kieronski. 2023. A Uniform One-Dimensional Fragment with Alternation of Quantifiers. In Proceedings of the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2023 (EPTCS, Vol. 390). 1--15.
[21]
Emanuel Kieronski and Antti Kuusisto. 2014. Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 8634). 365--376.
[22]
Harry R. Lewis. 1980. Complexity results for classes of quantificational formulas. J. Comput. System Sci. 21, 3 (1980), 317 -- 353.
[23]
Vladimir Lifschitz. 1989. What is the inverse method? Journal of Automated Reasoning 5, 1 (March 1989), 1--23.
[24]
Leopold Löwenheim. 1915. Über Möglichkeiten im Relativkalkül. Math. Ann. 76 (1915), 447--470.
[25]
Sergei J. Maslov. 1971. The inverse method for establishing deducibility for logical calculi. The Calculi of Symbolic Logic I: Proceedings of the Steklov Institute of Mathematics 98 (1971).
[26]
Dana Scott. 1962. A decision method for validity of sentences in two variables. Journal Symbolic Logic 27 (1962), 477.
[27]
Marco Voigt. 2019. Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates. Ph. D. Dissertation. Universität des Saarlandes, Saarbrücken, Germany.
Recommendations
Complexity results for modal dependence logic
CSL'10/EACSL'10: Proceedings of the 24th international conference/19th annual conference on Computer science logicModal dependence logic was introduced very recently by Väänänen. It enhances the basic modal language by an operator dep. For propositional variables p1, ..., pn, dep(p1, ..., pn-1; pn) intuitively states that the value of pn only depends on those of p1,...
Complexity Results for Modal Dependence Logic
Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator = (). For propositional variables p 1, . . . , p n , = ( p 1, . . . , p n -1, p n ) intuitively states that the value of p ...
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
AbstractWe prove that branching-time temporal logics CTL and CT L ⁎ are polynomial-time embeddable into their single-variable fragments. It follows that satisfiability for CTL and CT L ⁎, and therefore also for alternating-time temporal logics ...
Comments
Information & Contributors
Information
Published In
July 2024
988 pages
ISBN:9798400706608
DOI:10.1145/3661814
- Conference Chair:
- Pawel Sobocinski,
- Program Chairs:
- Ugo Dal Lago,
- Javier Esparza
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
- SIGLOG: ACM Special Interest Group on Logic and Computation
- IEEE Computer Society
In-Cooperation
- EACSL
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Polish National Science Center
Conference
LICS '24
Sponsor:
LICS '24: 39th Annual ACM/IEEE Symposium on Logic in Computer Science
July 8 - 11, 2024
Tallinn, Estonia
Acceptance Rates
LICS '24 Paper Acceptance Rate 72 of 236 submissions, 31%;
Overall Acceptance Rate 215 of 622 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 59Total Downloads
- Downloads (Last 12 months)59
- Downloads (Last 6 weeks)4
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in