On the public citation graph

Graded modalities. I

https://doi.org/10.1007/bf00379767
0 signed · 97 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0003-4843(75)90004-2openalex-snapshot
Decidability results in non-classical logics
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7021-1openalex-snapshot
Languages with Expressions of Infinite Length
inferredcites →https://doi.org/10.1017/cbo9780511621192openalex-snapshot
Modal Logic
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1111/j.1468-0149.1969.tb00005.xopenalex-snapshot
AN INTRODUCTION TO MODAL LOGIC
inferredcites →https://doi.org/10.2307/2314842openalex-snapshot
Languages with Expressions of Infinite Length.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19950410410openalex-snapshot
An Infinitary Graded Modal Logic (Graded Modalities VI)
inferred← citeshttps://doi.org/10.1002/malq.19990450406openalex-snapshot
The Modality of Finite (Graded Modalities VII)
inferred← citeshttps://doi.org/10.1006/jcss.1999.1636openalex-snapshot
Models of Nondeterministic Regular Expressions
inferred← citeshttps://doi.org/10.1007/11814771_44openalex-snapshot
Presburger Modal Logic Is PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_2openalex-snapshot
Description Logics for Information Integration
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_31openalex-snapshot
Graded Modalities and Resource Bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/978-1-4613-1461-5_3openalex-snapshot
A Review of Rough Set Models
inferred← citeshttps://doi.org/10.1007/978-3-030-29566-0_2openalex-snapshot
Overview of Rough Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_16openalex-snapshot
Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-031-66021-4_4openalex-snapshot
Frequentist Probability Logic
inferred← citeshttps://doi.org/10.1007/978-3-032-37664-0_28openalex-snapshot
PLEX: Edge-Aware Logic-Based Self-Explainable Graph Neural Networks with Polyadic Predicates
inferred← citeshttps://doi.org/10.1007/978-3-211-85432-7_4openalex-snapshot
Logical approaches to fuzzy similarity-based reasoning: an overview
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_43openalex-snapshot
Logic Programming with Graded Modality
inferred← citeshttps://doi.org/10.1007/978-3-319-40581-0_13openalex-snapshot
Negation of Graded Beliefs
inferred← citeshttps://doi.org/10.1007/978-3-319-66824-6_35openalex-snapshot
A Fuzzy Take on Graded Beliefs
inferred← citeshttps://doi.org/10.1007/978-3-319-72691-5_4openalex-snapshot
Logical Characterizations of Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_11openalex-snapshot
A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_10openalex-snapshot
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-45062-7_5openalex-snapshot
On Modal Probability and Belief
inferred← citeshttps://doi.org/10.1007/978-3-540-85845-4_40openalex-snapshot
Shallow Models for Non-iterative Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_18openalex-snapshot
Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_12openalex-snapshot
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_16openalex-snapshot
Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles
inferred← citeshttps://doi.org/10.1007/978-3-642-18026-2_11openalex-snapshot
A Modal Logic for Multiple-Source Tolerance Approximation Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-24130-7_15openalex-snapshot
Logics of Belief over Weighted Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-28400-7_5openalex-snapshot
How to Do Social Simulation in Logic: Modelling the Segregation Game in a Dynamic Logic of Assignments
inferred← citeshttps://doi.org/10.1007/978-3-662-47197-5_4openalex-snapshot
Finite-Chain Graded Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-60292-8_12openalex-snapshot
Weakly Aggregative Modal Logic: Characterization and Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-662-66544-2_4openalex-snapshot
Granularity and Rational Approximation: Rethinking Graded Rough Sets
inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_3openalex-snapshot
Modal Logics for Representing Incoherent Knowledge
inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_14openalex-snapshot
Translating Graded Modalities into Predicate Logics
inferred← citeshttps://doi.org/10.1007/bf00173700openalex-snapshot
Eliminating “converse” from converse PDL
inferred← citeshttps://doi.org/10.1007/bf00370285openalex-snapshot
Graded modalities. III (the completeness and compactness of S40)
inferred← citeshttps://doi.org/10.1007/bf00374047openalex-snapshot
Graded modalities, II (canonical models)
inferred← citeshttps://doi.org/10.1007/bf00374048openalex-snapshot
Normal predicative logics with graded modalities
inferred← citeshttps://doi.org/10.1007/bf00935601openalex-snapshot
General canonical models for graded normal logics (graded modalities IV)
inferred← citeshttps://doi.org/10.1007/bf01051767openalex-snapshot
Generalized quantifiers and modal logic
inferred← citeshttps://doi.org/10.1007/bf01053022openalex-snapshot
Decidability by filtrations for graded normal logics (graded modalities V)
inferred← citeshttps://doi.org/10.1007/bfb0018447openalex-snapshot
Systems for knowledge and beliefs
inferred← citeshttps://doi.org/10.1007/bfb0023902openalex-snapshot
Graded modalities in epistemic logic
inferred← citeshttps://doi.org/10.1007/s10849-022-09366-xopenalex-snapshot
Model Theoretical Aspects of Weakly Aggregative Modal Logic
inferred← citeshttps://doi.org/10.1007/s11466-010-0017-2openalex-snapshot
Toward Model-Theoretic Modal Logics
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90026-xopenalex-snapshot
An essay in combinatory dynamic logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50025-4openalex-snapshot
Reasoning in Expressive Description Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102786openalex-snapshot
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
inferred← citeshttps://doi.org/10.1016/j.artint.2004.04.012openalex-snapshot
On the undecidability of logics with converse, nominals, recursion and counting
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.048openalex-snapshot
Introducing Polymodal Neighbourhood Logics
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.009openalex-snapshot
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
inferred← citeshttps://doi.org/10.1016/j.ijar.2011.10.003openalex-snapshot
Comparative study of variable precision rough set model and graded rough set model
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.06.011openalex-snapshot
Typology of axioms for a weighted modal logic
inferred← citeshttps://doi.org/10.1016/j.jal.2010.03.001openalex-snapshot
Complexity of modal logics with Presburger constraints
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80016-4openalex-snapshot
13 Description logic
inferred← citeshttps://doi.org/10.1017/s1755020319000285openalex-snapshot
DYNAMIC GRADED EPISTEMIC LOGIC
inferred← citeshttps://doi.org/10.1017/s1755020322000247openalex-snapshot
COUNTING TO INFINITY: GRADED MODAL LOGIC WITH AN INFINITY DIAMOND
inferred← citeshttps://doi.org/10.1023/a:1004956418185openalex-snapshot
Kripke Frame with Graded Accessibility and Fuzzy Possible World Semantics
inferred← citeshttps://doi.org/10.1023/a:1005245900406openalex-snapshot
A Note on Graded Modal Logic
inferred← citeshttps://doi.org/10.1080/01445340.2013.828517openalex-snapshot
Do We Need Mathematical Facts?
inferred← citeshttps://doi.org/10.1080/11663081.1997.10510916openalex-snapshot
Some considerations on the logics PFD A logic combining modality and probability
inferred← citeshttps://doi.org/10.1080/11663081.2024.2336385openalex-snapshot
A study of modal logic with semantics based on rough set theory
inferred← citeshttps://doi.org/10.1093/jigpal/1.1.69openalex-snapshot
Translation Methods for Non-Classical Logics: An Overview
inferred← citeshttps://doi.org/10.1109/cise.2009.5364945openalex-snapshot
Model of Logical Difference Operation of Grade Upper Approximation Operator and Variable Precision Lower Approximation Operator
inferred← citeshttps://doi.org/10.1109/conisoft63288.2024.00037openalex-snapshot
A Reasoning System for Graded Modal Logic
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5357752openalex-snapshot
Model of logical or operation of variable precision lower approximation operator and grade upper approximation operator
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5362798openalex-snapshot
Product Operation of Grade Upper Approximation Operator and Grade Lower Approximation Operator Based on Two Parameters
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5363547openalex-snapshot
Model of Logical Difference Operation of Grade Lower Approximation Operator and Variable Precision Upper Approximation Operator
inferred← citeshttps://doi.org/10.1109/lics.2002.1029843openalex-snapshot
Description logics: foundations for class-based knowledge representation
inferred← citeshttps://doi.org/10.1109/lics.2009.17openalex-snapshot
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
inferred← citeshttps://doi.org/10.1109/lics.2019.8785656openalex-snapshot
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?
inferred← citeshttps://doi.org/10.1109/nafips.2001.944362openalex-snapshot
On modal fuzzy approximate reasoning
inferred← citeshttps://doi.org/10.1145/1035167.1035183openalex-snapshot
Synthesis of underspecified composite e -services based on automated reasoning
inferred← citeshttps://doi.org/10.1145/1352582.1352590openalex-snapshot
Conjunctive query containment and answering under description logic constraints
inferred← citeshttps://doi.org/10.1145/275487.275504openalex-snapshot
On the decidability of query containment under constraints
inferred← citeshttps://doi.org/10.1145/3373718.3394787openalex-snapshot
Modal Logics with Composition on Finite Forests
inferred← citeshttps://doi.org/10.1145/3569954openalex-snapshot
On Composing Finite Forests with Modal Logics
inferred← citeshttps://doi.org/10.1145/3733832openalex-snapshot
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts
inferred← citeshttps://doi.org/10.1613/jair.334openalex-snapshot
A Uniform Framework for Concept Definitions in Description Logics
inferred← citeshttps://doi.org/10.2168/lmcs-7(1:5)2011openalex-snapshot
Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies
inferred← citeshttps://doi.org/10.22028/d291-26295openalex-snapshot
Incremental decision procedures for modal logics with nominals and eventualities
inferred← citeshttps://doi.org/10.2307/2275262openalex-snapshot
A quantitative analysis of modal logic
inferred← citeshttps://doi.org/10.25560/27689openalex-snapshot
Completeness-via-canonicity in coalgebraic logics
inferred← citeshttps://doi.org/10.25561/95334openalex-snapshot
The craft of model making: PSPACE bounds for non-iterative modal logics
inferred← citeshttps://doi.org/10.3166/jancl.16.311-347openalex-snapshot
Linear-time temporal logics with Presburger constraints: an overview ★
inferred← citeshttps://doi.org/10.3233/fun-2008-851-405openalex-snapshot
A Logic for Reasoning about Persuasion
inferred← citeshttps://doi.org/10.3390/axioms11070341openalex-snapshot
Graded Many-Valued Modal Logic and Its Graded Rough Truth
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1855openalex-snapshot
Strong Completeness of Coalgebraic Modal Logics
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0507067openalex-snapshot
Conjunctive Query Containment and Answering under Description Logics Constraints
inferred← citeshttps://doi.org/10.70675/0060a957z6f8ez44e2z9a5dze9b2f3193fcbopenalex-snapshot
Logiques de séparation : complexité, expressivité, calculs
inferred← citeshttps://doi.org/10.70675/0605d520z576dz478cz8617zf64c8d56e875openalex-snapshot
Extension pondérée des logiques modales dans le cadre des croyances graduelles
inferred← citeshttps://doi.org/10.70675/b09df5f2z3de1z4f5czab1dz82155f62a90bopenalex-snapshot
Non-normal modal logics : neighbourhood semantics and their calculi
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.