On the public citation graph

Compiling a default reasoning system into Prolog

0 signed · 79 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.1002/int.4550050506openalex-snapshot

A methodology for using a default and abductive reasoning system

inferredcites →https://doi.org/10.1007/3-540-16492-8_111openalex-snapshot

Negation and quantifiers in NU-Prolog

inferredcites →https://doi.org/10.1007/3-540-16492-8_112openalex-snapshot

Gracefully adding negation and disjunction to Prolog

inferredcites →https://doi.org/10.1007/3-540-52531-9_135openalex-snapshot

A prolog technology theorem prover: A new exposition and implementation in Prolog

inferredcites →https://doi.org/10.1007/978-1-4612-4792-0_13openalex-snapshot

Theorist: A Logical Reasoning System for Defaults and Diagnosis

inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot

Foundations of Logic Programming

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

A prolog technology theorem prover: Implementation by an extended prolog compiler

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

The occur-check problem in Prolog

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

A Prolog technology theorem prover

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

The semantics of induction and the possibility of complete systems of inductive inference

inferredcites →https://doi.org/10.1016/0004-3702(79)90008-0openalex-snapshot

A truth maintenance system

inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot

A logic for default reasoning

inferredcites →https://doi.org/10.1016/0004-3702(85)90028-1openalex-snapshot

Ordering conjunctive queries

inferredcites →https://doi.org/10.1016/0004-3702(86)90032-9openalex-snapshot

Applications of circumscription to formalizing common-sense knowledge

inferredcites →https://doi.org/10.1016/0004-3702(86)90080-9openalex-snapshot

An assumption-based TMS

inferredcites →https://doi.org/10.1016/0004-3702(88)90077-xopenalex-snapshot

A logical framework for default reasoning

inferredcites →https://doi.org/10.1016/0004-3702(89)90018-0openalex-snapshot

Eliminating the fixed predicates from a circumscription

inferredcites →https://doi.org/10.1016/0004-3702(89)90026-xopenalex-snapshot

A circumscriptive theorem prover

inferredcites →https://doi.org/10.1016/0004-3702(89)90067-2openalex-snapshot

An algorithm to compute circumscription

inferredcites →https://doi.org/10.1016/0743-1066(90)90052-7openalex-snapshot

Solving large combinatorial problems in logic programming

inferredcites →https://doi.org/10.1016/0888-613x(88)90156-9openalex-snapshot

Towards solving the multiple extension problem: Combining defaults and probabilities

inferredcites →https://doi.org/10.1016/b978-0-934613-32-3.50019-8openalex-snapshot

APPLYING THEORY FORMATION TO THE PLANNING PROBLEM

inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot

Symbolic Logic and Mechanical Theorem Proving

inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot

A Mathematical Introduction to Logic

inferredcites →https://doi.org/10.1016/c2009-0-27551-9openalex-snapshot

Logical Foundations of Artificial Intelligence

inferredcites →https://doi.org/10.1097/00005373-198707000-00035openalex-snapshot

ARTIFICIAL INTELLIGENCE

inferredcites →https://doi.org/10.1111/j.1467-8640.1989.tb00319.xopenalex-snapshot

Explanation and prediction: an architecture for default and abductive reasoning

inferredcites →https://doi.org/10.1145/359131.359136openalex-snapshot

Algorithm = logic + control

inferredcites →https://doi.org/10.1145/988346.988350openalex-snapshot

On eliminating loops in Prolog

inferredcites →https://doi.org/10.48550/arxiv.1304.2745openalex-snapshot

Towards Solving the Multiple Extension Problem: Combining Defaults and Probabilities

inferredcites →https://doi.org/10.7551/mitpress/1192.001.0001openalex-snapshot

Algorithmic Program Debugging

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11596370_7openalex-snapshot

Retracted: Shared Ontology for Pervasive Computing

inferred← citeshttps://doi.org/10.1007/3-540-45632-5_13openalex-snapshot

Automated Abduction

inferred← citeshttps://doi.org/10.1007/3-540-56454-3_13openalex-snapshot

The π-calculus as a theory in linear logic: Preliminary results

inferred← citeshttps://doi.org/10.1007/3-540-56454-3_2openalex-snapshot

A Correct goal-directed proof procedure for a general logic program with integrity constraints

inferred← citeshttps://doi.org/10.1007/3-540-57370-4_40openalex-snapshot

Inductive resolution

inferred← citeshttps://doi.org/10.1007/3-540-58402-1_2openalex-snapshot

Specifications using multiple-conclusion logic programs

inferred← citeshttps://doi.org/10.1007/3-540-60343-3_34openalex-snapshot

What is a skeptical proof?

inferred← citeshttps://doi.org/10.1007/3-540-60983-0_5openalex-snapshot

Efficient resource management for linear logic proof search

inferred← citeshttps://doi.org/10.1007/3-540-61313-7_101openalex-snapshot

Skeptical query-answering in Constrained Default Logic

inferred← citeshttps://doi.org/10.1007/3-540-61511-3_93openalex-snapshot

XRay: A prolog technology theorem prover for default reasoning: A system description

inferred← citeshttps://doi.org/10.1007/3-540-63255-7_34openalex-snapshot

An implementation platform for query-answering in default logics: The XRay system, its implementation and evaluation

inferred← citeshttps://doi.org/10.1007/3-7643-7361-x_10openalex-snapshot

The SOUPA Ontology for Pervasive Computing

inferred← citeshttps://doi.org/10.1007/978-3-540-75488-6_17openalex-snapshot

A Consequence Finding Approach for Full Clausal Abduction

inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_4openalex-snapshot

The Family of Default Logics

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

Default reasoning by deductive planning

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

Defaults as restrictions on classical Hilbert-style proofs

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

Modular specifications with supernormal defaults

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

Logic programming, abduction and probability

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

Incorporating top-down information into bottom-up hypothetical reasoning

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

Compositional model-theoretic semantics for logic programs

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

Processing abductive reasoning via Contextual Logic Programming

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

Probabilistic default logic based on irrelevance and relevance assumptions

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

Linear resolution for consequence finding

inferred← citeshttps://doi.org/10.1016/0004-3702(93)90004-uopenalex-snapshot

On prediction in theorist

inferred← citeshttps://doi.org/10.1016/0169-023x(94)90001-9openalex-snapshot

Explaining incompatibilities in data dictionary design through abduction

inferred← citeshttps://doi.org/10.1016/0893-9659(94)90104-xopenalex-snapshot

IDNAF prolog

inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00092-7openalex-snapshot

Prolog technology for default reasoning: proof theory and compilation techniques

inferred← citeshttps://doi.org/10.1016/s0096-0551(01)00020-0openalex-snapshot

LAILA: a language for coordinating abductive reasoning among logic agents

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)80755-4openalex-snapshot

A unifying view for logic programming with non-monotonic reasoning

inferred← citeshttps://doi.org/10.1016/s0957-4174(97)00066-3openalex-snapshot

Abduction, that ubiquitous form of reasoning

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80418-9openalex-snapshot

Forum as a Logic Programming Language: Preliminary Report

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

Normische Gesetzeshypothesen und die wissenschaftsphilosophische Bedeutung des nichtmonotonen Schliessens

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

A system for default reasoning in natural language

inferred← citeshttps://doi.org/10.1093/logcom/6.2.205openalex-snapshot

A proof theoretical approach to default reasoning I: tableaux for default logic

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

Intelligent Agents Meet Semantic Web in a Smart Meeting Room

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

Meta-reasoning: An incremental compilation approach

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

A Combined Approach for Information Flow Analysis in Fault Tolerant Hardware

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

Applying the connectionist inductive learning and logic programming system to power system diagnosis

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

Intelligent agents meet the semantic Web in smart spaces

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

Coordinating rule-based software processes with ESP

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

Analysis of Or-parallel execution models

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

Using a high level knowledge representation for expert systems knowledge acquisition and prototyping

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

Parallel execution of prolog programs

inferred← citeshttps://doi.org/10.13016/m2f18sk06openalex-snapshot

A Context Broker for Building Smart Meeting Rooms

inferred← citeshttps://doi.org/10.17771/pucrio.acad.48679openalex-snapshot

DISCOVERY, CONFORMANCE AND ENHANCEMENT OF EDUCATIONAL PROCESSES VIA TYPICAL PLANS

inferred← citeshttps://doi.org/10.21236/ada439472openalex-snapshot

A Context Broker for Building Smart Meeting Rooms

inferred← citeshttps://doi.org/10.21236/ada439732openalex-snapshot

Intelligent Agents Meet Semantic Web in a Smart Meeting Room

inferred← citeshttps://doi.org/10.48550/arxiv.1304.2370openalex-snapshot

Probabilistic Semantics and Defaults

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.