Papers
Topics
Authors
Recent
Search
2000 character limit reached

Interpolant Existence is Undecidable for Two-Variable First-Order Logic with Two Equivalence Relations

Published 3 Apr 2024 in cs.LO and math.LO | (2404.02683v1)

Abstract: The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig interpolation property (CIP), then the IEP reduces to validity in L. Recently, the IEP has been studied for logics without the CIP. The results obtained so far indicate that even though the IEP can be computationally harder than validity, it is decidable when L is decidable. Here, we give the first examples of decidable fragments of first-order logic for which the IEP is undecidable. Namely, we show that the IEP is undecidable for the two-variable fragment with two equivalence relations and for the two-variable guarded fragment with individual constants and two equivalence relations. We also determine the corresponding decidable Boolean description logics for which the IEP is undecidable.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. K. L. McMillan, Interpolation and SAT-based model checking, in: Proceedings of the 15th International Conference on Computer Aided Verification, CAV 2003, Springer, 2003, pp. 1–13. URL: https://doi.org/10.1007/978-3-540-45069-6_1. doi:10.1007/978-3-540-45069-6_1.
  2. R. Diaconescu, Logical support for modularisation, Logical environments 83 (1993) 130.
  3. Interpolant generation for UTVPI, in: Proceedings of the 22nd International Conference on Automated Deduction, CADE 2022, Springer, 2009, pp. 167–182. URL: https://doi.org/10.1007/978-3-642-02959-2_15. doi:10.1007/978-3-642-02959-2_15.
  4. Combined covers and Beth definability, in: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part I, 2020, pp. 181–200. URL: https://doi.org/10.1007/978-3-030-51074-9_11. doi:10.1007/978-3-030-51074-9_11.
  5. Combination of uniform interpolants via Beth definability, J. Autom. Reason. 66 (2022) 409–435. URL: https://doi.org/10.1007/s10817-022-09627-1. doi:10.1007/s10817-022-09627-1.
  6. Beth definability in expressive description logics, J. Artif. Intell. Res. 48 (2013) 347–414.
  7. Effective interpolation and preservation in guarded logics, ACM Trans. Comput. Log. 17 (2016) 8. URL: https://doi.org/10.1145/2814570. doi:10.1145/2814570.
  8. Definitorially complete description logics, in: Proc. of KR, 2006, pp. 79–89.
  9. On free description logics with definite descriptions, in: Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, 2021, pp. 63–73. URL: https://doi.org/10.24963/kr.2021/7. doi:10.24963/kr.2021/7.
  10. An investigation of definability in ontology alignment, in: E. Blomqvist, P. Ciancarini, F. Poggi, F. Vitali (Eds.), Knowledge Engineering and Knowledge Management - 20th International Conference, EKAW 2016, Bologna, Italy, November 19-23, 2016, Proceedings, volume 10024 of Lecture Notes in Computer Science, 2016, pp. 255–271. URL: https://doi.org/10.1007/978-3-319-49004-5_17. doi:10.1007/978-3-319-49004-5_17.
  11. Formal properties of modularisation, in: H. Stuckenschmidt, C. Parent, S. Spaccapietra (Eds.), Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization, volume 5445 of Lecture Notes in Computer Science, Springer, 2009, pp. 25–66. URL: https://doi.org/10.1007/978-3-642-01907-4_3. doi:10.1007/978-3-642-01907-4_3.
  12. Inseparability and conservative extensions of description logic ontologies: A survey, in: J. Z. Pan, D. Calvanese, T. Eiter, I. Horrocks, M. Kifer, F. Lin, Y. Zhao (Eds.), Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering - 12th International Summer School 2016, Aberdeen, UK, September 5-9, 2016, Tutorial Lectures, volume 9885 of Lecture Notes in Computer Science, Springer, 2016, pp. 27–89. URL: https://doi.org/10.1007/978-3-319-49493-7_2. doi:10.1007/978-3-319-49493-7_2.
  13. Effective query rewriting with ontologies over dboxes, in: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, 2009, pp. 923–925. URL: http://ijcai.org/Proceedings/09/Papers/157.pdf.
  14. D. Toman, G. E. Weddell, First order rewritability for ontology mediated querying in Horn-DLFD, in: Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020, 2020.
  15. Exact query reformulation over databases with first-order and description logics ontologies, J. Artif. Intell. Res. 48 (2013) 885–922. URL: https://doi.org/10.1613/jair.4058. doi:10.1613/jair.4058.
  16. E. Franconi, V. Kerhet, Effective query answering with ontologies and DBoxes, booktitle = Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, pages = 301–328, year = 2019, publisher = Springer, url = https://doi.org/10.1007/978-3-030-22102-7_14, doi = 10.1007/978-3-030-22102-7_14.
  17. D. Toman, G. E. Weddell, FO Rewritability for OMQ using Beth Definability and Interpolation, in: Proceedings of the 34th International Workshop on Description Logics, DL 2021, CEUR-WS.org, 2021. URL: http://ceur-ws.org/Vol-2954/paper-29.pdf.
  18. S. D. Comer, Classes without the amalgamation property., Pacific J. Math. 28 (1969) 309–318.
  19. D. Pigozzi, Amalgamation, congruence-extension, and interpolation properties in algebras, Algebra Univers. (1971) 269–349.
  20. M. Marx, C. Areces, Failure of interpolation in combined modal logics, Notre Dame J. Formal Log. 39 (1998) 253–273.
  21. Living without Beth and Craig: Definitions and interpolants in description and modal logics with nominals and role inclusions, ACM Trans. Comput. Log. 24 (2023) 34:1–34:51. URL: https://doi.org/10.1145/3597301. doi:10.1145/3597301.
  22. Interpolants and explicit definitions in extensions of the description logic ℰ⁢ℒℰℒ\mathcal{EL}caligraphic_E caligraphic_L, in: Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, 2022.
  23. J. C. Jung, F. Wolter, Living without Beth and Craig: Definitions and interpolants in the guarded and two-variable fragments, in: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, IEEE, 2021, pp. 1–14. URL: https://doi.org/10.1109/LICS52264.2021.9470585. doi:10.1109/LICS52264.2021.9470585.
  24. Definitions and (uniform) interpolants in first-order modal logic, in: P. Marquis, T. C. Son, G. Kern-Isberner (Eds.), Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Greece, September 2-8, 2023, 2023, pp. 417–428. URL: https://doi.org/10.24963/kr.2023/41. doi:10.24963/KR.2023/41.
  25. Two-variable first-order logic with equivalence closure, SIAM J. Comput. 43 (2014) 1012–1063. URL: https://doi.org/10.1137/120900095. doi:10.1137/120900095.
  26. V. Goranko, M. Otto, Model theory of modal logic, in: Handbook of Modal Logic, Elsevier, 2007, pp. 249–329.
  27. E. Grädel, M. Otto, The freedoms of (guarded) bisimulation, in: Johan van Benthem on Logic and Information Dynamics, Springer International Publishing, 2014, pp. 3–31.
  28. A. Robinson, A result on consistency and its application to the theory of definition, Indagationes Mathematicae 18 (1956) 47–58.
  29. K. Ruohonen, Reversible machines and Post’s correspondence problem for biprefix morphisms, J. Inf. Process. Cybern. 21 (1985) 579–595.
  30. F. Gire, Two decidability problems for infinite words, Inf. Process. Lett. 22 (1986) 135–140. URL: https://doi.org/10.1016/0020-0190(86)90058-X. doi:10.1016/0020-0190(86)90058-X.
  31. Description logics and the two-variable fragment, in: C. A. Goble, D. L. McGuinness, R. Möller, P. F. Patel-Schneider (Eds.), Working Notes of the 2001 International Description Logics Workshop (DL-2001), Stanford, CA, USA, August 1-3, 2001, volume 49 of CEUR Workshop Proceedings, CEUR-WS.org, 2001a. URL: https://ceur-ws.org/Vol-49/LutzSattlerWolter-66start.ps.
  32. Modal logic and the two-variable fragment, in: L. Fribourg (Ed.), Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, volume 2142 of Lecture Notes in Computer Science, Springer, 2001b, pp. 247–261. URL: https://doi.org/10.1007/3-540-44802-0_18. doi:10.1007/3-540-44802-0_18.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up for Free