Modal Logics with Counting
نویسندگان
چکیده
We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how this logic has been previously investigated under different guises. We show that the language is related to graded modalities and to hybrid logics. We illustrate a possible application of the language to the treatment of plural objects and queries in natural language. We investigate the expressive power of this logic via bisimulations, discuss the complexity of its satisfiability problem, define a new reasoning task that retrieves the cardinality bound of the extension of a given input formula, and provide an algorithm to solve it.
منابع مشابه
Decidable first-order modal logics with counting quantifiers
In this paper, we examine the computational complexity of various natural onevariable fragments of first-order modal logics with the addition of arbitrary counting quantifiers. The addition of counting quantifiers provides us a rich language with which to succinctly express statements about the quantity of objects satisfying a given property, using only a single variable. We provide optimal upp...
متن کاملDecidable Logics with Associative Binary Modalities
A new family of modal logics with an associative binary modality, called counting logics is proposed. These propositional logics allow to express finite cardinalities of sets and more generally to count the number of subsets satisfying some properties. We show that these logics can be seen both as specializations of the Boolean logic of bunched implications and as generalizations of the proposi...
متن کاملComputing Bisimulation-Based Comparisons
By using the idea of Henzinger et al. for computing the similarity relation, we give an efficient algorithm, with complexity O((m + n)n), for computing the largest bisimulation-based autocomparison and the directed similarity relation of a labeled graph for the setting without counting successors, where m is the number of edges and n is the number of vertices. Moreover, we provide the first alg...
متن کاملOn the density of truth in modal logics
The aim of this paper is counting the probability that a random modal formula is a tautology. We examine {→, 2} fragment of two modal logics S5 and S4 over the language with one propositional variable. Any modal formula written in such a language may be interpreted as a unary binary tree. As it is known, there are finitely many different formulas written in one variable in the logic S5 and this...
متن کاملOn Logics with Two Variables
This paper is a survey and systematic presentation of decidability and complexity issues for modal and non-modal two-variable logics. A classical result due to Mortimer says that the two-variable fragment of rst-order logic, denoted FO 2 , has the nite model property and is therefore decidable for satissability. One of the reasons for the signiicance of this result is that many propositional mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010