research-article

Two-variable logics with counting and semantic constraints

Authors:

Emanuel Kieroński,

Ian Pratt-Hartmann,

Lidia TenderaAuthors Info & Claims

ACM SIGLOG News, Volume 5, Issue 3

Pages 22 - 43

https://doi.org/10.1145/3242953.3242958

Published: 26 July 2018 Publication History

Abstract

In this article we discuss fragments and extensions of two-variable logics motivated by practical applications. We outline the decidability frontier, describing some of the techniques developed for deciding satisfiability and finite satisfiability, as well as characterizing their complexity.

References

[1]

H. Andréka, J. van Benthem, and I. Németi. 1998. Modal Languages and Bounded Fragments of Predicate Logic. Journal of Philosophical Logic 27 (1998), 217--274.

[2]

F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider. 2010. The description logic handbook: theory, implementation, and applications (2nd ed.). Cambridge University Press.

Digital Library

[3]

E. Börger, E. Grädel, and Y. Gurevich. 1997. The classical decision problem. Springer, Berlin.

[4]

W. Charatonik and P. Witkowski. 2016. Two-variable Logic with Counting and a Linear Order. Logical Methods in Computer Science 12, 2 (2016), 8:1--8:31.

[5]

A. Church. 1936. A note on the Entscheidungsproblem. J. Symb. Log. 1, 1 (1936), 40--41.

[6]

F. Eisenbrand and G. Shmonin. 2006. Carathéodory bounds for integer cones. Oper. Res. Lett. 34, 5 (2006), 564--568.

Digital Library

[7]

M. Fürer. 1983. The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In Logic and Machines (Lecture Notes in Computer Science), Egon Börger, Gisbert Hasenjaeger, and Dieter Rödding (Eds.), Vol. 171. Springer, 312--319.

Digital Library

[8]

H. Ganzinger, C. Meyer, and M. Veanes. 1999. The two-variable guarded fragment with transitive relations. In Fourteenth Annual IEEE Symposium on Logic in Computer Science. 24--34.

Digital Library

[9]

K. Gödel. 1933. Zum Entscheidungsproblem des logischen Funktionenkalküls. Monatshefte für Mathematik und Physik 40 (1933), 433--443.

[10]

W. Goldfarb. 1984. The unsolvability of the Gödel Class with Identity. Journal of Symbolic Logic 49 (1984), 1237--1252.

[11]

E. Grädel. 1999. On the restraining power of guards. Journal of Symbolic Logic 64 (1999), 1719--1742.

[12]

E. Grädel, P. Kolaitis, and M. Vardi. 1997a. On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3, 1 (1997), 53--69.

[13]

E. Grädel and M. Otto. 1999. On logics with two variables. Theoretical Computer Science 224, 1/2 (1999), 73--113.

Digital Library

[14]

E. Grädel, M. Otto, and E. Rosen. 1997b. Two-variable logic with counting is decidable. In Proceedings of the 12th IEEE Symposium on Logic in Computer Science. IEEE Online Publications, 306--317.

Digital Library

[15]

E. Grädel, M. Otto, and E. Rosen. 1999. Undecidability results on two-variable logics. Arch. Math. Log. 38, 4-5 (1999), 313--354.

[16]

D. Hilbert and W. Ackermann. 1928. Grundzüge der theoretischen Logik. Springer, Berlin.

[17]

I. Horrocks and U. Sattler. 2007. A tableaux decision procedure for SHOIQ. Journal of Automated Reasoning 39, 3 (2007), 249--276.

Digital Library

[18]

Y. Kazakov. 2004. A polynomial translation from the two-variable guarded fragment with number restrictions to the guarded fragment. In Logics in Artificial Intelligence: 9th European Conference, JELIA 2004 (Lecture Notes in Artificial Intelligence), J. J. Alferes and J. Leite (Eds.), Vol. 3229. Springer, Berlin, 372--384.

[19]

Y. Kazakov. 2006. Saturation-based decision procedures for extensions of the guarded fragment. Ph.D. Dissertation. Universität des Saarlandes, Saarbrücken, Germany.

[20]

L.G. Khachiyan. 1979. A polynomial algorithm in linear programming. Soviet Mathematics Doklady 20 (1979), 191--194.

[21]

E. Kieroński. 2005. Results on the Guarded Fragment with Equivalence or Transitive Relations. In Computer Science Logic, Vol. 3634. Springer Verlag, 309--324.

Digital Library

[22]

E. Kieronski. 2006. On the complexity of the two-variable guarded fragment with transitive guards. Inf. Comput. 204, 11 (2006), 1663--1703.

Digital Library

[23]

E. Kieroński. 2011. Decidability Issues for Two-Variable Logics with Several Linear Orders. In CSL (LIPIcs), Marc Bezem (Ed.), Vol. 12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 337--351.

[24]

E. Kieroński, J. Michaliszyn, I. Pratt-Hartmann, and L. Tendera. 2014. Two-variable first-order logic with equivalence closure. SIAM Journal of Computing 43, 3 (2014), 1012--1063.

[25]

E. Kieronski and M. Otto. 2012. Small substructures and decidability issues for first-order logic with two variables. J. Symb. Log. 77, 3 (2012), 729--765.

[26]

E. Kieroński, I. Pratt-Hartmann, and L. Tendera. 2017. Equivalence closure in the two-variable guarded fragment. Journal of Logic and Computation 27, 4 (2017), 999--1021.

[27]

E. Kieroński and L. Tendera. 2018. Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. ACM Trans. Comput. Logic 19, 2, Article 8 (Feb. 2018), 34 pages.

Digital Library

[28]

E. Kopczynski and T. Tan. 2015. Regular graphs and the spectra of two-variable logic with counting. SIAM Journal of Computing 44, 3 (2015), 786--818.

[29]

S. Kripke. 1963. Semantical analysis of modal logic I: normal modal propositional calculi. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 9 (1963), 67--96.

[30]

R. Ladner. 1980. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6 (1980), 467--480.

[31]

H. R. Lewis. 1980. Complexity results for classes of quantificational formulas. J. Comp. and System Sci. 21 (1980), 317--353.

[32]

E. Mayr. 1984. An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13, 3 (1984), 441--460.

[33]

M. Mortimer. 1975. On languages with two variables. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 21 (1975), 135--140.

[34]

M. Otto. 2001. Two-Variable First-Order Logic over Ordered Domains. Journal of Symbolic Logic 66 (2001), 685--702.

[35]

L. Pacholski, W. Szwast, and L. Tendera. 1997. Complexity of two-variable logic with counting. In Proceedings of the 12th IEEE Symposium on Logic in Computer Science. IEEE Online Publications, 318--327.

Digital Library

[36]

L. Pacholski, W. Szwast, and L. Tendera. 1999. Complexity results for first-order two-variable logic with counting. SIAM J. Comput. 29, 4 (1999), 1083--1117.

Digital Library

[37]

I. Pratt-Hartmann. 2005. Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information 14 (2005), 369--395.

Digital Library

[38]

I. Pratt-Hartmann. 2007. Complexity of the guarded two-variable fragment with counting quantifiers. Journal of Logic and Computation 17 (2007), 133--155.

[39]

I. Pratt-Hartmann. 2010. The Two-Variable Fragment with Counting Revisited. In Logic, Language, Information and Computation, 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010. Proceedings. 42--54.

Digital Library

[40]

I. Pratt-Hartmann. 2015. The two-variable fragment with counting and equivalence. Mathematical Logic Quarterly 61, 6 (2015), 474--515.

[41]

I. Pratt-Hartmann. 2017. The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable. CoRR abs/1707.05558 (2017). (Forthcoming in Mathematical Logic Quarterly).

[42]

F. P. Ramsay. 1930. On a problem of formal logic. Proc. London Mathematical Society 30 (1930), 264--286.

[43]

D. Scott. 1962. A decision method for validity of sentences in two variables. Journal Symbolic Logic 27 (1962), 477.

[44]

W. Szwast and L. Tendera. 2004. The guarded fragment with transitive guards. Annals of Pure and Applied Logic 128 (2004), 227--276.

[45]

W. Szwast and L. Tendera. 2013. FO2 with one transitive relation is decidable. In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27-March 2, 2013, Kiel, Germany. 317--328.

[46]

W. Szwast and L. Tendera. 2018. On the satisfiability problem for fragments of the two-variable logic with one transitive relation. (2018). https://arxiv.org/abs/1804.09447 submitted.

[47]

S. Tobies. 2001. PSPACE Reasoning for Graded Modal Logics. J. of Logic and Computation 11, 1 (2001), 85--106.

[48]

B. Trakhtenbrot. 1950. The impossibility of an algorithm for the decision problem for finite models. Dokl. Akad. Nauk SSSR 70 (1950), 596--572. English translation in: AMS Transl. Ser. 2, vol. 23 (1963), 1-6.

[49]

A. M Turing. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London mathematical society 42, 2 (1936), 230--265.

[50]

T. Zeume and F. Harwath. 2016. Order Invariance of Two-Variable Logic is Decidable. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS 2016, New York, NY, USA, July 5-8, 2016. 807--816.

Digital Library

Cited By

Grohe MRosenbluth ESobocinski PLago UEsparza J(2024)Are Targeted Messages More Effective?Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662093(1-14)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662093
Artale AJung JMazzullo AOzaki AWolter F(2023)Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role InclusionsACM Transactions on Computational Logic10.1145/359730124:4(1-51)Online publication date: 10-Oct-2023
https://dl.acm.org/doi/10.1145/3597301
Jung JWolter FGorla D(2021)Living without beth and craigProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470585(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470585
Show More Cited By

Two-variable logics with counting and semantic constraints
1. Theory of computation
  1. Models of computation

Recommendations

Complexity of Two-Variable Logic with Counting
LICS '97: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

In the paper we consider the class C of first order sentences with two variables and with additional ``counting'' quantifiers ``there exists exactly m'' (at most, at least m), for some nonnegative integer m. We prove that the problem of satisfiability ...
On temporal logics with data variable quantifications

Although data values are available in almost every computer system, reasoning about them is a challenging task due to the huge data size or even infinite data domains. Temporal logics are the well-known specification formalisms for reactive and ...
Two-Variable Logic with Counting and Trees
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

We consider the two-variable logic with counting quantifiers (C2) interpreted over finite structures that contain two forests of ranked trees. This logic is strictly more expressive than standard C2 and it is no longer a fragment of the first order ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGLOG News

ACM SIGLOG News Volume 5, Issue 3

July 2018

100 pages

EISSN:2372-3491

DOI:10.1145/3242953

Editor:
Andrzej Murawski
University of Oxford

Issue’s Table of Contents

Copyright © 2018 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 July 2018

Published in SIGLOG Volume 5, Issue 3

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
96
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Grohe MRosenbluth ESobocinski PLago UEsparza J(2024)Are Targeted Messages More Effective?Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662093(1-14)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662093
Artale AJung JMazzullo AOzaki AWolter F(2023)Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role InclusionsACM Transactions on Computational Logic10.1145/359730124:4(1-51)Online publication date: 10-Oct-2023
https://dl.acm.org/doi/10.1145/3597301
Jung JWolter FGorla D(2021)Living without beth and craigProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470585(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470585
Voigt M(2021)Decidable First-Order Fragments of Linear Rational Arithmetic with Uninterpreted PredicatesJournal of Automated Reasoning10.1007/s10817-020-09567-865:3(357-423)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/s10817-020-09567-8

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents