On the public citation graph

Question-asking strategies for Horn clause systems

https://doi.org/10.1007/bf01531084
0 signed · 25 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/bf01531077openalex-snapshot
Solving propositional satisfiability problems
inferredcites →https://doi.org/10.1016/0004-3702(85)90067-0openalex-snapshot
Rule-based expert systems: The mycin experiments of the stanford heuristic programming project
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-934613-03-3.50028-3openalex-snapshot
MODEL DESIGN IN THE PROSPECTOR CONSULTANT SYSTEM FOR MINERAL EXPLORATION**This work was supported in part by the Office of Resource Analysis of the U.S. Geological Survey under Contract No. 14-08-0001-15985, and in part by the Nonrenewable Resources Section of the National Science Foundation under…
inferredcites →https://doi.org/10.1016/s0736-5853(86)80073-9openalex-snapshot
Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/42282.42285openalex-snapshot
Efficient tests for top-down termination of logical rules
inferredcites →https://doi.org/10.1287/ijoc.1.1.7openalex-snapshot
Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
inferredcites →https://doi.org/10.1515/zwf-1986-811227openalex-snapshot
Building Expert Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01531068openalex-snapshot
Polynomial-time inference of all valid implications for Horn and related formulae
inferred← citeshttps://doi.org/10.1007/bf02127975openalex-snapshot
A cost effective question-asking strategy for Horn clause systems
inferred← citeshttps://doi.org/10.1007/s10472-005-1809-2openalex-snapshot
A cost-reducing question-selection algorithm for propositional knowledge-based systems
inferred← citeshttps://doi.org/10.1007/s10479-008-0328-zopenalex-snapshot
Computer science and decision theory
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90033-7openalex-snapshot
Recognition of q-Horn formulae in linear time
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90095-zopenalex-snapshot
Deriving conclusions in expert systems when knowledge is incomplete
inferred← citeshttps://doi.org/10.1016/0888-613x(94)90028-0openalex-snapshot
Identifying key missing data for inference under uncertainty
inferred← citeshttps://doi.org/10.1016/0895-7177(94)00164-2openalex-snapshot
The problem of asking the minimum number of questions in horn clause systems
inferred← citeshttps://doi.org/10.1016/j.dam.2002.08.001openalex-snapshot
Sequential testing of complex systems: a review
inferred← citeshttps://doi.org/10.1016/s0950-7051(96)00007-xopenalex-snapshot
An analysis on the inference guiding strategies—The benefits and costs
inferred← citeshttps://doi.org/10.1023/a:1018984712480openalex-snapshot
Inference guiding in propositional knowledge bases
inferred← citeshttps://doi.org/10.1023/a:1020521718123openalex-snapshot
Mathematical Programming Embeddings of Logic
inferred← citeshttps://doi.org/10.1090/dimacs/075/10openalex-snapshot
Greedy algorithms in economic epidemiology
inferred← citeshttps://doi.org/10.1145/143559.143681openalex-snapshot
A cost effective question asking strategy
inferred← citeshttps://doi.org/10.58729/1941-6679.1134openalex-snapshot
Inference-Guiding on Bayesian Knowledge-Based Systems
inferred← citeshttps://doi.org/10.58729/1941-6679.1147openalex-snapshot
Inference-Guiding for Intelligent Agents
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.