Bottom - up Evaluation of DatalogPrograms with Arithmetic Constraints : The case
نویسندگان
چکیده
منابع مشابه
RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملConvex Hull Abstractions in Specialization of CLP Programs
We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination...
متن کاملL . Fribourg A Closed − Form Evaluation for Extended Timed Automata
We explain here how the bottom-up evaluation method of Revesz for recursive programs with arithmetic constraints, can be adapted from the domain of integers to the domain of reals. We apply the procedure to characterize the set of ancestors of a given state H for timed automata. (An ancestor of H is a state linked to H by a sequence of transitions.) Such a procedure also applies to extensions o...
متن کاملA Closed-form Evaluation for Extended Timed Automata
We explain here how the bottom-up evaluation method of Revesz for recursive programs with arithmetic constraints, can be adapted from the domain of integers to the domain of reals. We apply the procedure to characterize the set of ancestors of a given state H for timed automata. (An ancestor of H is a state linked to H by a sequence of transitions.) Such a procedure also applies to extensions o...
متن کاملA Unified Framework for Interval Constraints and Interval Arithmetic
We are concerned with interval constraints: solving constraints among real unknowns in such a way that soundness is not aaected by rounding errors. The contraction operator for the constraint x + y = z can simply be expressed in terms of interval arithmetic. An attempt to use the analogous deenition for x y = z fails if the usual deenitions of interval arithmetic are used. We propose an alterna...
متن کامل