English
Related papers

Related papers: Deontic modality based on preference

200 papers

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…

Logic in Computer Science · Computer Science 2024-06-06 Piotr Ostropolski-Nalewaja , Tim S. Lyon

Preferences play a key role in determining what goals/constraints to satisfy when not all constraints can be satisfied simultaneously. In this work, we study preference-based planning in a stochastic system modeled as a Markov decision…

Formal Languages and Automata Theory · Computer Science 2022-03-28 Abhishek Ninad Kulkarni , Jie Fu

Supervenience is an important philosophical concept. In this paper, inspired by the supervenience-determined consequence relation and the semantics of agreement operator, we introduce a modal logic of supervenience, which has a dyadic…

Logic · Mathematics 2019-09-18 Jie Fan

Multimodal Machine Learning has emerged as a prominent research direction across various applications such as Sentiment Analysis, Emotion Recognition, Machine Translation, Hate Speech Recognition, and Movie Genre Classification. This…

Computation and Language · Computer Science 2023-06-13 Abdelhamid Haouhat , Slimane Bellaouar , Attia Nehar , Hadda Cherroun

Given that there exist many different formal and precise treatments of deontologi- cal and consequentialist ethics, we turn to virtue ethics and consider what could be a formalization of virtue ethics that makes it amenable to automation.…

Artificial Intelligence · Computer Science 2018-05-22 Naveen Sundar Govindarajulu , Selmer Bringjsord , Rikhiya Ghosh

A multicriteria group choice problem is considered in the paper. The model includes a set of feasible alternatives, a vector criterion, and n preference relations of the decision makers (DMs). Each preference relation is a cone relation…

Optimization and Control · Mathematics 2019-05-14 Alexey O. Zakharov

This paper investigates modal type theories by using a new categorical semantics called change-of-base semantics. Change-of-base semantics is novel in that it is based on (possibly infinitely) iterated enrichment and interpretation of…

Logic in Computer Science · Computer Science 2018-10-26 Yuichi Nishiwaki , Yoshihiko Kakutani , Yuito Murase

Facing an unknown situation, a person may not be able to firmly elicit his/her preferences over different alternatives, so he/she tends to express uncertain preferences. Given a community of different persons expressing their preferences…

Artificial Intelligence · Computer Science 2017-08-11 Yiru Zhang , Tassadit Bouadi , Arnaud Martin

We consider the problem of rationalizing choice data by a preference satisfying an arbitrary collection of invariance axioms. Examples of such axioms include quasilinearity, homotheticity, independence-type axioms for mixture spaces,…

Theoretical Economics · Economics 2024-08-09 Peter Caradonna , Christopher P. Chambers

Many regenerative arguments in stochastic processes use random times which are akin to stopping times, but which are determined by the future as well as the past behaviour of the process of interest. Such arguments based on "conditioning on…

Probability · Mathematics 2014-10-09 Sergey Foss , Stan Zachary

There is a rapidly-growing research interest in engaging users with multi-modal data for accurate user modeling on recommender systems. Existing multimedia recommenders have achieved substantial improvements by incorporating various…

Information Retrieval · Computer Science 2023-05-04 Dong Yao , Shengyu Zhang , Zhou Zhao , Jieming Zhu , Wenqiao Zhang , Rui Zhang , Xiaofei He , Fei Wu

We study two notions of definability for classes of relational structures based on modal extensions of {\L}ukasiewicz finitely valued-logics. The main results of the paper are the equivalent of the Goldblatt - Thomason theorem for these…

Logic · Mathematics 2015-11-26 Bruno Teheux

In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…

Logic · Mathematics 2018-12-19 Fan Yang , Jouko Väänänen

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

Logic · Mathematics 2023-05-02 Saharon Shelah

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

In deterministic theories, one can start from a set of ontological states to formulate the dynamical laws, but these may not be directly observable. Observable are only equivalence classes of states, and these will span a basis of…

High Energy Physics - Theory · Physics 2007-05-23 Gerard 't Hooft

We survey all known examples of finite posets whose order polynomials have product formulas, and we propose the heuristic that these are the same posets with good dynamical behavior. Here the dynamics in question are the actions of…

Combinatorics · Mathematics 2024-08-09 Sam Hopkins

Selectional preference learning methods have usually focused on word-to-class relations, e.g., a verb selects as its subject a given nominal class. This paper extends previous statistical models to class-to-class preferences, and presents a…

Computation and Language · Computer Science 2007-05-23 Eneko Agirre , David Martinez

There are several contexts of non-monotonic reasoning where a priority between rules is established whose purpose is preventing conflicts. One formalism that has been widely employed for non-monotonic reasoning is the sceptical one known as…

Artificial Intelligence · Computer Science 2012-11-26 Guido Governatori , Francesco Olivieri , Simone Scannapieco , Matteo Cristani

Possibilistic logic has been proposed as a numerical formalism for reasoning with uncertainty. There has been interest in developing qualitative accounts of possibility, as well as an explanation of the relationship between possibility and…

Artificial Intelligence · Computer Science 2013-03-25 Craig Boutilier
‹ Prev 1 3 4 5 6 7 10 Next ›