On the public citation graph

On the complexity of entailment in propositional multivalued logics

https://doi.org/10.1007/bf02136173
0 signed · 53 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-009-2448-2_4openalex-snapshot
Logic and the Complexity of Reasoning
inferredcites →https://doi.org/10.1007/978-94-010-1161-7_2openalex-snapshot
A Useful Four-Valued Logic
inferredcites →https://doi.org/10.1007/bf00244354openalex-snapshot
A decidable first-order logic for knowledge representation
inferredcites →https://doi.org/10.1007/bf00245460openalex-snapshot
A logic for reasoning with inconsistency
inferredcites →https://doi.org/10.1007/bf00297511openalex-snapshot
Logic and the complexity of reasoning
inferredcites →https://doi.org/10.1007/bf00558761openalex-snapshot
Impossible possible worlds vindicated
inferredcites →https://doi.org/10.1016/0004-3702(89)90036-2openalex-snapshot
A four-valued semantics for terminological logics
inferredcites →https://doi.org/10.1016/0004-3702(94)00060-3openalex-snapshot
A nonstandard approach to the logical omniscience problem
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1109/lics.1989.39180openalex-snapshot
RI: a logic for reasoning with inconsistency
inferredcites →https://doi.org/10.1111/j.1467-8640.1988.tb00280.xopenalex-snapshot
Multivalued logics: a uniform approach to reasoning in artificial intelligence
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

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-36127-8_3openalex-snapshot
Logics for Approximate Reasoning: Approximating Classical Logic “From Above”
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_28openalex-snapshot
Three-Valued Logics for Inconsistency Handling
inferred← citeshttps://doi.org/10.1007/978-0-387-35396-8_6openalex-snapshot
Algebra for Databases with Explicit Markings of Damaged Data
inferred← citeshttps://doi.org/10.1007/978-3-540-28645-5_2openalex-snapshot
Towards Polynomial Approximations of Full Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_44openalex-snapshot
Polynomial Approximations of Full Propositional Logic via Limited Bivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-30597-2_4openalex-snapshot
Representing Paraconsistent Reasoning via Quantified Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-30597-2_6openalex-snapshot
On the Complexity of Paraconsistent Inference Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-45062-7_43openalex-snapshot
Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-76719-0_10openalex-snapshot
Prime Implicates for Approximate Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-10488-6_7openalex-snapshot
An Anytime Algorithm for Computing Inconsistency Measurement
inferred← citeshttps://doi.org/10.1007/978-3-642-36008-4_8openalex-snapshot
Semantic Restrictions over Second-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-39091-3_33openalex-snapshot
Measuring Incompleteness under Multi-valued Semantics by Partial MaxSAT Solvers
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/s10601-012-9127-xopenalex-snapshot
A complexity perspective on entailment of parameterized linear constraints
inferred← citeshttps://doi.org/10.1007/s11225-012-9420-0openalex-snapshot
Three-valued Logics in Modal Logic
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00009-popenalex-snapshot
Tractable reasoning via approximation
inferred← citeshttps://doi.org/10.1016/j.artint.2015.10.004openalex-snapshot
Tractable approximate deduction for OWL
inferred← citeshttps://doi.org/10.1016/j.fss.2022.10.008openalex-snapshot
A first polynomial non-clausal class in many-valued logic
inferred← citeshttps://doi.org/10.1016/j.ijar.2022.11.002openalex-snapshot
The possibilistic horn non-clausal knowledge bases
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.007openalex-snapshot
The universe of propositional approximations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80847-8openalex-snapshot
The Universe of Approximations
inferred← citeshttps://doi.org/10.1023/a:1022992115613openalex-snapshot
Generalized Change and the Meaning of Rationality Postulates
inferred← citeshttps://doi.org/10.1023/a:1026088710874openalex-snapshot
Resource-Bounded Paraconsistent Inference
inferred← citeshttps://doi.org/10.1093/logcom/14.2.179openalex-snapshot
Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
inferred← citeshttps://doi.org/10.1093/logcom/exq053openalex-snapshot
Computing inconsistency measure based on paraconsistent semantics
inferred← citeshttps://doi.org/10.1109/dexa.2011.77openalex-snapshot
Some Observations on the Systems LFI1 and LFI1
inferred← citeshttps://doi.org/10.1109/ismvl.2001.924565openalex-snapshot
Tutorial: Complexity of many-valued logics
inferred← citeshttps://doi.org/10.1109/sbcci.2001.953003openalex-snapshot
An automated tool for analysis and design of MVL digital circuits
inferred← citeshttps://doi.org/10.1145/1243996.1244001openalex-snapshot
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
inferred← citeshttps://doi.org/10.1145/1807085.1807126openalex-snapshot
When data dependencies over SQL tables meet the logics of paradox and S-3
inferred← citeshttps://doi.org/10.1145/2188349.2188355openalex-snapshot
The implication problem of data dependencies over SQL table definitions
inferred← citeshttps://doi.org/10.24963/ijcai.2019/244openalex-snapshot
A Tractable, Expressive, and Eventually Complete First-Order Logic of Limited Belief
inferred← citeshttps://doi.org/10.24963/kr.2020/62openalex-snapshot
A First-Order Logic of Limited Belief Based on Possible Worlds
inferred← citeshttps://doi.org/10.3166/jancl.12.239-258openalex-snapshot
Approximate coherence-based reasoning
inferred← citeshttps://doi.org/10.3166/jancl.18.79-125openalex-snapshot
Autoreferential semantics for many-valued modal logics
inferred← citeshttps://doi.org/10.47749/t/unicamp.2001.213709openalex-snapshot
Uma ferramenta automatizada para analise e projeto de circuitos digitais multi-valores
inferred← citeshttps://doi.org/10.5555/882483.883895openalex-snapshot
An Automated Tool for Analysis and Design of MVL Digital Circuits
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.