On the public citation graph
Query processing in annotated logic programming: Theory and implementation
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-50171-1_6openalex-snapshot
On the semantics of rule-based expert systems with uncertainty
inferredcites →https://doi.org/10.1007/3-540-52885-7_119openalex-snapshot
A science of reasoning: Extended abstract
inferredcites →https://doi.org/10.1007/3-540-56804-2_26openalex-snapshot
Signed formulas: A liftable meta-logic for multiple-valued logics
inferredcites →https://doi.org/10.1007/3-540-58402-1_17openalex-snapshot
Annotated constraint logic programming applied to temporal reasoning
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00245460openalex-snapshot
A logic for reasoning with inconsistency
inferredcites →https://doi.org/10.1007/bf00881836openalex-snapshot
A semantical framework for supporting subjective and conditional probabilities in deductive databases
inferredcites →https://doi.org/10.1007/bf00881864openalex-snapshot
Fuzzy operator logic and fuzzy resolution
inferredcites →https://doi.org/10.1007/bf01530821openalex-snapshot
Near-Horn Prolog and the ancestry family of procedures
inferredcites →https://doi.org/10.1016/0004-3702(93)90033-8openalex-snapshot
A theory of nonmonotonic inheritance based on annotated logic
inferredcites →https://doi.org/10.1016/0020-0190(92)90053-xopenalex-snapshot
The completeness of gp-resolution for annotated logics
inferredcites →https://doi.org/10.1016/0165-0114(87)90110-2openalex-snapshot
Evidential support logic programming
inferredcites →https://doi.org/10.1016/0304-3975(89)90126-6openalex-snapshot
Paraconsistent logic programming
inferredcites →https://doi.org/10.1016/0304-3975(92)90214-zopenalex-snapshot
Paraconsistent disjunctive deductive databases
inferredcites →https://doi.org/10.1016/0743-1066(91)90014-gopenalex-snapshot
Bilattices and the semantics of logic programming
inferredcites →https://doi.org/10.1016/0743-1066(92)90007-popenalex-snapshot
Theory of generalized annotated logic programming and its applications**A preliminary report on this research has appeared in [34].
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1109/2.121508openalex-snapshot
Mediators in the architecture of future information systems
inferredcites →https://doi.org/10.1109/ismvl.1991.130736openalex-snapshot
Uniform notation of tableau rules for multiple-valued logics
inferredcites →https://doi.org/10.1109/ismvl.1993.289582openalex-snapshot
Signed formulas and annotated logics
inferredcites →https://doi.org/10.1109/lics.1989.39180openalex-snapshot
RI: a logic for reasoning with inconsistency
inferredcites →https://doi.org/10.1109/tfuzz.1993.6027269openalex-snapshot
Fuzzy models—What are they, and why? [Editorial]
inferredcites →https://doi.org/10.1142/s0218215794000193openalex-snapshot
AMALGAMATING KNOWLEDGE BASES II: DISTRIBUTED MEDIATORS
inferredcites →https://doi.org/10.1145/129393.129398openalex-snapshot
The CLP( ℛ ) language and system
inferredcites →https://doi.org/10.1145/321694.321706openalex-snapshot
A Unifying View of Some Linear Herbrand Procedures
inferredcites →https://doi.org/10.1145/59287.59293openalex-snapshot
Efficient implementation of lattice operations
inferredcites →https://doi.org/10.1145/79204.79209openalex-snapshot
Constraint logic programming languages
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10703163_28openalex-snapshot
Many-Valued First-Order Logics with Probabilistic Semantics
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_12openalex-snapshot
A Foundation for Hybrid Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-540-24627-5_18openalex-snapshot
Challenges in Fixpoint Computation with Multisets
inferred← citeshttps://doi.org/10.1007/978-3-540-30557-6_7openalex-snapshot
Towards a More Practical Hybrid Probabilistic Logic Programming Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-89985-3_7openalex-snapshot
Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-642-18690-5_2openalex-snapshot
Query Answering in Inconsistent Databases
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_3openalex-snapshot
The SAT Problem of Signed CNF Formulas
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_5openalex-snapshot
Advanced Many-Valued Logics
inferred← citeshttps://doi.org/10.1007/bf03037532openalex-snapshot
Facts, arguments, annotations and reasoning
inferred← citeshttps://doi.org/10.1007/s10472-007-9048-3openalex-snapshot
A new approach to hybrid probabilistic logic programs
inferred← citeshttps://doi.org/10.1016/s0016-0032(01)00022-9openalex-snapshot
℧-resolution and hybrid knowledge bases
inferred← citeshttps://doi.org/10.1017/s1471068403001832openalex-snapshot
Answer sets for consistent query answering in inconsistent databases
inferred← citeshttps://doi.org/10.1023/a:1005784309139openalex-snapshot
A Framework for Automated Reasoning in Multiple-Valued Logics
inferred← citeshttps://doi.org/10.1023/a:1008268003741openalex-snapshot
Annotated Logic Applications for Imperfect Information
inferred← citeshttps://doi.org/10.1109/69.940732openalex-snapshot
A parametric approach to deductive databases with uncertainty
inferred← citeshttps://doi.org/10.1109/ismvl.1999.779724openalex-snapshot
Transformations between signed and classical clause logic
inferred← citeshttps://doi.org/10.1145/377978.377983openalex-snapshot
Probabilistic logic programming with conditional constraints
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.