On the public citation graph
First-order modal tableaux
0 signed · 89 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19630090502openalex-snapshot
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
inferredcites →https://doi.org/10.1007/978-3-0346-0145-0_16openalex-snapshot
Semantical Considerations on Modal Logic
inferredcites →https://doi.org/10.1007/978-94-017-2794-5openalex-snapshot
Proof Methods for Modal and Intuitionistic Logics
inferredcites →https://doi.org/10.1016/0304-3975(84)90047-1openalex-snapshot
A decidable fragment of predicate calculus
inferredcites →https://doi.org/10.1016/b978-0-934613-04-0.50026-0openalex-snapshot
A RESOLUTION METHOD FOR QUANTIFIED MODAL LOGICS OF KNOWLEDGE AND BELIEF
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1305/ndjfl/1093894722openalex-snapshot
Tableau methods of proof for modal logics.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2850openalex-snapshot
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)
inferred← citeshttps://doi.org/10.1007/10722086_16openalex-snapshot
Variants of First-Order Modal Logics
inferred← citeshttps://doi.org/10.1007/10722086_17openalex-snapshot
Complexity of Simple Dependent Bimodal Logics
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_11openalex-snapshot
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation
inferred← citeshttps://doi.org/10.1007/3-540-45758-5_3openalex-snapshot
Analytic Tableaux and Database Repairs: Foundations
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_10openalex-snapshot
An $$ \mathcal{O} $$ ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-48050-1_32openalex-snapshot
Inference for Annotated Logics over Distributive Lattices
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_11openalex-snapshot
℧-Resolution: An Inference Rule for Regular Multiple-Valued Logics
inferred← citeshttps://doi.org/10.1007/3-540-52335-9_55openalex-snapshot
Gentzen-type systems and resolution rules part I propositional logic
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_188openalex-snapshot
An improved method for adding equality to free variable semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_26openalex-snapshot
Signed formulas: A liftable meta-logic for multiple-valued logics
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_57openalex-snapshot
Generic resolution in propositional modal systems
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_52openalex-snapshot
Strongly analytic tableaux for normal modal logics
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_44openalex-snapshot
Propositional logics on the computer
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_12openalex-snapshot
A simple tableau system for the logic of elsewhere
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_19openalex-snapshot
On the intuitionistic force of classical search (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-61313-7_80openalex-snapshot
Labelling ideality and subideality
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_45openalex-snapshot
On the modal logic K plus theories
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_115openalex-snapshot
Building decision procedures for modal logics from propositional decision procedures — The case study of modal K
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_66openalex-snapshot
Proof-terms for classical and intuitionistic resolution
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_5openalex-snapshot
Labelled proofs for quantified modal logic
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_69openalex-snapshot
Reasoning with preorders and dynamic sorts using free variable tableaux
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_52openalex-snapshot
The undecidability of simultaneous rigid E-unification with two variables
inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_29openalex-snapshot
Concept: a Language for Conceptual Modelling
inferred← citeshttps://doi.org/10.1007/978-1-4471-1488-8_2openalex-snapshot
Towards a Computational Treatment of Deontic Defeasibility
inferred← citeshttps://doi.org/10.1007/978-1-4613-1641-1_14openalex-snapshot
Automated Quantified Modal Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_5openalex-snapshot
Tableaux for Intuitionistic Logics
inferred← citeshttps://doi.org/10.1007/bf00245460openalex-snapshot
A logic for reasoning with inconsistency
inferred← citeshttps://doi.org/10.1007/bf00881845openalex-snapshot
Resolution theorem proving in reified modal logics
inferred← citeshttps://doi.org/10.1007/bf00881956openalex-snapshot
The liberalized ?-rule in free variable semantic tableaux
inferred← citeshttps://doi.org/10.1007/bf01057938openalex-snapshot
Cut-free sequent and tableau systems for propositional Diodorean modal logics
inferred← citeshttps://doi.org/10.1007/bf01384237openalex-snapshot
Accelerating tableaux proofs using compact representations
inferred← citeshttps://doi.org/10.1007/bfb0014310openalex-snapshot
Free variable tableaux for a many sorted logic with preorders
inferred← citeshttps://doi.org/10.1007/bfb0021972openalex-snapshot
Efficient strategies for Automated reasoning in modal logics
inferred← citeshttps://doi.org/10.1007/bfb0022559openalex-snapshot
The even more liberalized δ-rule in free variable Semantic Tableaux
inferred← citeshttps://doi.org/10.1007/bfb0027401openalex-snapshot
MGTP: A model generation theorem prover — Its advanced features and applications —
inferred← citeshttps://doi.org/10.1007/bfb0027410openalex-snapshot
Hintikka multiplicities in matrix decision methods for some propositional modal logics
inferred← citeshttps://doi.org/10.1007/bfb0034796openalex-snapshot
Belief increasing in SKL model frames
inferred← citeshttps://doi.org/10.1007/bfb0052370openalex-snapshot
The decidability of simultaneous rigid E-unification with one variable
inferred← citeshttps://doi.org/10.1007/bfb0054260openalex-snapshot
A resolution decision procedure for the guarded fragment
inferred← citeshttps://doi.org/10.1007/bfb0055856openalex-snapshot
A flexible method for information system security policy specification
inferred← citeshttps://doi.org/10.1007/s002000050001openalex-snapshot
Special Cases and Substitutes for Rigid E -Unification
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90085-xopenalex-snapshot
A tableau-like proof procedure for normal modal logics
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00092-8openalex-snapshot
The undecidability of simultaneous rigid E-unification
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00185-6openalex-snapshot
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00178-4openalex-snapshot
On the intuitionistic force of classical search
inferred← citeshttps://doi.org/10.1023/a:1005784309139openalex-snapshot
A Framework for Automated Reasoning in Multiple-Valued Logics
inferred← citeshttps://doi.org/10.1023/a:1006155811656openalex-snapshot
Single Step Tableaux for Modal Logics
inferred← citeshttps://doi.org/10.1023/a:1013838528631openalex-snapshot
Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics
inferred← citeshttps://doi.org/10.1023/a:1026153912205openalex-snapshot
Database Repairs and Analytic Tableaux
inferred← citeshttps://doi.org/10.1080/00207169208804127openalex-snapshot
Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510844openalex-snapshot
Uniform and non uniform strategies for tableaux calculi for modal logics
inferred← citeshttps://doi.org/10.1109/cmpass.1991.161052openalex-snapshot
Specifying and verifying real-time systems using time Petri nets and real-time temporal logic
inferred← citeshttps://doi.org/10.1109/isads.2001.917448openalex-snapshot
Formal analysis of software security system architectures
inferred← citeshttps://doi.org/10.1109/ismvl.1991.130735openalex-snapshot
Improving tableau deductions in multiple-valued logics
inferred← citeshttps://doi.org/10.1109/lics.1989.39180openalex-snapshot
RI: a logic for reasoning with inconsistency
inferred← citeshttps://doi.org/10.1109/lics.1996.561466openalex-snapshot
Simultaneous rigid E-unification and related algorithmic problems
inferred← citeshttps://doi.org/10.1109/lics.1996.561467openalex-snapshot
Decidability problems for the prenex fragment of intuitionistic logic
inferred← citeshttps://doi.org/10.1109/saci.2018.8441020openalex-snapshot
K Modal Logic Approach to Maze Solving
inferred← citeshttps://doi.org/10.1109/tkde.2003.1232267openalex-snapshot
An approach for modeling and analysis of security system architectures
inferred← citeshttps://doi.org/10.1145/1047788.1047827openalex-snapshot
Specifying and reasoning with institutional agents
inferred← citeshttps://doi.org/10.1145/1216262.1216287openalex-snapshot
A constraint-based decision procedure for the description logic ALCN
inferred← citeshttps://doi.org/10.1145/96877.96894openalex-snapshot
Reexamining intractability of tableau methods
inferred← citeshttps://doi.org/10.2307/2275431openalex-snapshot
Contraction-free sequent calculi for intuitionistic logic
inferred← citeshttps://doi.org/10.26180/4546354openalex-snapshot
Translational embeddings in modal logic
inferred← citeshttps://doi.org/10.3166/rig.2016.00007openalex-snapshot
Raisonner en logique modale sur l’incertitude liée aux données
inferred← citeshttps://doi.org/10.3233/fi-1994-2135openalex-snapshot
ADAPTING CLASSICAL INFERENCE TECHNIQUES TO MULTIPLE-VALUED LOGICS USING SIGNED FORMULAS
inferred← citeshttps://doi.org/10.3233/fi-2000-423401openalex-snapshot
The Nondeterministic Information Logic NIL is PSPACE-complete
inferred← citeshttps://doi.org/10.3233/fi-2019-1804openalex-snapshot
Satisfiability Calculus: An Abstract Formulation of Semantic Proof Systems
inferred← citeshttps://doi.org/10.70675/b4c0626bz63d7z4842z82d1zb1c33f09cec0openalex-snapshot
Pour une cohérence du résultat d'un opérateur dans un contexte spatial, temporel et alphanumérique
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.