On the public citation graph

Foundations of Equational Logic Programming

https://doi.org/10.1007/bfb0015791
0 signed · 128 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 points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1997.0197openalex-snapshot
A Deterministic Lazy Narrowing Calculus
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_5openalex-snapshot
Correction of Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_29openalex-snapshot
Solving Planning Problems by Partial Deduction
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_13openalex-snapshot
A Complete Selection Function for Lazy Conditional Narrowing
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_18openalex-snapshot
Goal-Directed E-Unification
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_5openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_4openalex-snapshot
Semantics of Partial-Order Programs
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_87openalex-snapshot
Detecting redundant narrowing derivations by the LSE-SL reducibility test
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_111openalex-snapshot
Constrained equational deduction
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_90openalex-snapshot
Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_113openalex-snapshot
Lazy evaluation in logic
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_114openalex-snapshot
S-SLD-resolution — An operational semantics for logic programs with external procedures
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_92openalex-snapshot
Narrowing as an incremental constraint satisfaction algorithm
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_176openalex-snapshot
Disproving conjectures
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_124openalex-snapshot
Improving control of logic programs by using functional logic languages
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_153openalex-snapshot
Analyses of inconsistency for incremental equational logic programming
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_39openalex-snapshot
An optimal narrowing strategy for general canonical systems
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_4openalex-snapshot
Conditional narrowing with constructive negation
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_11openalex-snapshot
A taste of rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_68openalex-snapshot
Avoiding dynamic delays in functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_69openalex-snapshot
A debugging model for functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_85openalex-snapshot
A WAM-based implementation of a logic language with sets
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-57877-3_5openalex-snapshot
Towards the global optimization of functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_18openalex-snapshot
Lazy unification with simplification
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_26openalex-snapshot
Combining lazy narrowing and simplification
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_8openalex-snapshot
Compositional analysis for equational Horn programs
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_73openalex-snapshot
Learning from examples with typed equational programming
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_47openalex-snapshot
On narrowing, refutation proofs and constraints
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_71openalex-snapshot
Regular substitution sets: A means of controlling E-unification
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_209openalex-snapshot
Lazy narrowing: Strong completeness and eager variable elimination (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_48openalex-snapshot
An introduction to category-based equational logic
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_25openalex-snapshot
Normalizing narrowing for weakly terminating and confluent systems
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_15openalex-snapshot
Solving deductive planning problems using program analysis and transformation
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_17openalex-snapshot
Termination of logic programs using semantic unification
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_8openalex-snapshot
Handling equality in logic programming via basic folding
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_28openalex-snapshot
Narrowing-driven partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_38openalex-snapshot
Termination by absence of infinite chains of dependency pairs
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_48openalex-snapshot
Higher-order narrowing with definitional trees
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_56openalex-snapshot
Swinging data types
inferred← citeshttps://doi.org/10.1007/3540539816_68openalex-snapshot
Exploiting non-determinism through laziness in guarded functional languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_23openalex-snapshot
Non-Determinism and Lazy Evaluation in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_3openalex-snapshot
Synthesis of Narrowing Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-16202-3openalex-snapshot
Functional and Constraint Logic Programming
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-99840-4_2openalex-snapshot
Multi-paradigm Programming in Maude
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_13openalex-snapshot
Completeness of E-Unification with Eager Variable Elimination
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_1openalex-snapshot
Modular Termination of Basic Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-540-78969-7_10openalex-snapshot
Termination of Narrowing in Left-Linear Constructor Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_13openalex-snapshot
Transformation and Debugging of Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_5openalex-snapshot
Folding Variant Narrowing and Optimal Variant Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_6openalex-snapshot
Functional Logic Programming: From Theory to Curry
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_10openalex-snapshot
Computing More Specific Versions of Conditional Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_16openalex-snapshot
Functional Logic Programming in Maude
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_13openalex-snapshot
Linear Paramodulation modulo Equality
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_8openalex-snapshot
A New Deductive Approach to Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-75182-0_48openalex-snapshot
ALPES A Programming Environment for Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-02711-0_2openalex-snapshot
A Completeness Proof Technique for Resolution with Equality
inferred← citeshttps://doi.org/10.1007/978-3-7091-7557-6_5openalex-snapshot
An Equational Constraint Logic approach to Conceptual Modelling
inferred← citeshttps://doi.org/10.1007/bf00244496openalex-snapshot
On the completeness of SLDENF-resolution
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf00881829openalex-snapshot
Default reasoning by deductive planning
inferred← citeshttps://doi.org/10.1007/bf01190830openalex-snapshot
Completeness results for basic narrowing
inferred← citeshttps://doi.org/10.1007/bf01202035openalex-snapshot
Conditional narrowing modulo a set of equations
inferred← citeshttps://doi.org/10.1007/bf01530895openalex-snapshot
Computing change and specificity with equational logic programs
inferred← citeshttps://doi.org/10.1007/bf03037518openalex-snapshot
A new deductive approach to planning
inferred← citeshttps://doi.org/10.1007/bf03037561openalex-snapshot
Generalizations in type equational programming and their application to learning functions
inferred← citeshttps://doi.org/10.1007/bfb0013045openalex-snapshot
On deductive planning and the frame problem
inferred← citeshttps://doi.org/10.1007/bfb0013829openalex-snapshot
Incremental rewriting in narrowing derivations
inferred← citeshttps://doi.org/10.1007/bfb0013830openalex-snapshot
Counterexamples to completeness results for basic narrowing (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0013831openalex-snapshot
Uniform narrowing strategies
inferred← citeshttps://doi.org/10.1007/bfb0015462openalex-snapshot
A fine-grain sort discipline and its application to formal program construction
inferred← citeshttps://doi.org/10.1007/bfb0016859openalex-snapshot
Higher order conditional rewriting and narrowing
inferred← citeshttps://doi.org/10.1007/bfb0023434openalex-snapshot
A constructive type system based on data terms
inferred← citeshttps://doi.org/10.1007/bfb0026999openalex-snapshot
Safe folding/unfolding with conditional narrowing
inferred← citeshttps://doi.org/10.1007/bfb0032044openalex-snapshot
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
inferred← citeshttps://doi.org/10.1007/bfb0033833openalex-snapshot
Narrowing the narrowing space
inferred← citeshttps://doi.org/10.1007/bfb0037422openalex-snapshot
On the specification of visual languages: Multisets as first-class citizens
inferred← citeshttps://doi.org/10.1007/s00200-010-0122-4openalex-snapshot
Termination of narrowing via termination of rewriting
inferred← citeshttps://doi.org/10.1007/s10817-007-9068-zopenalex-snapshot
General E-unification with Eager Variable Elimination and a Nice Cycle Rule
inferred← citeshttps://doi.org/10.1007/s13218-024-00837-wopenalex-snapshot
In Memory of Steffen Hölldobler: From Logic to Formal and Cognitive Reasoning
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90063-nopenalex-snapshot
Conditional equational theories and complete sets of transformations
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90243-mopenalex-snapshot
Equality and abductive residua for Horn clauses
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00224-7openalex-snapshot
Incremental constraint satisfaction for equational logic programming
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/0304-3975(96)00071-0openalex-snapshot
Lazy narrowing: Strong completeness and eager variable elimination
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/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferred← citeshttps://doi.org/10.1016/0743-1066(96)00049-0openalex-snapshot
A note on semantics of logic programs with equality based on complete sets of E-unifiers
inferred← citeshttps://doi.org/10.1016/b978-0-08-057115-7.50028-5openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-08-057115-7.50031-5openalex-snapshot
Copyright
inferred← citeshttps://doi.org/10.1016/b978-0-444-88771-9.50026-xopenalex-snapshot
Combining Horn Clause Logic with Rewrite Rules
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.01.002openalex-snapshot
Folding variant narrowing and optimal variant termination
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.004openalex-snapshot
A semantic framework for open processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.013openalex-snapshot
Loop detection in term rewriting using the eliminating unfoldings
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.037openalex-snapshot
Termination of narrowing revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.009openalex-snapshot
An integrated framework for the diagnosis and correction of rule-based programs
inferred← citeshttps://doi.org/10.1016/s0096-0551(97)00010-6openalex-snapshot
Lazy narrowing with simplification
inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00018-5openalex-snapshot
Theory of partial-order programming
inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80009-xopenalex-snapshot
A derived algorithm for evaluating ɛ-expressions over abstract sets
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00266-xopenalex-snapshot
Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80345-1openalex-snapshot
A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424.
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80332-9openalex-snapshot
Strong Completeness of a Narrowing Calculus for Conditional Rewrite Systems with Extra Variables
inferred← citeshttps://doi.org/10.1017/s0956796897002645openalex-snapshot
Leftmost outside-in narrowing calculi
inferred← citeshttps://doi.org/10.1017/s0956796899003330openalex-snapshot
Higher-order narrowing with definitional trees
inferred← citeshttps://doi.org/10.1023/a:1018900105153openalex-snapshot
Temporal representation and reasoning in artificial intelligence: Issues and approaches
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1109/iccl.1994.288383openalex-snapshot
A compositional semantics for conditional term rewriting systems
inferred← citeshttps://doi.org/10.1145/1097002.1097004openalex-snapshot
Modeling, querying and reasoning about OLAP databases
inferred← citeshttps://doi.org/10.1145/174675.177889openalex-snapshot
Higher-order equational logic programming
inferred← citeshttps://doi.org/10.1145/174675.177899openalex-snapshot
A needed narrowing strategy
inferred← citeshttps://doi.org/10.1145/258993.259015openalex-snapshot
Specialization of lazy functional logic programs
inferred← citeshttps://doi.org/10.1145/258994.259015openalex-snapshot
Specialization of lazy functional logic programs
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.2197/ipsjdc.2.248openalex-snapshot
Pattern Matching of Incompletely RE-Typed Expressions via Transformation
inferred← citeshttps://doi.org/10.29007/pr47openalex-snapshot
The Weak Completion Semantics and Equality
inferred← citeshttps://doi.org/10.3233/fi-1995-24126openalex-snapshot
NARROWING STRATEGIES FOR ARBITRARY CANONICAL REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404050openalex-snapshot
A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types
inferred← citeshttps://doi.org/10.4995/thesis/10251/19251openalex-snapshot
Termination of Narrowing: Automated Proofs and Modularity Properties
inferred← citeshttps://doi.org/10.4995/thesis/10251/1948openalex-snapshot
Rule-Based Software Verification and Correction.
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.5281/zenodo.26359openalex-snapshot
Morphometrics As A Tool In Identification: A Case Study On A Myrmica From France (Hymenoptera, Formicidae).
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0051openalex-snapshot
A Method for Implementing Equational Theories as Logic Programs
inferred← citeshttps://doi.org/10.7551/mitpress/4301.003.0007openalex-snapshot
Goal Solving as Operational Semantics
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.