On the public citation graph
Algebraic properties of idempotent substitutions
0 signed · 87 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-51486-4_64openalex-snapshot
Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses
inferredcites →https://doi.org/10.1007/3-540-54938-2openalex-snapshot
Conclog: A Methodological Approach to Concurrent Logic Programming
inferredcites →https://doi.org/10.1007/978-1-4471-3860-0_4openalex-snapshot
From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0032046openalex-snapshot
Algebraic properties of idempotent substitutions
inferredcites →https://doi.org/10.1007/bfb0035860openalex-snapshot
A compositional semantics for Concurrent Prolog
inferredcites →https://doi.org/10.1016/0304-3975(89)90070-4openalex-snapshot
Declarative modeling of the operational behavior of logic languages
inferredcites →https://doi.org/10.1016/0304-3975(92)90051-gopenalex-snapshot
From failure to success: comparing a denotational and a declarative semantics for Horn clause logic
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0747-7171(85)80027-4openalex-snapshot
Properties of substitutions and unifications
inferredcites →https://doi.org/10.1109/lics.1988.5130openalex-snapshot
Fully abstract denotational semantics for flat Concurrent Prolog
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/96709.96733openalex-snapshot
Concurrent constraint programming
inferredcites →https://doi.org/10.7551/mitpress/2086.001.0001openalex-snapshot
Concurrent Constraint Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1995.1034openalex-snapshot
Suprema of Open and Closed Formulas and Their Application to Resolution
inferred← citeshttps://doi.org/10.1006/inco.1995.1138openalex-snapshot
Observable Behaviors and Equivalences of Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-36187-1_38openalex-snapshot
A General Approach for Building Constraint Languages
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_13openalex-snapshot
Building Complete Abstract Interpretations in a Linear Logic-Based Setting
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_95openalex-snapshot
Extended Horn clauses: the framework and some semantics
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_85openalex-snapshot
Extraction of functional from logic program
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_136openalex-snapshot
Unfold/fold transformations preserving termination properties
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_93openalex-snapshot
Narrowing approximations as an optimization for equational logic programs
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_19openalex-snapshot
Preserving universal termination through unfold/fold
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_8openalex-snapshot
Compositional analysis for equational Horn programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_4openalex-snapshot
From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-49210-6_8openalex-snapshot
A New Algorithm for Computing Least Generalization of a Set of Atoms
inferred← citeshttps://doi.org/10.1007/978-3-031-45784-5_10openalex-snapshot
A Term Matching Algorithm and Substitution Generality
inferred← citeshttps://doi.org/10.1007/978-3-319-14125-1_4openalex-snapshot
A Finite Representation of the Narrowing Space
inferred← citeshttps://doi.org/10.1007/978-3-319-63139-4_12openalex-snapshot
On the Completeness of Selective Unification in Concolic Testing of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_21openalex-snapshot
Abstract Domains for Sharing Analysis by Optimal Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-68234-9_20openalex-snapshot
Forgetting Concepts in DL-Lite
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_35openalex-snapshot
Anti-unification Algorithms and Their Applications in Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-20551-4_14openalex-snapshot
Abstract Diagnosis of First Order Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_4openalex-snapshot
Semantic Code Clones in Logic Programs
inferred← citeshttps://doi.org/10.1007/bfb0013605openalex-snapshot
A finitary version of the calculus of partial inductive definitions
inferred← citeshttps://doi.org/10.1007/bfb0013821openalex-snapshot
Fixpoint semantics for partial computed answer substitutions and call patterns
inferred← citeshttps://doi.org/10.1007/bfb0031754openalex-snapshot
Language extensions for semantic integration of deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0032739openalex-snapshot
Denotational abstract interpretation of functional logic programs
inferred← citeshttps://doi.org/10.1007/bfb0056626openalex-snapshot
A game semantics foundation for logic programming
inferred← citeshttps://doi.org/10.1007/s13173-013-0103-0openalex-snapshot
Ambiguity and context-dependent overloading
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90051-gopenalex-snapshot
From failure to success: comparing a denotational and a declarative semantics for Horn clause logic
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/0304-3975(93)90339-uopenalex-snapshot
Weighted systems of equations
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90054-xopenalex-snapshot
A denotational semantics and dataflow construction for logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90084-1openalex-snapshot
The role of standardising apart in logic programming
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90200-3openalex-snapshot
A compositional semantics for logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00109-3openalex-snapshot
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00043-6openalex-snapshot
A compositional semantic basis for the analysis of equational Horn programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00024-zopenalex-snapshot
Analyses of unsatisfiability for equational logic programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.040openalex-snapshot
Unfolding-based Improvements on Fuzzy Logic Programs
inferred← citeshttps://doi.org/10.1016/j.fss.2005.03.013openalex-snapshot
On fuzzy unfolding: A multi-adjoint approach
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.11.006openalex-snapshot
A framework for computing finite SLD trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.040openalex-snapshot
Abstract interpretation of resolution-based semantics
inferred← citeshttps://doi.org/10.1016/s0096-0551(00)00006-0openalex-snapshot
Dynamic composition of parameterised logic modules
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00316-9openalex-snapshot
Logical optimality of groundness analysis
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00126-0openalex-snapshot
Multi-valued logic programming semantics an algebraic approach
inferred← citeshttps://doi.org/10.1017/s1471068404002066openalex-snapshot
Model checking linear logic specifications
inferred← citeshttps://doi.org/10.1017/s147106840600281xopenalex-snapshot
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
inferred← citeshttps://doi.org/10.1017/s1471068406002833openalex-snapshot
Integration of declarative and constraint programming
inferred← citeshttps://doi.org/10.1093/logcom/12.3.497openalex-snapshot
Generalizing Def and Pos to Type Analysis
inferred← citeshttps://doi.org/10.1145/1042038.1042040openalex-snapshot
Making abstract domains condensing
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1515/dma.2008.007openalex-snapshot
On complexity of the anti-unification problem
inferred← citeshttps://doi.org/10.15514/ispras-2012-22-23openalex-snapshot
Polynomial time algorithm for checking strong equivalence of program
inferred← citeshttps://doi.org/10.15514/ispras-2012-23-28openalex-snapshot
Polynomial time algorithm for checking strong equivalence of program
inferred← citeshttps://doi.org/10.29007/77z3openalex-snapshot
Is it possible to unify sequential programs?
inferred← citeshttps://doi.org/10.31274/rtd-180813-9747openalex-snapshot
Generalized knowledge-based semantics for multi-valued logic programs
inferred← citeshttps://doi.org/10.3233/fi-2020-1993openalex-snapshot
Selective Unification in (Constraint) Logic Programming*
inferred← citeshttps://doi.org/10.4204/eptcs.289.5openalex-snapshot
On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions
inferred← citeshttps://doi.org/10.48550/arxiv.0812.1979openalex-snapshot
Essential Variables and Separable Sets in Universal Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1608.03054openalex-snapshot
On the Completeness of Selective Unification in Concolic Testing of Logic Programs
inferred← citeshttps://doi.org/10.4995/thesis/10251/1948openalex-snapshot
Rule-Based Software Verification and Correction.
inferred← citeshttps://doi.org/10.4995/thesis/10251/44234openalex-snapshot
A Rewriting-based, Parameterized Exploration Scheme for the Dynamic Analysis of Complex Software Systems
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
inferred← citeshttps://doi.org/10.7146/dpb.v20i348.6578openalex-snapshot
Properties of Unfolding-based Meta-level Systems
inferred← citeshttps://doi.org/10.7146/dpb.v21i410.6723openalex-snapshot
Unfold/fold Transformations Preserving Termination Properties
inferred← citeshttps://doi.org/10.7551/mitpress/4307.003.0020openalex-snapshot
Negation as Partial Failure
showing the first 70 of 71 · page through all 71
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.