On the public citation graph

Optimising propositional modal satisfiability for description logic subsumption

https://doi.org/10.1007/bfb0055916
0 signed · 31 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/10721959_23openalex-snapshot
System Description: DLP
inferredcites →https://doi.org/10.1007/3-540-61708-6_74openalex-snapshot
A concept language extended with different kinds of transitive roles
inferredcites →https://doi.org/10.1007/3-540-69778-0_4openalex-snapshot
Comparison of Theorem Provers for Modal Logics — Introduction and Summary
inferredcites →https://doi.org/10.1007/bf00244513openalex-snapshot
HARP: A tableau-based theorem prover
inferredcites →https://doi.org/10.1007/bf03037414openalex-snapshot
A knowledge representation and inference system for procedural law
inferredcites →https://doi.org/10.1016/0004-3702(95)00051-8openalex-snapshot
Hard random 3-SAT problems and the Davis-Putnam procedure
inferredcites →https://doi.org/10.1023/a:1006249507577openalex-snapshot
A Benchmark Method for the Propositional Modal Logics K, KT, S4
inferredcites →https://doi.org/10.1145/122296.122298openalex-snapshot
KRIS
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.22028/d291-24994openalex-snapshot
An empirical analysis of optimization techniques for terminological representation systems : or: 'Making KRIS get a move on'

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722086_8openalex-snapshot
TANCS-2000 Results for DLP
inferred← citeshttps://doi.org/10.1007/11554554_25openalex-snapshot
LoTREC: Logical Tableaux Research Engineering Companion
inferred← citeshttps://doi.org/10.1007/11611257_27openalex-snapshot
The Knowledge Cartography – A New Approach to Reasoning over Description Logics Ontologies
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_29openalex-snapshot
Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/3-540-39967-4_1openalex-snapshot
OIL in a Nutshell
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
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/3-540-48754-9_3openalex-snapshot
DLP and FaCT
inferred← citeshttps://doi.org/10.1007/978-3-540-24581-0_7openalex-snapshot
Representing the Spatial Relations in the Semantic Web Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_18openalex-snapshot
The Tableaux Work Bench
inferred← citeshttps://doi.org/10.1007/978-3-540-74615-7_2openalex-snapshot
Reasoning in Description Logics: Basics, Extensions, and Relatives
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_5openalex-snapshot
One-Pass Tableaux for Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-92719-8_24openalex-snapshot
E-Business Process Modelling with Finite State Machine Based Service Agents
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_5openalex-snapshot
Global Caching for Coalgebraic Description Logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.029openalex-snapshot
The Tableau Workbench
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03003-9openalex-snapshot
Chapter 3 Description Logics
inferred← citeshttps://doi.org/10.1023/a:1015019416843openalex-snapshot
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
inferred← citeshttps://doi.org/10.1023/a:1015063215934openalex-snapshot
Evaluating Optimized Decision Procedures for Propositional Modal K (m) Satisfiability
inferred← citeshttps://doi.org/10.1093/logcom/9.3.385openalex-snapshot
A description logic with transitive and inverse roles and role hierarchies
inferred← citeshttps://doi.org/10.1109/5254.920598openalex-snapshot
OIL: an ontology infrastructure for the Semantic Web
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
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.