On the public citation graph
Query Answering in Normal Logic Programs Under Uncertainty
0 signed · 56 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-40006-0_4openalex-snapshot
Semi-qualitative Reasoning about Distances: A Preliminary Report
inferredcites →https://doi.org/10.1007/3-540-45402-0_25openalex-snapshot
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
inferredcites →https://doi.org/10.1007/3-540-45788-7_9openalex-snapshot
The Well-Founded Semantics in Normal Logic Programs with Uncertainty
inferredcites →https://doi.org/10.1007/3-540-54563-8openalex-snapshot
Methodologies for Intelligent Systems
inferredcites →https://doi.org/10.1007/3-540-54563-8_80openalex-snapshot
Stable model semantics for probabilistic deductive databases
inferredcites →https://doi.org/10.1007/3-540-57182-5openalex-snapshot
Mathematical Foundations of Computer Science 1993
inferredcites →https://doi.org/10.1007/978-3-540-30227-8_23openalex-snapshot
Sorted Multi-adjoint Logic Programs: Termination Results and Applications
inferredcites →https://doi.org/10.1007/978-3-540-45138-9_48openalex-snapshot
The Approximate Well-Founded Semantics for Logic Programs with Uncertainty
inferredcites →https://doi.org/10.1007/978-94-010-1161-7openalex-snapshot
Modern Uses of Multiple-Valued Logic
inferredcites →https://doi.org/10.1007/978-94-010-1161-7_2openalex-snapshot
A Useful Four-Valued Logic
inferredcites →https://doi.org/10.1007/978-94-017-1737-3openalex-snapshot
Handbook of Defeasible Reasoning and Uncertainty Management Systems
inferredcites →https://doi.org/10.1007/978-94-017-1739-7_8openalex-snapshot
A Survey of Paraconsistent Semantics for Logic Programs
inferredcites →https://doi.org/10.1007/b99679openalex-snapshot
Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004 : proceedings
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/0890-5401(92)90061-jopenalex-snapshot
Probabilistic logic programming
inferredcites →https://doi.org/10.1016/s0165-0114(01)00106-3openalex-snapshot
Fuzzy logic programming
inferredcites →https://doi.org/10.1016/s0304-3975(00)00330-3openalex-snapshot
Fixpoint semantics for logic programming a survey
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/69.940732openalex-snapshot
A parametric approach to deductive databases with uncertainty
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/227595.227597openalex-snapshot
Tabled evaluation with delaying for general logic programs
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-49493-7_6openalex-snapshot
From Fuzzy to Annotated Semantic Web Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-60042-0_1openalex-snapshot
Fuzzy Semantic Web Languages and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-72950-1_13openalex-snapshot
Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-73954-8_12openalex-snapshot
Connectionist Representation of Multi-Valued Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-75256-1_13openalex-snapshot
A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-85658-0_2openalex-snapshot
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-16289-3_4openalex-snapshot
A Practical Management of Fuzzy Truth-Degrees Using FLOPER
inferred← citeshttps://doi.org/10.1007/978-3-642-22546-8_14openalex-snapshot
Declarative Traces into Fuzzy Computed Answers
inferred← citeshttps://doi.org/10.1007/s00354-015-0201-yopenalex-snapshot
Fuzzy XPath through Fuzzy Logic Programming
inferred← citeshttps://doi.org/10.1007/s10472-008-9099-0openalex-snapshot
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
inferred← citeshttps://doi.org/10.1007/s10472-011-9256-8openalex-snapshot
Aggregated Fuzzy Answer Set Programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.071openalex-snapshot
Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.12.002openalex-snapshot
Fuzzy Logic Programming for Implementing a Flexible XPath-based Query Language
inferred← citeshttps://doi.org/10.1016/j.fss.2008.05.006openalex-snapshot
An improved reductant calculus using fuzzy partial evaluation techniques
inferred← citeshttps://doi.org/10.1016/j.fss.2008.07.002openalex-snapshot
Fuzzy matchmaking in e-marketplaces of peer entities using Datalog
inferred← citeshttps://doi.org/10.1016/j.fss.2012.01.016openalex-snapshot
A top-k query answering procedure for fuzzy logic programming
inferred← citeshttps://doi.org/10.1016/j.fss.2012.09.012openalex-snapshot
Fuzzy autoepistemic logic and its relation to fuzzy answer set programming
inferred← citeshttps://doi.org/10.1016/j.fss.2017.12.009openalex-snapshot
Syntax and semantics of multi-adjoint normal logic programming
inferred← citeshttps://doi.org/10.1016/j.ijar.2012.01.005openalex-snapshot
A core language for fuzzy answer set programming
inferred← citeshttps://doi.org/10.1016/j.ijar.2013.10.011openalex-snapshot
Complexity of fuzzy answer set programming under Łukasiewicz semantics
inferred← citeshttps://doi.org/10.1016/j.ins.2012.02.026openalex-snapshot
Top-k retrieval for ontology mediated access to relational databases
inferred← citeshttps://doi.org/10.1017/s1471068411000093openalex-snapshot
Reducing fuzzy answer set programming to model finding in fuzzy logics
inferred← citeshttps://doi.org/10.1080/00207160.2011.580842openalex-snapshot
On the existence and unicity of stable models in normal residuated logic programs
inferred← citeshttps://doi.org/10.1109/ruleml.2006.3openalex-snapshot
An Approach to Representing Uncertainty Rules in RuleML
inferred← citeshttps://doi.org/10.1109/ssci.2015.145openalex-snapshot
Designing Lattices of Truth Degrees for Fuzzy Logic Programming Environments
inferred← citeshttps://doi.org/10.1109/ssci.2017.8280961openalex-snapshot
Testing properties of fuzzy connectives and truth degrees with the latticemaker tool
inferred← citeshttps://doi.org/10.1142/9789812792358_0029openalex-snapshot
Fuzzy Description Logic Programs
inferred← citeshttps://doi.org/10.1142/s0218488509005759openalex-snapshot
DEFINITION AND ADAPTATION OF WEIGHTED FUZZY LOGIC PROGRAMS
inferred← citeshttps://doi.org/10.48550/arxiv.1104.5133openalex-snapshot
Reducing Fuzzy Answer Set Programming to Model Finding in Fuzzy Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1608.04688openalex-snapshot
Tuning Fuzzy Logic Programs with Symbolic Execution
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.