Publication | Closed Access
SOLVING SYMBOLIC ORDERING CONSTRAINTS
67
Citations
0
References
1990
Year
Mathematical ProgrammingEngineeringComputational ComplexityBoolean CombinationsHigher-order LogicConstraint ProgrammingHerbrand UniverseConstraint SolvingDiscrete MathematicsCombinatorial OptimizationOrder TheoryLogical FormalismTotal PrecedenceConstraint SatisfactionAutomated ReasoningFormal MethodsOrder-sorted LogicFirst-order LogicSymbolic Ordering ConstraintsComputability Theory
We show how to solve boolean combinations of inequations s>t in the Herbrand Universe, assuming that ≥ is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable.