A characterization of the uniform rule based on new robustness properties

2014 ◽  
Vol 71 ◽  
pp. 80-85 ◽  
Author(s):  
Azar Abizada ◽  
Siwei Chen
Keyword(s):  
Uniform Rule ◽  
Rule Based

scholarly journals Constraint programming viewed as rule-based programming

2001 ◽  
Vol 1 (6) ◽  
pp. 713-750 ◽  
Author(s):  
KRZYSZTOF R. APT ◽  
ERIC MONFROY
Keyword(s):  
Constraint Satisfaction ◽  
Constraint Programming ◽  
Constraint Satisfaction Problems ◽  
Rule Based ◽  
Local Consistency ◽  
Arc Consistency ◽  
Computation Process ◽  
Rule Based Approach ◽  
Rule Consistency

We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas. Then we consider constraint satisfaction problems that are based on predefined, explicitly given constraints. To solve them we first derive rules from these explicitly given constraints and limit the computation process to a repeated application of these rules, combined with labeling. We consider two types of rule here. The first type, that we call equality rules, leads to a new notion of local consistency, called rule consistency that turns out to be weaker than arc consistency for constraints of arbitrary arity (called hyper-arc consistency in Marriott & Stuckey (1998)). For Boolean constraints rule consistency coincides with the closure under the well-known propagation rules for Boolean constraints. The second type of rules, that we call membership rules, yields a rule-based characterization of arc consistency. To show feasibility of this rule-based approach to constraint programming, we show how both types of rules can be automatically generated, as CHR rules of Frühwirth (1995). This yields an implementation of this approach to programming by means of constraint logic programming. We illustrate the usefulness of this approach to constraint programming by discussing various examples, including Boolean constraints, two typical examples of many valued logics, constraints dealing with Waltz's language for describing polyhedral scenes, and Allen's qualitative approach to temporal logic.

scholarly journals Decentralization and mutual liability rules

2020 ◽  
Vol 92 (3) ◽  
pp. 577-599
Author(s):  
Martijn Ketelaars ◽  
Peter Borm ◽  
Marieke Quant
Keyword(s):  
Reduction Method ◽  
Allocation Mechanism ◽  
Liability Rule ◽  
Financial Network ◽  
Rule Based ◽  
Liability Rules ◽  
The One ◽  
The Individual ◽  
Bankruptcy Rule

AbstractThis paper builds on the recent work of Groote Schaarsberg et al. (Math Methods Oper Res 87(3):383–409, 2018) on mutual liability problems. In essence, a mutual liability problem comprises a financial network in which agents may have both monetary individual assets and mutual liabilities. Here, mutual liabilities reflect rightful monetary obligations from past bilateral transactions. To settle these liabilities by reallocating the individual assets, mutual liability rules are analyzed that are based on centralized bilateral transfer schemes which use a certain bankruptcy rule as its leading allocation mechanism. In this paper we derive a new characterization of mutual liability rules by taking a decentralized approach instead, which is based on a recursive individual settlement procedure. We show that for bankruptcy rules that satisfy composition, this decentralized procedure always leads to the same allocation as the one prescribed by the corresponding mutual liability rule based on centralized bilateral transfer schemes. Finally, we introduce a new reduction method for mutual liability problems and prove that any bankruptcy-rule-based mutual liability rule is invariant with respect to such a reduction.

scholarly journals Economic potential assessment of rare earth extraction sequence based on rule-based framework

2018 ◽  
Vol 12 (4) ◽  
pp. 4263-4274
Author(s):  
M. Y. M. Yunus ◽  
N. A. Ismail ◽  
B. A. Aziz
Keyword(s):  
Rare Earth ◽  
Rare Earth Element ◽  
Separation Factor ◽  
Earth Element ◽  
Hybrid Approach ◽  
Economic Potential ◽  
Heavy Rare Earth Element ◽  
Rule Based ◽  
Optimal Separation

Rare Earth Element (REE) is a unique group of metals which mainly comprises seventeen (17) elements, which fifteen (15) elements from the lanthanides group plus Scandium and Yttrium. This REE can be divided into heavy rare earth element (HREE) and light rare earth element (LREE) categories. During the initial extraction stage, the LREE is separated from HREE of the original ore and the sub-separations are then conducted subsequently corresponding to the respective categories. However, the separation difficulty becomes rather critical in a certain context, whenever the HREE is the major element to be extracted relative to LREE. In addition, there are no systematic guidelines procedures available to determine which specific separation pathway is more economically feasible among the various extraction options that exist. Thus, this study proposes a systematic quantitative rule-based framework, by excel modelling, in assessing comprehensively the economic potential of any separation model of REE processing that considered, whereby the standard characterization of monazite mineral composition is utilized as the main case study. This work also adopts the separation factor value of HDEHP-HCL as well as EHEHPA-HCL as the main extraction platforms. The findings suggest that the former extractant is effective for the extraction of light REE (LREE), while the latter incline to prefer the medium and heavy REE (MREE and HREE) particularly on the ground of separation stages factor. In light of the initial results, this study also proposes a hybrid approach in performing the complete optimal REE separation that specifically based on the sequence of ‘Art versus Science’ (AvsS) structure. These results have demonstrated that the proposed quantitative rule-based framework able to determine the optimal separation pathway provided the complete separation factor values and the mineral characterization of REE are available for assessment. Thus, this new method is suitably applied as a tool or guidelines in the feasibility study of any processing design for REE separation.

scholarly journals A Semantic Characterization ASP Base Revision

2019 ◽  
Vol 66 ◽  
pp. 989-1029
Author(s):  
Laurent Garcia ◽  
Claire Lefèvre ◽  
Igor Stéphan ◽  
Odile Papini ◽  
Éric Würbel
Keyword(s):  
Classical Logic ◽  
Answer Set Programming ◽  
Semantic Content ◽  
Logic Programs ◽  
Rule Based ◽  
Complexity Results ◽  
Base Revision ◽  
Answer Sets ◽  
Answer Set

The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets. This semantic characterization allows for equivalently considering the evolution of syntactic logic programs and the evolution of their semantic content. It then studies the logical properties of the proposed operators and gives complexity results.  

Sign in / Sign up

Export Citation Format

Share Document