On the public citation graph

A decidable first-order logic for knowledge representation

0 signed · 42 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/978-94-010-1161-7_2openalex-snapshot

A Useful Four-Valued Logic

inferredcites →https://doi.org/10.1007/bf00373152openalex-snapshot

Intuitive semantics for first-degree entailments and ?coupled trees?

inferredcites →https://doi.org/10.1007/bf01471125openalex-snapshot

First degree entailments

inferredcites →https://doi.org/10.1007/bfb0000065openalex-snapshot

Knowledge retrieval as limited inference

inferredcites →https://doi.org/10.1016/0004-3702(88)90031-8openalex-snapshot

A model for belief revision

inferredcites →https://doi.org/10.1016/s0364-0213(78)80049-4openalex-snapshot

Tarskian Semantics, or No Notation Without Denotation!

inferredcites →https://doi.org/10.1109/mc.1983.1654200openalex-snapshot

Krypton: A Functional Approach to Knowledge Representation

inferredcites →https://doi.org/10.1111/j.1467-8640.1987.tb00175.xopenalex-snapshot

A hybrid, decidable, logic‐based knowledge representation system1

inferredcites →https://doi.org/10.1111/j.1467-8640.1987.tb00176.xopenalex-snapshot

Expressiveness and tractability in knowledge representation and reasoning1

inferredcites →https://doi.org/10.2307/2219366openalex-snapshot

Entailment. The Logic of Relevance and Necessity. Volume I.

inferredcites →https://doi.org/10.2307/2274261openalex-snapshot

The undecidability of entailment and relevant implication

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-58495-1_30openalex-snapshot

Building bridges between knowledge representation and algebraic specification

inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_3openalex-snapshot

Two Approaches to Efficient Open-World Reasoning

inferred← citeshttps://doi.org/10.1007/978-3-7908-1769-0_9openalex-snapshot

Complexity of Many-valued Logics

inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_5openalex-snapshot

Advanced Many-Valued Logics

inferred← citeshttps://doi.org/10.1007/bf01530940openalex-snapshot

On rules of abduction

inferred← citeshttps://doi.org/10.1007/bf02136173openalex-snapshot

On the complexity of entailment in propositional multivalued logics

inferred← citeshttps://doi.org/10.1007/bf02136174openalex-snapshot

The complexity of minimum partial truth assignments and implication in negation-free formulae

inferred← citeshttps://doi.org/10.1016/0004-3702(89)90036-2openalex-snapshot

A four-valued semantics for terminological logics

inferred← citeshttps://doi.org/10.1016/0004-3702(94)00009-popenalex-snapshot

Tractable reasoning via approximation

inferred← citeshttps://doi.org/10.1016/0306-4379(90)90013-fopenalex-snapshot

Practical, object-based knowledge representation for knowledge-based systems

inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50024-8openalex-snapshot

AN ESSENTIAL HYBRID REASONING SYSTEM: KNOWLEDGE AND SYMBOL LEVEL ACCOUNTS OF KRYPTON

inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50050-9openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/b978-1-4832-0771-1.50017-5openalex-snapshot

ALL

inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102434openalex-snapshot

A propositional encoding for first-order clausal entailment over infinitely many constants

inferred← citeshttps://doi.org/10.1023/a:1007629922420openalex-snapshot

Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic Matching

inferred← citeshttps://doi.org/10.1080/08839518808949905openalex-snapshot

A LOGIC PROGRAMMING APPROACH TO HYBRID KNOWLEDGE REPRESENTATION

inferred← citeshttps://doi.org/10.1080/11663081.1992.10510784openalex-snapshot

A comment on relevant truth table logic

inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot

Automated Deduction in Multiple-valued Logics

inferred← citeshttps://doi.org/10.1109/69.204090openalex-snapshot

Reliability measure theory: a nonmonotonic semantics

inferred← citeshttps://doi.org/10.1109/cisis.2011.26openalex-snapshot

Insertion of Probabilistic Knowledge into BDI Agents Construction Modeled in Bayesian Networks

inferred← citeshttps://doi.org/10.1109/hicss.1988.11827openalex-snapshot

An approach to practical object-based knowledge representation systems

inferred← citeshttps://doi.org/10.1109/ismvl.2001.924565openalex-snapshot

Tutorial: Complexity of many-valued logics

inferred← citeshttps://doi.org/10.1109/tai.1991.167091openalex-snapshot

MANTRA: a shell for hybrid knowledge representation

inferred← citeshttps://doi.org/10.1111/j.1467-8640.1987.tb00175.xopenalex-snapshot

A hybrid, decidable, logic‐based knowledge representation system1

inferred← citeshttps://doi.org/10.1111/j.1467-8640.1987.tb00176.xopenalex-snapshot

Expressiveness and tractability in knowledge representation and reasoning1

inferred← citeshttps://doi.org/10.1111/j.1467-8640.1994.tb00162.xopenalex-snapshot

REASONING WITH BACKGROUND KNOWLEDGE–A THREE‐LEVEL THEORY

inferred← citeshttps://doi.org/10.1145/122296.122302openalex-snapshot

Algernon—a tractable system for knowledge-representation

inferred← citeshttps://doi.org/10.24963/ijcai.2018/245openalex-snapshot

The Complexity of Limited Belief Reasoning—The Quantifier-Free Case

inferred← citeshttps://doi.org/10.24963/kr.2022/35openalex-snapshot

A Minimal Deductive System for RDFS with Negative Statements

inferred← citeshttps://doi.org/10.3233/fi-1994-21126openalex-snapshot

APPROXIMATE INFERENCE IN DEFAULT LOGIC AND CIRCUMSCRIPTION

inferred← citeshttps://doi.org/10.7939/r32g9qopenalex-snapshot

A framework for semantically verifying schema mappings for data exchange

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.