KBO Constraint Solving Revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

KBO Constraint Solving Revisited


KBO constraint solving is very well-known to be an NPcomplete 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.
Fichier principal
Vignette du fichier
978-3-031-43369-6_5.pdf (315.18 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04313806 , version 1 (29-11-2023)




Yasmine Briefs, Hendrik Leidinger, Christoph Weidenbach. KBO Constraint Solving Revisited. Frontiers of Combining Systems - 14th International Symposium, Sep 2023, Prague (CZ), Czech Republic. pp.81 - 98, ⟨10.1007/978-3-031-43369-6_5⟩. ⟨hal-04313806⟩
24 View
6 Download



Gmail Mastodon Facebook X LinkedIn More