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.

A dynamic description logic for representation and reasoning about actions

Abstract: We present a dynamic description logic for representation and reasoning about actions, with an approach that embrace actions into the description logic ALCO@. With this logic, description logic concepts can be used for describing the state of the world, and the preconditions and effects of atomic actions; Complex actions can be modeled with the help of standard action operators, such as the test, sequence, choice, and iteration operators; And both atomic actions and complex actions can be used as modal operators to construct formulas. We develop a terminable and correct algorithm for checking the satisfiability of formulas. Based on the algorithm, many reasoning tasks on actions are effectively carried out, including the realizability, executability, projection and planning problems.

Modal probability, belief, and actions

Abstract: We investigate a modal logic of probability with a unary modal operator expressing that a proposition is more probable than its negation Such an operator is not closed under conjunction, and its modal logic is therefore non-normal Within this framework we study the relation of probability with other modal concepts: belief and action We focus on the evolution of belief, and propose an integration of revision For that framework we give a regression algorithm

The Origins of Modal Error

Abstract: Modal intuitions are the primary source of modal knowledge but also of modal error According to the theory of modal error in this paper, modal intuitions retain their evidential force in spite of their fallibility, and erroneous modal intuitions are in principle identifiable and eliminable by subjecting our intuitions to a priori dialectic After an inventory of standard sources of modal error, two further sources are examined in detail The first source - namely, the failure to distinguish between metaphysical possibility and various kinds of epistemic possibility - turns out to be comparatively easy to untangle and poses little threat to intuition-driven philosophical investigation The second source is the local (ie, temporary) misunderstanding of one's concepts (as opposed to outright Burgean misunderstanding) This pathology may be understood on analogy with a patient who is given a clean bill of health at his annual check-up, despite his having a cold at the time of the check-up: although the patient's health is locally (temporarily) disrupted, his overall health is sufficiently good to enable him to overcome the cold without external intervention Even when our understanding of certain pivotal concepts has lapsed locally, our larger body of intuitions is sufficiently reliable to allow us, without intervention, to ferret out the modal errors resulting from this lapse in understanding by means of dialectic and/or a process of a priori reflection This source of modal error, and our capacity to overcome it, has wide-ranging implications for philosophical method - including, in particular, its promise for disarming skepticism about the classical method of intuition-driven philosophical investigation itself Indeed, it is shown that skeptical accounts of modal error (eg, the accounts given by Hill, Levin, and several others) are ultimately self-defeating

Strong Boethius’ Thesis and Consequential Implication

Abstract: The paper studies the relation between systems of modal logic and systems of consequential implication, a non-material form of implication satisfying “Aristotle's Thesis” (p does not imply not p ) and “Weak Boethius' Thesis” (if p implies q, then p does not imply not q ) Definitions are given of consequential implication in terms of modal operators and of modal operators in terms of consequential implication The modal equivalent of “Strong Boethius' Thesis” (that p implies q implies that p does not imply not q) is identified

A Multiprocess Network Logic with Temporal and Spatial Modalities

Abstract: We introduce a modal logic which can be used to formally reason about synchronous fixed connection multiprocess networks such as of VLSI. Our logic has both temporal and spatial modal operators. The various temporal modal operators allow us to relate properties of the current state of a given process with properties of succeeding states of the given process. Also, the spatial modal operators allow us to relate properties of the current state of a given process with properties of the current state of neighboring processes. Many interesting properties for multiprocessor networks can be elegantly expressed in our logic. We give examples of the diverse applications of our logic to packet routing, firing squad problems, and systolic algorithms.