To overcome inefficiency in traditional logic programming, a declarative programming language COPS is designed based on the notion of concurrent constraint programming (CCP). The improvement is achieved by the adoptio...To overcome inefficiency in traditional logic programming, a declarative programming language COPS is designed based on the notion of concurrent constraint programming (CCP). The improvement is achieved by the adoption of constraint-based heuristic strategy and the introduction of deterministic components in the framework of CCP. Syntax specification and an operational semantic description are presented.展开更多
This paper addresses the issue of checking consistency in information models. A method based on constraint programming is proposed for identifying inconsistency or proving consistency in information models. The system...This paper addresses the issue of checking consistency in information models. A method based on constraint programming is proposed for identifying inconsistency or proving consistency in information models. The system described here checks information models written in the ISO standard information modelling language EXPRESS. EXPRESS is part of the ISO STEP standard used in the manufacturing and process industries. This paper describes the checking procedure, including EXPRESS model formalization, constraint satisfaction problem (CSP) derivation from the formalized model and satisfaction checking of the derived CSPs. This paper shows a new domain in which constraint programming can be exploited as model verification and validation.展开更多
This article discusses feasibility conditions in mathematical programs with equilibrium constraints （MPECs）. The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors sho...This article discusses feasibility conditions in mathematical programs with equilibrium constraints （MPECs）. The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors show that the two feasibility conditions are different from the feasibility condition in [2, 3], and show that the sufficient condition in [3] is stronger than that in [2].展开更多
In this paper, we study some new systems of generalized quasi-variational inclusion problems in FC-spaces without convexity structure.By applying an existence theorem of maximal elements of set-valued mappings due to ...In this paper, we study some new systems of generalized quasi-variational inclusion problems in FC-spaces without convexity structure.By applying an existence theorem of maximal elements of set-valued mappings due to the author, some new existence theorems of solutions for the systems of generalized quasi-variational inclusion problems are proved in noncompact FC-spaces. As applications, some existence results of solutions for the system of quasi-optimization problems and mathematical programs with the systems of generalized quasi-variational inclusion constraints are obtained in FC-spaces.展开更多
文摘To overcome inefficiency in traditional logic programming, a declarative programming language COPS is designed based on the notion of concurrent constraint programming (CCP). The improvement is achieved by the adoption of constraint-based heuristic strategy and the introduction of deterministic components in the framework of CCP. Syntax specification and an operational semantic description are presented.
文摘This paper addresses the issue of checking consistency in information models. A method based on constraint programming is proposed for identifying inconsistency or proving consistency in information models. The system described here checks information models written in the ISO standard information modelling language EXPRESS. EXPRESS is part of the ISO STEP standard used in the manufacturing and process industries. This paper describes the checking procedure, including EXPRESS model formalization, constraint satisfaction problem (CSP) derivation from the formalized model and satisfaction checking of the derived CSPs. This paper shows a new domain in which constraint programming can be exploited as model verification and validation.
基金the National Natural Science Foundation of China(70271019)
文摘This article discusses feasibility conditions in mathematical programs with equilibrium constraints （MPECs）. The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors show that the two feasibility conditions are different from the feasibility condition in [2, 3], and show that the sufficient condition in [3] is stronger than that in [2].
基金supported by the Scientific Research Fun of Sichuan Normal University(09ZDL04)the Sichuan Province Leading Academic Discipline Project(SZD0406)
文摘In this paper, we study some new systems of generalized quasi-variational inclusion problems in FC-spaces without convexity structure.By applying an existence theorem of maximal elements of set-valued mappings due to the author, some new existence theorems of solutions for the systems of generalized quasi-variational inclusion problems are proved in noncompact FC-spaces. As applications, some existence results of solutions for the system of quasi-optimization problems and mathematical programs with the systems of generalized quasi-variational inclusion constraints are obtained in FC-spaces.
