scispace - formally typeset
Search or ask a question
Topic

Modal operator

About: Modal operator is a research topic. Over the lifetime, 1151 publications have been published within this topic receiving 22865 citations. The topic is also known as: modal connective.


Papers
More filters
Posted Content
TL;DR: In this paper, a ceteris paribus modal logic interpreted on the equivalence classes induced by sets of propositional atoms is introduced, which is used to embed two logics of agency and games.
Abstract: The article introduces a ceteris paribus modal logic interpreted on the equivalence classes induced by sets of propositional atoms. This logic is used to embed two logics of agency and games, namely atemporal STIT and the coalition logic of propositional control (CL-PC). The embeddings highlight a common ceteris paribus structure underpinning the key modal operators of both logics, they clarify the relationship between STIT and CL-PC, and enable the transfer of complexity results to the ceteris paribus logic.

4 citations

Book ChapterDOI
01 Aug 2015
TL;DR: A representation of graded statements is presented by presenting a simple non-normal modal logic which comes with a set of modal operators, directly associated with the words indicating the uncertainty and interpreted through confidence intervals in the model theory.
Abstract: Medical natural language statements uttered by physicians are usually graded, i.e., are associated with a degree of uncertainty about the validity of a medical assessment. This uncertainty is often expressed through specific verbs, adverbs, or adjectives in natural language. In this paper, we look into a representation of such graded statements by presenting a simple non-normal modal logic which comes with a set of modal operators, directly associated with the words indicating the uncertainty and interpreted through confidence intervals in the model theory. We complement the model theory by a set of RDFS-/OWL 2 RL-like entailment if-then rules, acting on the syntactic representation of modalized statements. Our interest in such a formalization is related to the use of OWL as the de facto standard in medical ontologies today and its weakness to represent and reason about assertional knowledge that is uncertain or that changes over time. The approach is not restricted to medical statements, but is applicable to other graded statements as well.

4 citations

Proceedings ArticleDOI
11 Dec 2015
TL;DR: In this paper the verbal communication is limited by the means of quasi-natural language statements with epistemic modal operators related to a particular knowledge uncertainty level.
Abstract: An approach to summarizing of results from a class of usability studies is presented. It is based on an original theory of modal language grounding. Relevant part of this theory is briefly presented and is further compared to the classical theory of fuzzy linguistic summarization known from data science literature. An example of usability studies is carried out with respect to model in which end users (clients) realize a complex interaction with the system. The interaction is modeled, as a path of completed steps concluded by one of predefined final states, some of which represent desirable economic value. The proposed approach aims to provide a strict theoretical background for a consistent way in which results of usability study can be communicated verbally. In this paper the verbal communication is limited by the means of quasi-natural language statements with epistemic modal operators related to a particular knowledge uncertainty level.

4 citations

Journal ArticleDOI
TL;DR: A representation theorem is introduced which demonstrates that, in this algebraic model, a dual pair of modal operators can be represented by compositions of two strong negations, where one of them is stricter than the other.

4 citations

01 Jan 1993
TL;DR: A LISP program is presented that implements von Wright’s logic as a decision supporting system, i.e. that decides for a given set of preferences, what alternatives the authors should choose, according to von Wright's preference logic system.
Abstract: In this thesis we are exploring some models for von Wright’s preference logic. For a given (initial) set of axioms and a set of formulae, some of them valid, some of them problematic (in the sense that it is not always intuitively clear whether they should be valid or not), we investigated some matrix semantics for those formulae including semantics in relevance logics (first degree entailment and RM3), various many–valued (Kleene’s, Lukasiewicz’s, . . . ) and/or paraconsistent logics, in Sugihara matrix, and one interpretation for preference relation using modal operators and ♢. In each case, we also investigated dependence results between various formulae. An opposite problem (i.e. searching for a logic that satisfies given constraints) is also addressed. At the end, a LISP program is presented that implements von Wright’s logic as a decision supporting system, i.e. that decides for a given set of preferences, what alternatives (world situation) we should choose, according to von Wright’s preference logic system.

4 citations


Network Information
Related Topics (5)
Description logic
8.7K papers, 232.7K citations
86% related
Axiom
11K papers, 257.9K citations
83% related
Logic programming
11.1K papers, 274.2K citations
83% related
Absorption (logic)
5.7K papers, 236.3K citations
82% related
Type (model theory)
38.9K papers, 670.5K citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202316
202222
202138
202035
201946
201844