Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups1

    loading  Checking for direct PDF access through Ovid


It is crucial for the performance of ordered resolution or paramodulation-based deduction systems that they incorporate specialized techniques to work efficiently with standard algebraic theories E. Essential ingredients for this purpose are term orderings that are E-compatible, for the given E, and algorithms deciding constraint satisfiability for such orderings.

Here we introduce a uniform technique providing the first such algorithms for some orderings for abelian semigroups, abelian monoids and abelian groups, which we believe will lead to reasonably efficient techniques for practice.

Our algorithms are in NP, and hence optimal, since in addition we show that, for any well-founded E-compatible ordering for these E, the constraint satisfiability problem is NP-hard even for conjunctions of inequations.

Related Topics

    loading  Loading Related Articles