KBO Constraint Solving Revisited
Pages 81 - 98
Abstract
KBO constraint solving is very well-known to be an NP-complete problem. Motivated by the needs of the family of SCL calculi, we consider the particular case where all terms occurring in a constraint are bound by a (single) ground term. We show that this problem and variants of this problem remain NP-complete even if the form of atoms in the constraint is further restricted. In addition, for a non-strict, partial term ordering solely based on symbol counting constraint solving remains NP-complete. Nevertheless, we provide a new simple algorithm testing KBO constraint solvability that performs well on benchmark examples.
References
[1]
Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). https://www.smt-lib.org/
[2]
Bromberger M, Fiori A, and Weidenbach C Henglein F, Shoham S, and Vizel Y Deciding the Bernays-Schoenfinkel fragment over bounded difference constraints by simple clause learning over theories Verification, Model Checking, and Abstract Interpretation 2021 Cham Springer 511-533
[3]
Bromberger, M., Gehl, T., Leutgeb, L., Weidenbach, C.: A two-watched literal scheme for first-order logic. In: Konev, B., Schon, C., Steen, A. (eds.) Proceedings of the Workshop on Practical Aspects of Automated Reasoning Co-located with the 11th International Joint Conference on Automated Reasoning (FLoC/IJCAR 2022), Haifa, Israel, 11–12 August 2022. CEUR Workshop Proceedings, vol. 3201. CEUR-WS.org (2022)
[4]
Bromberger, M., Schwarz, S., Weidenbach, C.: Exploring partial models with SCL. In: Piskac, R., Voronkov, A. (eds.) Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EPiC Series in Computing, vol. 94, pp. 48–72. EasyChair (2023).
[5]
Bromberger, M., Schwarz, S., Weidenbach, C.: SCL(FOL) revisited (2023). https://arxiv.org/abs/2302.05954
[6]
Downey PJ, Sethi R, and Tarjan RE Variations on the common subexpression problem J. ACM 1980 27 4 758-771
[7]
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Mathematical Sciences Series. Freeman, New York (1979)
[8]
Hurd J Congruence classes with logic variables Log. J. IGPL 2001 9 1 53-69
[9]
Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, I. (ed.) Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press (1970)
[10]
Korovin, K., Voronkov, A.: A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering. In: Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No. 99CB36332), pp. 291–302. IEEE (2000)
[11]
Korovin K and Voronkov A Orejas F, Spirakis PG, and van Leeuwen J Knuth-Bendix constraint solving is NP-complete Automata, Languages and Programming 2001 Heidelberg Springer 979-992
[12]
Korovin, K., Voronkov, A.: Orienting rewrite rules with the Knuth-Bendix order, vol. 183, pp. 165–186. Elsevier (2003)
[13]
Leidinger H and Weidenbach C Blanchette J, Kovács L, and Pattinson D SCL(EQ): SCL for first-order logic with equality Automated Reasoning 2022 Cham Springer 228-247
[14]
Löchner, B.: Advances in Equational Theorem Proving-Architecture, Algorithms, and Redundancy Avoidance. Dissertation, Fachbereich Informatik, TU Kaiserslautern (2005)
[15]
Nelson G and Oppen DC Fast decision procedures based on congruence closure J. ACM 1980 27 2 356-364
[16]
Shostak RE Deciding combinations of theories J. ACM 1984 31 1 1-12
[17]
Sutcliffe G The CADE ATP system competition - CASC AI Mag. 2016 37 2 99-101
Recommendations
Solving dynamic constraint optimization problems using ICHEA
ICONIP'12: Proceedings of the 19th international conference on Neural Information Processing - Volume Part IIIMany real-world constrained problems have a set of predefined static constraints that can be solved by evolutionary algorithms (EAs) whereas some problems have dynamic constraints that may change over time or may be received by the problem solver at run ...
Constraint Solving via Fractional Edge Covers
Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence, identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this article, we are interested in ...
Constraint solving via fractional edge covers
SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithmMany important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-time solvable classes of constraint satisfaction problems received a lot of attention. In this paper, we are interested in structural ...
Comments
Information & Contributors
Information
Published In
Sep 2023
281 pages
© The Author(s) 2023.
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 20 September 2023
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Feb 2025