On the public citation graph

A resolution calculus for modal logics

https://doi.org/10.1007/bfb0012852
0 signed · 113 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.1002/malq.19630090502openalex-snapshot
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
inferredcites →https://doi.org/10.1007/3-540-16780-3_100openalex-snapshot
What you always wanted to know about clause graph resolution
inferredcites →https://doi.org/10.1007/3-540-16780-3_89openalex-snapshot
Modal theorem proving
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_2openalex-snapshot
Resolution Modal Logics
inferredcites →https://doi.org/10.1007/978-94-017-2794-5openalex-snapshot
Proof Methods for Modal and Intuitionistic Logics
inferredcites →https://doi.org/10.1007/bf03037397openalex-snapshot
The Recursive Resolution method for Modal Logic
inferredcites →https://doi.org/10.1016/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321906.321919openalex-snapshot
A Proof Procedure Using Connection Graphs
inferredcites →https://doi.org/10.1305/ndjfl/1093894722openalex-snapshot
Tableau methods of proof for modal logics.
inferredcites →https://doi.org/10.22028/d291-39492openalex-snapshot
A Many-Sorted Calculus with Polymorphic Functions Based On Resolution And Paramodulation
inferredcites →https://doi.org/10.2307/2964568openalex-snapshot
A completeness theorem in modal logic

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119991472.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1006/inco.2000.2913openalex-snapshot
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
inferred← citeshttps://doi.org/10.1007/10722086_31openalex-snapshot
A Tableau-Like Representation Framework for Efficient Proof Reconstruction
inferred← citeshttps://doi.org/10.1007/11560647_10openalex-snapshot
An SLD-Resolution Calculus for Basic Serial Multimodal Logics
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-48168-0_20openalex-snapshot
Resolution Method for Modal Logic with Well-Founded Frames
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_2openalex-snapshot
Tractable Transformations from Modal Provability Logics into First-Order Logic
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-52885-7_91openalex-snapshot
Investigations into proof-search in a system of first-order dependent function types
inferred← citeshttps://doi.org/10.1007/3-540-54507-7_1openalex-snapshot
User-oriented theorem proving with the ATINF graphic proof editor
inferred← citeshttps://doi.org/10.1007/3-540-54535-2_34openalex-snapshot
Consistency driven planning
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_108openalex-snapshot
Amalgamated logic programming and non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-54712-6_218openalex-snapshot
Implementing exceptions in inheritance by concept transforming actions
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_179openalex-snapshot
Semantic entailment in non classical logics based on proofs found in classical logic
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_197openalex-snapshot
A many sorted logic with possibly empty sorts
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-58976-7_2openalex-snapshot
Temporal logic programming with metric and past operators
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_32openalex-snapshot
A connection based proof method for intuitionistic logic
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_10openalex-snapshot
Guiding program development systems by a connection based proof strategy
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_16openalex-snapshot
T-string unification: Unifying prefixes in non-classical proof methods
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-61511-3_104openalex-snapshot
Converting non-classical matrix proofs into sequent-style systems
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-61708-6_70openalex-snapshot
A uniform proof procedure for classical and non-classical logics
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_27openalex-snapshot
Deleting Redundancy in Proof Reconstruction
inferred← citeshttps://doi.org/10.1007/978-1-4020-3953-9_12openalex-snapshot
DESTRUCTIVE EXTENSION RULE IN PROPOSITION MODAL LOGIC K
inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_15openalex-snapshot
An Amalgamated Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-1-4613-1641-1_14openalex-snapshot
Automated Quantified Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_20openalex-snapshot
From Modal Sequent Calculi to Modal Resolution
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_9openalex-snapshot
From MKRP to ΩMEGA
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_15openalex-snapshot
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_4openalex-snapshot
Context Logic - An Introduction
inferred← citeshttps://doi.org/10.1007/978-4-431-66942-5_25openalex-snapshot
Implementing an Automated Reasoning System for Multi-Robot Cooperation
inferred← citeshttps://doi.org/10.1007/978-94-015-8533-0_3openalex-snapshot
Optimization of deduction for Multi-Modal Logics
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_8openalex-snapshot
Using Otter for Temporal Resolution
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/978-94-017-2798-3_15openalex-snapshot
From Classical to Normal Modal Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_2openalex-snapshot
Transfer of Sequent Calculus Strategies to Resolution for S4
inferred← citeshttps://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferred← citeshttps://doi.org/10.1007/bf00881845openalex-snapshot
Resolution theorem proving in reified modal logics
inferred← citeshttps://doi.org/10.1007/bf01058393openalex-snapshot
Identity in modal logic theorem proving
inferred← citeshttps://doi.org/10.1007/bf01880323openalex-snapshot
Automated reasoning and nonclassical logics: Introduction
inferred← citeshttps://doi.org/10.1007/bfb0012851openalex-snapshot
Linear modal deductions
inferred← citeshttps://doi.org/10.1007/bfb0013586openalex-snapshot
A rational agent as the kernel of a cooperative spoken dialogue system: Implementing a logical theory of interaction
inferred← citeshttps://doi.org/10.1007/bfb0014002openalex-snapshot
A graph-based approach to resolution in temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0014003openalex-snapshot
Annotation-based deduction in temporal logic
inferred← citeshttps://doi.org/10.1007/bfb0014004openalex-snapshot
An overview of temporal and modal logic programming
inferred← citeshttps://doi.org/10.1007/bfb0018445openalex-snapshot
A constraint logic approach to modal deduction
inferred← citeshttps://doi.org/10.1007/bfb0021971openalex-snapshot
Equality and constrained resolution
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/bfb0035973openalex-snapshot
Translation-based deduction methods for modal logics
inferred← citeshttps://doi.org/10.1007/bfb0052948openalex-snapshot
Default connections in a modal planning framework
inferred← citeshttps://doi.org/10.1007/bfb0054260openalex-snapshot
A resolution decision procedure for the guarded fragment
inferred← citeshttps://doi.org/10.1007/bfb0095045openalex-snapshot
A mechanisation of classical modal tense logics using isabelle
inferred← citeshttps://doi.org/10.1007/s10817-010-9167-0openalex-snapshot
Resolution with Order and Selection for Hybrid Logics
inferred← citeshttps://doi.org/10.1007/s10992-026-09845-7openalex-snapshot
The Niceness of the Ordered Fragment of First-Order Logic
inferred← citeshttps://doi.org/10.1016/0004-3702(95)90019-5openalex-snapshot
An epistemological science of common sense
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90290-vopenalex-snapshot
Multimodal logic programming using equational and order-sorted logic
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/b978-0-444-88771-9.50011-8openalex-snapshot
Logics with structured contexts
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50023-0openalex-snapshot
Encoding Two-Valued Nonclassical Logics in Classical Logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50024-2openalex-snapshot
Connections in Nonclassical Logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.10.002openalex-snapshot
Unsorted Functional Translations
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.02.003openalex-snapshot
Completeness of hyper-resolution via the semantics of disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.026openalex-snapshot
Multimodal logic programming
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00196-0openalex-snapshot
Clausal resolution in a logic of rational agency
inferred← citeshttps://doi.org/10.1016/s0168-0072(99)00032-9openalex-snapshot
Best solving modal equations
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00139-4openalex-snapshot
Programming in metric temporal logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00178-4openalex-snapshot
On the intuitionistic force of classical search
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80012-4openalex-snapshot
Unification theory
inferred← citeshttps://doi.org/10.1017/s1471068408003451openalex-snapshot
Checking the quality of clinical guidelines using automated reasoning tools
inferred← citeshttps://doi.org/10.1023/a:1005003904639openalex-snapshot
Natural Deduction for Non-Classical Logics
inferred← citeshttps://doi.org/10.1023/a:1006043519663openalex-snapshot
Decidability by Resolution for Propositional Modal Logics
inferred← citeshttps://doi.org/10.1023/a:1006155811656openalex-snapshot
Single Step Tableaux for Modal Logics
inferred← citeshttps://doi.org/10.1080/11663081.1993.10510808openalex-snapshot
Herbrand style proof procedures for modal logic
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.1093/jigpal/1.1.69openalex-snapshot
Translation Methods for Non-Classical Logics: An Overview
inferred← citeshttps://doi.org/10.1093/jigpal/4.1.109openalex-snapshot
Computer Support for the Development and Investigation of Logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzm059openalex-snapshot
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzp080openalex-snapshot
Multimodal and intuitionistic logics in simple type theory
inferred← citeshttps://doi.org/10.1093/jigpal/jzq008openalex-snapshot
Unification in modal and description logics
inferred← citeshttps://doi.org/10.1093/logcom/1.1.83openalex-snapshot
Destructive Modal Resolution
inferred← citeshttps://doi.org/10.1093/logcom/1.5.691openalex-snapshot
Semantics-Based Translation Methods for Modal Logics
inferred← citeshttps://doi.org/10.1093/logcom/11.5.657openalex-snapshot
Bringing them all Together
inferred← citeshttps://doi.org/10.1093/logcom/11.5.717openalex-snapshot
Resolution in Modal, Description and Hybrid Logic
inferred← citeshttps://doi.org/10.1093/logcom/2.3.247openalex-snapshot
Modal Theorem Proving: An Equational Viewpoint
inferred← citeshttps://doi.org/10.1093/logcom/7.6.685openalex-snapshot
Labelled propositional modal logics: theory and practice
inferred← citeshttps://doi.org/10.1093/logcom/8.3.345openalex-snapshot
Resolution for temporal logics of knowledge
inferred← citeshttps://doi.org/10.1109/time.2000.856598openalex-snapshot
Resolution for branching time temporal logics: applying the temporal resolution rule
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1995.tb00045.xopenalex-snapshot
AN EPISTEMIC LOGIC WITH QUANTIFICATION OVER NAMES
inferred← citeshttps://doi.org/10.1111/j.1467-9337.1990.tb00060.xopenalex-snapshot
Deontic Logic and Legal Knowledge Representation*
inferred← citeshttps://doi.org/10.1145/112646.112668openalex-snapshot
On the role of prototypes in appellate legal argument (abstract)
inferred← citeshttps://doi.org/10.1145/74014.74037openalex-snapshot
A language for legal Discourse I. basic features
inferred← citeshttps://doi.org/10.1527/tjsai.17.224openalex-snapshot
Multi-Agent Cooperative Reasoning Using E-knowledge and I-knowledge
inferred← citeshttps://doi.org/10.2478/v10143-011-0018-1openalex-snapshot
Identification of Relations between BDI Logic and BDI Agents
inferred← citeshttps://doi.org/10.2991/icmmct-17.2017.140openalex-snapshot
Combining Unification and Rewriting in Proofs for Modal Logics with First-order Undefinable Frames
inferred← citeshttps://doi.org/10.3166/jancl.19.167-181openalex-snapshot
Modal logic programming revisited
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0088openalex-snapshot
Connection-Based Theorem Proving in Classical and Non-Classical Logics
inferred← citeshttps://doi.org/10.3233/fun-2007-791-206openalex-snapshot
Foundations of Modal Deductive Databases
inferred← citeshttps://doi.org/10.4204/eptcs.226.18openalex-snapshot
Certification of Prefixed Tableau Proofs for Modal Logic
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.