Solving Simplification Ordering Constraints
نویسندگان
چکیده
This paper considers the decision problem for the existential fragment of the theory of simplification orderings. A simple, polynomial-time procedure for deciding satisfiability of such constraints is given, and it is also shown that the corresponding problem for the theory of total simplification orderings is NP-complete. This latter result can be interpreted as showing that the problem of deciding whether or not a simplification ordering on first-order terms can be linearized is NP-complete.
منابع مشابه
A revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملComplete Solving of Linear Diophantine Equations and Inequations without Adding Variables
Debugging Constraint Programs p. 204 An Optimizing Compiler for CLP(R) p. 222 Local and Global Relational Consistency p. 240 Dynamic Variable Ordering in CSPs p. 258 A Unifying Framework for Tractable Constraints p. 276 On the Forward Checking Algorithm p. 292 A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice p. 310 Situated Simplification p. 328 Guarded Constructiv...
متن کاملSMT Solving for the Theory of Ordering Constraints
Constraint solving and satisfiability checking play an important role in various tasks such as formal verification, software analysis and testing. In this paper, we identify a particular kind of constraints called ordering constraints, and study the problem of deciding satisfiability modulo such constraints. The theory of ordering constraints can be regarded as a special case of difference logi...
متن کاملSimplification of a Petri Net controller in industrial systems
This paper deals with the problem of forbidden states in discrete event systems modeled by Petri Net. To avoid the forbidden states, some constraints which are called Generalized Mutual Exclusion Constraints can be assigned to them. Enforcing these constraints on the system can be performed using control places. However, when the number of these constraints is large, a large number of control p...
متن کامل