A First-order Simplification Rule with Constraints
نویسنده
چکیده
Several variants of a first-order simplification rule for non-normal form tableaux using syntactic constraints are presented. These can be used as a framework for porting refinements of clausal first-order proof procedures to non-normal form tableaux. Some experimental results obtained with a prototypical implementation are given.
منابع مشابه
Simplification Rules for Constrained Formula Tableaux
Several variants of a first-order simplification rule for nonnormal form tableaux using syntactic constraints are presented. These can be used as a framework for porting methods like unit resolution or hyper tableaux to non-normal form free variable tableaux.
متن کامل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...
متن کامل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 dec...
متن کاملReduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implementations such as DLP, is due to reduction rules which propagate constraints and prune the search space. Yet, for first order logic such reduction rules are only known for resolution. The lack of reduction rules for fi...
متن کاملAutomating Termination Proofs for CHR
We propose a constraint-based approach towards automated termination analysis of Constraint Handling Rules (CHR). Similar to such approaches for Logic Programming (LP), we define a symbolic level mapping on atoms of the program and express termination conditions using these. Then, we search for an assignment to the symbolic coefficients, validating the termination conditions. However, different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000