On the public citation graph

The occur-check problem in Prolog

https://doi.org/10.1007/bf03037324
0 signed · 62 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-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.

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-15199-0_18openalex-snapshot
A PROLOG environment for developing and reasoning about data types
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_7openalex-snapshot
PROLOG-based inductive theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_25openalex-snapshot
An application of abstract interpretation of logic programs: Occur check reduction
inferred← citeshttps://doi.org/10.1007/3-540-16492-8_95openalex-snapshot
Abstract interpretation of Prolog programs
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_122openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferred← citeshttps://doi.org/10.1007/3-540-18203-9_5openalex-snapshot
Parallel inference machines
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_152openalex-snapshot
Semantics for logic programs without occur check
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_37openalex-snapshot
Optimization aspects of logical formulas
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_39openalex-snapshot
Combinatory forms for equational programming: Instances, unification and narrowing
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_136openalex-snapshot
A prolog technology theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_78openalex-snapshot
Partheo: A high-performance parallel theorem prover
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_1openalex-snapshot
Potentiality of parallelism in logic
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_128openalex-snapshot
Why the occur-check is not a problem
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_40openalex-snapshot
A comparison of three occur-check analysers
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_10openalex-snapshot
Set-Sharing Is Not Always Redundant for Pair-Sharing
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_17openalex-snapshot
Übersetzung logischer Programmiersprachen
inferred← citeshttps://doi.org/10.1007/978-3-642-75182-0_51openalex-snapshot
P A R T H E O: A Parallel Inference Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-87954-8_10openalex-snapshot
PROLOG — Logik-orientierte Programmierung (3)
inferred← citeshttps://doi.org/10.1007/978-3-662-40145-3_3openalex-snapshot
An Introduction to Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot
Theoretical Issues of Logic Programming
inferred← citeshttps://doi.org/10.1007/bf00244282openalex-snapshot
SETHEO: A high-performance theorem prover
inferred← citeshttps://doi.org/10.1007/bf00244944openalex-snapshot
Non-Horn clause logic programming without contrapositives
inferred← citeshttps://doi.org/10.1007/bf03037149openalex-snapshot
Compiling a default reasoning system into Prolog
inferred← citeshttps://doi.org/10.1007/bf03037184openalex-snapshot
Logic programming, abduction and probability
inferred← citeshttps://doi.org/10.1007/bf03037328openalex-snapshot
A Prolog technology theorem prover
inferred← citeshttps://doi.org/10.1007/bfb0015257openalex-snapshot
Abstracting unification: A key step in the design of logic program analyses
inferred← citeshttps://doi.org/10.1007/bfb0022681openalex-snapshot
An introduction to automated deduction
inferred← citeshttps://doi.org/10.1007/bfb0023865openalex-snapshot
An interleaving model for real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0024661openalex-snapshot
Verification tools in the development of provably correct compilers
inferred← citeshttps://doi.org/10.1007/bfb0032733openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1007/bfb0032734openalex-snapshot
An algebraic approach to sharing analysis of logic programs
inferred← citeshttps://doi.org/10.1007/bfb0032757openalex-snapshot
Abstract interpretation: A theory of approximate computation
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90016-8openalex-snapshot
Automatic inductive theorem proving using prolog
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90194-mopenalex-snapshot
Semantics for logic programs without occur check
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90170-xopenalex-snapshot
C-expressions: a variable-free calculus for equational logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(84)90024-4openalex-snapshot
A KWIC (key word in context) bibliography on prolog and logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(85)90004-4openalex-snapshot
Some global optimizations for a PROLOG compiler
inferred← citeshttps://doi.org/10.1016/0743-1066(85)90015-9openalex-snapshot
Relating logic programs and attribute grammars
inferred← citeshttps://doi.org/10.1016/0743-1066(88)90012-xopenalex-snapshot
The occur-check problem revisited
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90030-7openalex-snapshot
Abstract interpretation and application to logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90033-yopenalex-snapshot
Multiple specialization using minimal-function graph semantics
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90048-5openalex-snapshot
Correctness of unification without occur check in prolog
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50030-8openalex-snapshot
Model Elimination and Connection Tableau Procedures
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114107openalex-snapshot
A relaxed condition for avoiding the occur-check
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00312-1openalex-snapshot
Set-sharing is redundant for pair-sharing
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00007-2openalex-snapshot
An algebraic approach to sharing analysis of logic programs
inferred← citeshttps://doi.org/10.1109/ccece.1994.405823openalex-snapshot
Implementing cyclic structures by term object sharing
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.1145/12808.12833openalex-snapshot
Automated theorem proving: mapping logic into AI
inferred← citeshttps://doi.org/10.1145/174662.174664openalex-snapshot
Live-structure dataflow analysis for Prolog
inferred← citeshttps://doi.org/10.1145/177492.177673openalex-snapshot
On the occur-check-free PROLOG programs
inferred← citeshttps://doi.org/10.1145/232706.232734openalex-snapshot
Global analysis of constraint logic programs
inferred← citeshttps://doi.org/10.1145/62029.62030openalex-snapshot
Unification: a multidisciplinary survey
inferred← citeshttps://doi.org/10.1145/65979.65983openalex-snapshot
Static inference of modes and data dependencies in logic programs
inferred← citeshttps://doi.org/10.1145/66068.66075openalex-snapshot
On prolog and the occur check problem
inferred← citeshttps://doi.org/10.1145/988284.988288openalex-snapshot
Eliminating unwanted loops in Prolog
inferred← citeshttps://doi.org/10.20868/upm.thesis.1252openalex-snapshot
Diseño, semántica y especificación de Babel : un lenguaje que integra la programación funcional y lógica
inferred← citeshttps://doi.org/10.29007/tlw4openalex-snapshot
An Inference Rule for the Acyclicity Property of Term Algebras
inferred← citeshttps://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for model checking
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.