On the public citation graph

A resolution decision procedure for the guarded fragment

https://doi.org/10.1007/bfb0054260
0 signed · 51 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.1007/3-540-52335-9_61openalex-snapshot
The resolution program, able to decide some solvable classes
inferredcites →https://doi.org/10.1007/3-540-56732-1openalex-snapshot
Resolution Methods for the Decision Problem
inferredcites →https://doi.org/10.1007/3-540-61511-3_75openalex-snapshot
SPASS & FLOTTER version 0.42
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/bf00244394openalex-snapshot
First-order modal tableaux
inferredcites →https://doi.org/10.1007/bf00881919openalex-snapshot
A note on assumptions about Skolem functions
inferredcites →https://doi.org/10.1007/bf01880326openalex-snapshot
TABLEAUX: A general theorem prover for modal logics
inferredcites →https://doi.org/10.1007/bfb0012851openalex-snapshot
Linear modal deductions
inferredcites →https://doi.org/10.1007/bfb0012852openalex-snapshot
A resolution calculus for modal logics
inferredcites →https://doi.org/10.1007/bfb0022263openalex-snapshot
Resolution games and non-liftable resolution orderings
inferredcites →https://doi.org/10.1016/0304-3975(89)90137-0openalex-snapshot
Modal resolution in clausal form
inferredcites →https://doi.org/10.1016/0743-1066(92)90028-2openalex-snapshot
Rewrite rule systems for modal propositional logic
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1023/a:1004275029985openalex-snapshot
Modal Languages and Bounded Fragments of Predicate Logic
inferredcites →https://doi.org/10.1093/logcom/1.1.83openalex-snapshot
Destructive Modal Resolution
inferredcites →https://doi.org/10.1109/lics.1994.316070openalex-snapshot
A non-elementary speed-up in proof length by structural clause form transformation
inferredcites →https://doi.org/10.1137/0206033openalex-snapshot
The Computational Complexity of Provability in Systems of Modal Propositional Logic
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321958.321960openalex-snapshot
Resolution Strategies as Decision Procedures
inferredcites →https://doi.org/10.2172/10129052openalex-snapshot
OTTER 3.0 reference manual and guide
inferredcites →https://doi.org/10.2307/2586808openalex-snapshot
On the Restraining Power of Guards
inferredcites →https://doi.org/10.3233/fi-1994-2044openalex-snapshot
ON SKOLEMIZATION AND PROOF COMPLEXITY

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10721959_34openalex-snapshot
A Resolution Decision Procedure for Fluted Logic
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_39openalex-snapshot
An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_39openalex-snapshot
Extraction of Proofs from the Clausal Normal Form Transformation
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-46508-1_13openalex-snapshot
Issues of Decidability for Description Logics in the Framework of Resolution
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_18openalex-snapshot
Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-48659-3_31openalex-snapshot
Tractable and Decidable Fragments of Conceptual Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_13openalex-snapshot
Prefixed Resolution: A Resolution Method for Modal and Description Logics
inferred← citeshttps://doi.org/10.1007/s10817-006-9028-zopenalex-snapshot
Some Techniques for Proving Termination of the Hyperresolution Calculus
inferred← citeshttps://doi.org/10.1007/s10849-005-5788-9openalex-snapshot
Deciding Regular Grammar Logics with Converse Through First-Order Logic
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/j.ic.2007.11.006openalex-snapshot
Deciding expressive description logics in the framework of resolution
inferred← citeshttps://doi.org/10.1016/j.jal.2007.07.008openalex-snapshot
Applying automated deduction to natural language understanding
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00013-0openalex-snapshot
Deciding the E+-class by an a posteriori, liftable order
inferred← citeshttps://doi.org/10.1016/s0747-7171(02)00092-5openalex-snapshot
Deciding the guarded fragments by resolution
inferred← citeshttps://doi.org/10.1023/a:1015067300005openalex-snapshot
Using Resolution for Testing Modal Satisfiability and Building Models
inferred← citeshttps://doi.org/10.1023/b:jlli.0000024731.26883.86openalex-snapshot
Computational Semantics in Discourse: Underspecification, Resolution, and Inference
inferred← citeshttps://doi.org/10.1023/b:jlli.0000024788.38738.bbopenalex-snapshot
Inference and Computational Semantics
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.265openalex-snapshot
Resolution-based methods for modal logics
inferred← citeshttps://doi.org/10.1093/logcom/11.6.933openalex-snapshot
The Complexity of Regularity in Grammar Logics and Related Modal Logics
inferred← citeshttps://doi.org/10.1145/3196959.3196989openalex-snapshot
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?
inferred← citeshttps://doi.org/10.1145/3696416openalex-snapshot
Rewriting the Infinite Chase for Guarded TGDs
inferred← citeshttps://doi.org/10.1162/089120103322145306openalex-snapshot
Implementing the Binding and Accommodation Theory for Anaphora Resolution and Presupposition Projection
inferred← citeshttps://doi.org/10.14778/3551793.3551851openalex-snapshot
Rewriting the infinite chase
inferred← citeshttps://doi.org/10.22028/d291-25703openalex-snapshot
Resolution-based decision procedures for subclasses of first-order logic
inferred← citeshttps://doi.org/10.22028/d291-25860openalex-snapshot
Saturation-based decision procedures for extensions of the guarded fragment
inferred← citeshttps://doi.org/10.33011/lilt.v9i.1315openalex-snapshot
Is there a place for logic in recognizing textual entailment?
inferred← citeshttps://doi.org/10.5445/ir/1000003797openalex-snapshot
Reasoning in description logics using resolution and deductive databases
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.