A Generalization of the Folding Rule for the Clark-Kunen Semantics
نویسندگان
چکیده
In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. Our generalized folding rule enables new transformation sequences that, in particular, are suitable for recursion introduction and local variable elimination. We provide some illustrative examples and give a detailed proof of correctness w.r.t. the Clark-Kunen semantics.
منابع مشابه
A generalization of the Chen-Wu duality into quantale-valued setting
With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...
متن کاملUnfold/Fold Transformations For Definite Clause Programs
An unfold/fold program transformation system which extends the unfold/fold transformations of H. Tamaki and T. Sato is presented in this paper. The system consists of unfolding, simultaneous folding , and generalization + equality introduction rules. The simultaneous folding rule permits the folding of a set of folded clauses into a single clause, using a set of folding clauses, while the gener...
متن کاملA Study on the Commentary of Historical Verses with an Emphasis on the Rule of Al-Ibrah
One of the prevalent commentary rules about commentary of the historical verses which has a certain revelation occasion and refers to a specific time and place is the rule of alibrah being stated as: take in consideration universality of the word not particularity of the occasion. The source of this rule refers to the verses which have universal word and particular occasion. The referent of the...
متن کاملA QUADRATIC MARGIN-BASED MODEL FOR WEIGHTING FUZZY CLASSIFICATION RULES INSPIRED BY SUPPORT VECTOR MACHINES
Recently, tuning the weights of the rules in Fuzzy Rule-Base Classification Systems is researched in order to improve the accuracy of classification. In this paper, a margin-based optimization model, inspired by Support Vector Machine classifiers, is proposed to compute these fuzzy rule weights. This approach not only considers both accuracy and generalization criteria in a single objective fu...
متن کاملCommonsense Axiomatizations for Logic Programs
Various semantics for logic programs with negation are described in terms of a dualized program together with additional axioms, some of which are second order formulas. The semantics of Clark, Fitting, and Kunen are characterized in this framework, and a nite rst-order presentation of Kunen's semantics is described. A new axiom to represent \common sense" reasoning is proposed for logic progra...
متن کامل