Decision making amounts to define a preorder (usually a complete one) on a set of options. Argumentation has been introduced in decision making analysis. In particular, an argument-based decision system has been proposed recently by Amgoud et al. The system is a variant of Dung’s abstract framework. It takes as input a set of options, different arguments and a defeat relation among them, and re...

The zonoid of a d-dimensional random vector is used as a tool for measuring linear dependence among its components. A preorder of linear dependence is defined through inclusion of the zonoids. The zonoid of a random vector does not characterize its distribution, but it characterizes the size biased distribution of its compositional variables. This fact will allow a characterization of our linea...

Bochum, Germany, pages 899 904, 1996. Con uent Preorder Parser As A Finite State Automata HO, Kei Shiu Edward CHAN, Lai Wan Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong email: [email protected], [email protected] Abstract. We present the Con uent Preorder Parser (CPP) in which syntactic parsing is achieved via a holistic tra...

We develop an abstraction-based framework to check probabilistic specifications of Markov Decision Processes (MDPs) using the stochastic two-player game abstractions (i.e. “games”) developed by Kwiatkowska et al. as a foundation. We define an abstraction preorder for these game abstractions which enables us to identify many new game abstractions for each MDP — ranging from compact and imprecise...

This paper models collective decision-making scenarios by using a priority-based aggregation procedure, the so-called lexicographic method, in order to represent a form of reliability-based ‘deliberation’. More precisely, it considers agents with a preference ordering over a set of objects and a reliability ordering over the agents themselves, providing a logical framework describing the way in...

Multi-context systems (MCS) presented by Brewka and Eiter can be considered as a promising way to interlink decentralized and heterogeneous knowledge contexts. In this paper, we propose preferential multicontext systems (PMCS), which provide a framework for incorporating a total preorder relation over contexts in a multi-context system. In a given PMCS, its contexts are divided into several par...

A variant of the classical knapsack problem is considered in which each item associated with an integer weight and a qualitative level. We define dominance relation over feasible subsets given set show that this defines preorder. propose dynamic programming algorithm to compute entire non-dominated rank cardinality vectors we state two greedy algorithms, efficiently single efficient solution.

Abstract We run an experiment to elicit preferences over state-contingent timed payouts. analyze the data using a new revealed preference method (building on Nishimura, Ok, and Quah (2017)) that can test for consistency with utility functions increase given preorder. find correlation neutrality, property implied by discounted expected utility, is widely violated there is, instead, strong eviden...

We present an approach to understanding first-order theories by exploring their models. A typical use case is the analysis of artifacts such as policies, protocols, configurations, and software designs. For the analyses we offer, users are not required to frame formal properties or construct derivations. Rather, they can explore examples of their designs, confirming the expected instances and p...

The paper proposes a variation of simulation for checking and proving contextual equivalence in a non-deterministic call-by-need lambda-calculus with constructors, case, seq, and a letrec with cyclic dependencies. It also proposes a novel method to prove its correctness. The calculus’ semantics is based on a small-step rewrite semantics and on may-convergence. The cyclic nature of letrec bindin...