There has been an effort for a few decades to keep energy consumption at minimum or least within low-level range. This is more meaningful and complex by including customer’s satisfaction variable ensure that customers can achieve the best quality of life could be derived from how used different devices. We use concept Shapley Value cooperative game theory solve multi-objective optimization prob...

One of the most fundamental challenges in constraint programming is to understand the computational complexity of problems involving constraints. It has been shown that the class of all constraint satisfaction problem instances is NP-hard [71], so it is unlikely that efficient general-purpose algorithms exist for solving all forms of constraint problem. However, in many practical applications t...

The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the literature has primarily considered the formulation of the CSP where constraint relations are given explicitly. We initiate the systematic study of CSP complexity with succinctly specified constraint relations.

Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...

A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen et al. established a Galois connection between finitely-generated weighted clones and finitely-generated weighted relational clones [SICOMP’13], and asked whe...

This paper develops a compositional, type-driven constraint semantic theory for a fragment of the language of subjective uncertainty. In the particular application explored here, the interpretation function of constraint semantics yields not propositions but constraints on credal states as the semantic values of declarative sentences. Constraints are richer than propositions in that constraints...

We investigate the semantic foundations of a method for modeling agents as entities with a mental state which was suggested by McCarthy and by Newell. Our goals are to formalize this modeling approach and its semantics, to understand the theoretical and practical issues that it raises, and to address some of them. In particular, this requires specifying the model’s parameters and how these para...

Reo is a coordination language that can be used to model different systems. Constraint automata form a formal semantics for Reo connectors based on a co-algebraic model of streams. In this paper, we introduce complete constraint automata (CCA) whose extra information about entropy states helps in analyzing and decomposing them into Reo circuits. We show that a complete constraint automaton is i...

Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence or containment of the behavior of two given connectors, verification of the behavior of a connector, etc. requires an operational semantic model suitable for model checking. In this paper we introduce c...

The notion of constraint appears in all modern linguistic theories. However, constraint satisfaction, which is the typical way of implementing constraints, is not really used for the implementation of such theories. We propose in this paper a formalism called Property Grammar which is totally based on constraints: all linguistic information is represented by means of properties which allow pars...