Decision Support System and Multi‐Criteria Decision Aid: A State of the Art and Perspectives

The aim of this paper is to highlight the role of the Decision Support System within the field of multi‐criteria decision aid (MCDA). The MCDA tools have been incorporated into systems to create Multi‐Criteria Decision Support Systems (MCDSSs). In our literature review, we noticed that more than 100 papers have been written over a 20‐year period in which MCDSS was used as a decision‐making tool. The present paper describes some real applications of MCDSS in different fields, harmoniously combined with decision‐making methods such as analytic hierarchy process, Utility Additive, and Goal Programming. The present study proposes an integrative MCDSS evaluation through guidance on the tools most useful for a specific user with a particular decision problem. Copyright © 2014 John Wiley & Sons, Ltd.     

Economic optimization by compromise programming: The joint production model

In a basic microeconomic model (joint production and consumer's utility curves) three key optima appear: the best technological mix, the maximum profit point and the consumer's utility optimum. Compromise analysis can help to clarify their connections. This paper and other recent research attempt to specify the conditions which guarantee that these three optima coincide. Thus compromise programming becomes a valuable surrogate of economic optimization.     

How Experts Adapt Their Gaze Behavior When Modeling a Task to Novices

Domain experts regularly teach novice students how to perform a task. This often requires them to adjust their behavior to the less knowledgeable audience and, hence, to behave in a more didactic manner. Eye movement modeling examples (EMMEs) are a contemporary educational tool for displaying experts’ (natural or didactic) problem-solving behavior as well as their eye movements to learners. While research on expert-novice communication mainly focused on experts’ changes in explicit, verbal communication behavior, it is as yet unclear whether and how exactly experts adjust their nonverbal behavior. This study first investigated whether and how experts change their eye movements and mouse clicks (that are displayed in EMMEs) when they perform a task naturally versus teach a task didactically. Programming experts and novices initially debugged short computer codes in a natural manner. We first characterized experts’ natural problem-solving behavior by contrasting it with that of novices. Then, we explored the changes in experts’ behavior when being subsequently instructed to model their task solution didactically. Experts became more similar to novices on measures associated with experts’ automatized processes (i.e., shorter fixation durations, fewer transitions between code and output per click on the run button when behaving didactically). This adaptation might make it easier for novices to follow or imitate the expert behavior. In contrast, experts became less similar to novices for measures associated with more strategic behavior (i.e., code reading linearity, clicks on run button) when behaving didactically.     

A verification framework for agent programming with declarative goals

A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a link between agent logics and agent programming frameworks is identified and explained by the fact that agent programming frameworks have hardly incorporated the concept of a declarative goal. Instead, such frameworks have focused mainly on plans or goals-to-do instead of the end goals to be realised which are also called goals-to-be. In this paper, the programming language GOAL is introduced which incorporates such declarative goals. The notion of a commitment strategy—one of the main theoretical insights due to agent logics, which explains the relation between beliefs and goals—is used to construct a computational semantics for GOAL. Finally, a proof theory for proving properties of GOAL agents is introduced. Thus, the main contribution of this paper, rather than the language GOAL itself, is that we offer a complete theory of agent programming in the sense that our theory provides both for a programming framework and a programming logic for such agents. An example program is proven correct by using this programming logic.     

Group Decision Makers' Preferences Modelling within the Goal Programming Model: An Overview and a Typology

The Goal Programming (GP) model is one of the first models that have been developed to deal with managerial decision‐making problems where several incommensurable and conflicting objectives are involved. The GP variants integrate the decision maker's preferences differently. This model has also been applied to group decision‐making situations. The aim of this paper is to propose a new typology based on preferences articulation of decision makers through the GP model. This typology is based on the articulation and the elucidation process of the group decision makers' preferences. Copyright © 2012 John Wiley & Sons, Ltd.     

Deductive databases for computing certain and consistent answers from mediated data integration systems

We address the problem of retrieving certain and consistent answers to queries posed to a mediated data integration system under the local-as-view paradigm with open sources and conjunctive and disjunctive view definitions. For obtaining certain answers a query program is run under the cautious stable model semantics on top of a normal deductive database with choice operator that specifies the class of minimal legal instances of the integration system. This methodology works for all monotone Datalog queries. To compute answers to queries that are consistent with respect to given global integrity constraints, the specification of minimal legal instances is combined with another disjunctive deductive database that specifies the repairs of those legal instances. This allows to retrieve the answers to any Datalog^¬ query that are consistent with respect to global universal and referential integrity constraints.     

Early life origins of psychological development and mental health

According to the Developmental Origins of Health and Disease (DOHaD)‐hypothesis, conditions early in life may have life‐long consequences. In a series of epidemiological birth cohort and clinical studies and natural experiments, we have had the chance to test the extent to which this hypothesis is useful in understanding individual differences in psychological development and mental health. Our findings have provided evidence that individual differences in cognitive, social and emotional development and in mental health may lie in early life circumstances, and add significantly to the literature by pointing out which periods of early growth are the most critical. These findings are also important in translating pre‐clinical evidence to humans. What remains less clear, however, is what the mechanisms of programming are. Thus, further research is needed to elucidate these mechanisms before information on the early life origins of health and disease can be used in designing prevention and intervention programs.     

An intensional epistemic logic

One of the fundamental properties inclassical equational reasoning isLeibniz's principle of substitution. Unfortunately, this propertydoes not hold instandard epistemic logic. Furthermore,Herbrand's lifting theorem which isessential to thecompleteness ofresolution andParamodulation in theclassical first order logic (FOL), turns out to be invalid in standard epistemic logic. In particular, unlike classical logic, there is no skolemization normal form for standard epistemic logic. To solve these problems, we introduce anintensional epistemic logic, based on avariation of Kripke's possible-worlds semantics that need not have a constant domain. We show how a weaker notion of substitution through indexed terms can retain the Herbrand theorem. We prove how the logic can yield a satisfibility preserving skolemization form. In particular, we present an intensional principle for unifing indexed terms. Finally, we describe asound andcomplete inference system for a Horn subset of the logic withequality, based onepistemic SLD-resolution.     

折中效应的整合性机制

摘要：文中通过导入适应水平理论,使用二分类Logistics回归模型分析复合因素下折中效应的变化规律。共有以下发现：第一,信息提示方式对于折中效应有主效应,而且,信息的单面提示比双面提示方式下更易出现折中效应;第二,信息提示方式、精致化、风险认知对于折中效应有显著的二阶交互效应;第三,消费者的产品卷入、产品知识、风险认知分别与折中效应有正或负的关系。结论表明,在信息提示方式的调节作用之下,折中效应中不但分别存在单一的ELM抑制机制以及风险认知促进机制,而且还存在它们的双重机制。