English
Related papers

Related papers: Deontic modality based on preference

200 papers

In this paper, we mainly focus on formal deformation theory of module homomorphisms. We first introduce the cohomology of module homomorphisms and study formal one-parameter deformation. We obtain some properties about obstructions. Then we…

Rings and Algebras · Mathematics 2022-08-23 RB Yadav , Liangyun Chen , Yao Ma , Ying Hou

We present a formal language for specifying qualitative preferences over temporal goals and a preference-based planning method in stochastic systems. Using automata-theoretic modeling, the proposed specification allows us to express…

Artificial Intelligence · Computer Science 2021-03-29 Jie Fu

Standard methods in preference learning involve estimating the parameters of discrete choice models from data of selections (choices) made by individuals from a discrete set of alternatives (the choice set). While there are many models for…

Machine Learning · Computer Science 2021-08-18 Kiran Tomlinson , Johan Ugander , Austin R. Benson

We improve upon a recent result of Culler and Dunfield on orderability of certain Dehn fillings by removing a difficult condition they required.

Geometric Topology · Mathematics 2018-07-03 Christopher Herald , Xingru Zhang

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

Formal Languages and Automata Theory · Computer Science 2019-01-09 Dietrich Kuske , Georg Zetzsche

The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded…

Logic in Computer Science · Computer Science 2015-07-03 Miika Hannula

We establish the strictness of several set quantifier alternation hierarchies that are based on modal logic, evaluated on various classes of finite graphs. This extends to the modal setting a celebrated result of Matz, Schweikardt and…

Logic in Computer Science · Computer Science 2016-03-01 Fabian Reiter

Ingroup favoritism, the tendency to favor ingroup over outgroup, is often explained as a product of intergroup conflict, or correlations between group tags and behavior. Such accounts assume that group membership is meaningful, whereas…

Theoretical Economics · Economics 2019-08-23 Marcel Montrey , Thomas R. Shultz

Dendroidal sets offer a formalism for the study of $\infty$-operads akin to the formalism of $\infty$-categories by means of simplicial sets. We present here an account of the current state of the theory while placing it in the context of…

Algebraic Topology · Mathematics 2012-03-06 Ittay Weiss

We study preferences estimated from finite choice experiments and provide sufficient conditions for convergence to a unique underlying "true" preference. Our conditions are weak, and therefore valid in a wide range of economic environments.…

Theoretical Economics · Economics 2020-11-03 Christopher P. Chambers , Federico Echenique , Nicolas Lambert

This paper examines how a notion of stable explanation developed elsewhere in Defeasible Logic can be expressed in the context of formal argumentation. With this done, we discuss the deontic meaning of this reconstruction and show how to…

Artificial Intelligence · Computer Science 2023-07-12 Cecilia Di Florio , Guido Governatori , Antonino Rotolo , Giovanni Sartor

2-dimensional knots and links are studied in the article. The notion of parity is introduced via techniques similar to the ones used by the second named author in 1-dimensional case. By using parity new invariants are constructed and known…

Geometric Topology · Mathematics 2016-06-23 Denis A. Fedoseev , Vassily O. Manturov

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

Preference elicitation explicitly asks users what kind of recommendations they would like to receive. It is a popular technique for conversational recommender systems to deal with cold-starts. Previous work has studied selection bias in…

Information Retrieval · Computer Science 2024-05-02 Shashank Gupta , Harrie Oosterhuis , Maarten de Rijke

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

We propose a new online learning model for learning with preference feedback. The model is especially suited for applications like web search and recommender systems, where preference data is readily available from implicit user feedback…

Machine Learning · Computer Science 2011-11-04 Pannagadatta K. Shivaswamy , Thorsten Joachims

This paper presents a plausible reasoning system to illustrate some broad issues in knowledge representation: dualities between different reasoning forms, the difficulty of unifying complementary reasoning styles, and the approximate nature…

Artificial Intelligence · Computer Science 2013-03-26 Wray L. Buntine

Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are discussed for different application domains like argumentation theory, legal reasoning, and acts in multi-agent…

Artificial Intelligence · Computer Science 2018-09-17 Ulrich Furbach , Claudia Schon , Frieder Stolzenburg

Extending and generalizing the approach of 2-sequents (Masini, 1992), we present sequent calculi for the classical modal logics in the K, D, T, S4 spectrum. The systems are presented in a uniform way-different logics are obtained by tuning…

Logic in Computer Science · Computer Science 2020-01-08 Simone Martini , Andrea Masini , Margherita Zorzi

Mereology is the study of parts and the relationships that hold between them. We introduce a behavioral approach to mereology, in which systems and their parts are known only by the types of behavior they can exhibit. Our discussion is…

Logic in Computer Science · Computer Science 2021-01-27 Brendan Fong , David Jaz Myers , David I. Spivak