On the public citation graph

Completeness results for basic narrowing

https://doi.org/10.1007/bf01190830

0 signed · 126 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/3-540-10009-1_25openalex-snapshot

Canonical forms and unification

inferredcites →https://doi.org/10.1007/3-540-15984-3_328openalex-snapshot

Unification in conditional-equational theories

inferredcites →https://doi.org/10.1007/3-540-17220-3_20openalex-snapshot

Improving basic narrowing techniques

inferredcites →https://doi.org/10.1007/3-540-19129-1_7openalex-snapshot

A completeness result for E-unification algorithms based on conditional narrowing

inferredcites →https://doi.org/10.1007/3-540-19242-5_3openalex-snapshot

Confluence of conditional rewrite systems

inferredcites →https://doi.org/10.1007/3-540-50667-5_74openalex-snapshot

Babel: A functional and logic programming language based on constructor discipline and narrowing

inferredcites →https://doi.org/10.1007/3-540-51564-x_51openalex-snapshot

Completeness of extended unification based on basic narrowing

inferredcites →https://doi.org/10.1007/3-540-53904-2_87openalex-snapshot

Detecting redundant narrowing derivations by the LSE-SL reducibility test

inferredcites →https://doi.org/10.1007/3-540-53904-2_90openalex-snapshot

Narrowing directed by a graph of terms

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

Canonical conditional rewrite systems

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

Uniform narrowing strategies

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

Foundations of Equational Logic Programming

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

Compiling logic programs with equality

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

Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond

inferredcites →https://doi.org/10.1016/0022-0000(86)90033-4openalex-snapshot

Conditional rewrite rules: Confluence and termination

inferredcites →https://doi.org/10.1016/0022-0000(91)90009-topenalex-snapshot

Kernel-LEAF: A logic plus functional language

inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot

Conditional rewrite rules

inferredcites →https://doi.org/10.1016/0304-3975(88)90095-3openalex-snapshot

Narrowing vs. SLD-resolution

inferredcites →https://doi.org/10.1016/0304-3975(90)90032-dopenalex-snapshot

On completeness of narrowing strategies

inferredcites →https://doi.org/10.1016/0304-3975(90)90064-oopenalex-snapshot

A rationale for conditional equational programming

inferredcites →https://doi.org/10.1016/s0747-7171(87)80010-xopenalex-snapshot

Simplifying conditional term rewriting systems : Unification, termination and confluence

inferredcites →https://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot

Basic narrowing revisited

inferredcites →https://doi.org/10.1016/s0747-7171(89)80015-xopenalex-snapshot

Enumerating outer narrowing derivationsfor constructor-based term rewriting systems

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

A Machine-Oriented Logic Based on the Resolution Principle

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

An Efficient Unification Algorithm

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

Proving termination with multiset orderings

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.1999.2837openalex-snapshot

Higher Order Unification via Explicit Substitutions

inferred← citeshttps://doi.org/10.1006/jsco.1996.0075openalex-snapshot

Oriented Equational Logic Programming is Complete

inferred← citeshttps://doi.org/10.1006/jsco.1997.0197openalex-snapshot

A Deterministic Lazy Narrowing Calculus

inferred← citeshttps://doi.org/10.1007/11805618_3openalex-snapshot

Computationally Equivalent Elimination of Conditions

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-45406-3_5openalex-snapshot

Functional and Constraint Logic Programming

inferred← citeshttps://doi.org/10.1007/3-540-48483-3_11openalex-snapshot

Complete Strategies for Term Graph Narrowing

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-59200-8_56openalex-snapshot

Level-confluence of conditional rewrite systems with extra variables in right-hand sides

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-60299-2_25openalex-snapshot

Normalizing narrowing for weakly terminating and confluent systems

inferred← citeshttps://doi.org/10.1007/3-540-60381-6_4openalex-snapshot

LSE narrowing for decreasing conditional term rewrite systems

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-61055-3_35openalex-snapshot

A rewriting logic for declarative programming

inferred← citeshttps://doi.org/10.1007/3-540-61550-4_175openalex-snapshot

A semantic matching algorithm: Analysis and implementation

inferred← citeshttps://doi.org/10.1007/3-540-61735-3_7openalex-snapshot

Unravelings and ultra-properties

inferred← citeshttps://doi.org/10.1007/3-540-61735-3_8openalex-snapshot

Standardization theorem revisited

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-030-17502-3openalex-snapshot

Tools and Algorithms for the Construction and Analysis of Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-17502-3_2openalex-snapshot

Confluence Competition 2019

inferred← citeshttps://doi.org/10.1007/978-3-031-16767-6_2openalex-snapshot

Confluence Framework: Proving Confluence with CONFident

inferred← citeshttps://doi.org/10.1007/978-3-031-31476-6_1openalex-snapshot

Strategies in Conditional Narrowing Modulo SMT Plus Axioms

inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_11openalex-snapshot

Confluence of Almost Parallel-Closed Generalized Term Rewriting Systems

inferred← citeshttps://doi.org/10.1007/978-3-032-07021-0_7openalex-snapshot

Graded Quantitative Narrowing

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_2openalex-snapshot

Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/978-3-319-99840-4_1openalex-snapshot

Benchmarking Implementations of Term Rewriting and Pattern Matching in Algebraic, Functional, and Object-Oriented Languages

inferred← citeshttps://doi.org/10.1007/978-3-540-31959-7_13openalex-snapshot

From Conditional to Unconditional Rewriting

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-73147-4_3openalex-snapshot

Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations

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-24580-0_8openalex-snapshot

Learning-Based Testing for Reactive Systems Using Term Rewriting Technology

inferred← citeshttps://doi.org/10.1007/978-3-642-32943-2_10openalex-snapshot

S-Narrowing for Constructor Systems

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-59126-6_5openalex-snapshot

Basics of Term Rewriting

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

Safe folding/unfolding with conditional narrowing

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

Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language

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

Conditional term graph rewriting

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

Logicality of conditional rewrite systems

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-017-9417-5openalex-snapshot

Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

inferred← citeshttps://doi.org/10.1007/s10990-007-9002-4openalex-snapshot

A new generic scheme for functional logic programming with constraints

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/j.entcs.2002.09.008openalex-snapshot

Conditional Term Graph Rewriting with Indirect Sharing

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.030openalex-snapshot

Constraint Functional Logic Programming Revisited

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.032openalex-snapshot

Computational Origami Construction as Constraint Solving and Rewriting

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.072openalex-snapshot

Analysis of Rewrite-Based Access Control Policies

inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.10.003openalex-snapshot

Reversible computation in term rewriting

inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100926openalex-snapshot

Local confluence of conditional and generalized term rewriting systems

inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101070openalex-snapshot

A distribution semantics for probabilistic term rewriting

inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101170openalex-snapshot

The rise of “orthogonal” to designate some (conditional) term rewriting systems

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.jsc.2008.05.005openalex-snapshot

Shallow confluence of conditional term rewriting systems

inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.001openalex-snapshot

Constrained narrowing for conditional equational theories modulo axioms

inferred← citeshttps://doi.org/10.1016/j.scico.2019.03.006openalex-snapshot

Symbolic state space reduction with guarded terms for rewriting modulo SMT

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.05.012openalex-snapshot

A compact fixpoint semantics for term rewriting systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.028openalex-snapshot

Proving weak properties of rewriting

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.005openalex-snapshot

Determinization of conditional term rewriting systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00209-7openalex-snapshot

Implementing conditional term rewriting by graph rewriting

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00210-8openalex-snapshot

Logicality of conditional rewrite systems

inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10029-8openalex-snapshot

An approach to declarative programming based on a rewriting logic

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00284-1openalex-snapshot

Induction for termination with local strategies

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80693-5openalex-snapshot

Narrowing-based simulation of term rewriting systems with extra variables and its Termination Proof

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

A Rewriting Logic Implementation of Erlang

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

Rewriting Logic as a Framework for Generic Verification Tools

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

Unification, Rewriting, and Narrowing on Term Graphs

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

Outermost Ground Termination

inferred← citeshttps://doi.org/10.1017/s0956796897002645openalex-snapshot

Leftmost outside-in narrowing calculi

inferred← citeshttps://doi.org/10.1017/s0960129500070122openalex-snapshot

Term graph narrowing

inferred← citeshttps://doi.org/10.1017/s1471068406002833openalex-snapshot

Integration of declarative and constraint programming

inferred← citeshttps://doi.org/10.1093/jigpal/jzq009openalex-snapshot

Modular termination of basic narrowing and equational unification

inferred← citeshttps://doi.org/10.1109/iccl.1994.288383openalex-snapshot

A compositional semantics for conditional term rewriting systems

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

A lazy narrowing calculus for declarative constraint programming

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

Induction for positive almost sure termination

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

Termination of rewriting under strategies

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/2967973.2968605openalex-snapshot

Analysis of access control policy updates through narrowing

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

Conditional narrowing modulo SMT and axioms

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

Light analysis of complex systems

inferred← citeshttps://doi.org/10.2168/lmcs-8(3:4)2012openalex-snapshot

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity

inferred← citeshttps://doi.org/10.29007/cpt8openalex-snapshot

A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting

inferred← citeshttps://doi.org/10.4204/eptcs.173.7openalex-snapshot

Lifting Term Rewriting Derivations in Constructor Systems by Using Generators

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.4230/lipics.rta.2011.267openalex-snapshot

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity

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

Syntactic Confluence Criteria for Positive/Negative-Conditional Term Rewriting Systems

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

Certified Non-Confluence with ConCon 1.5

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.48550/arxiv.cs/0507064openalex-snapshot

Termination of rewriting strategies: a generic approach

inferred← citeshttps://doi.org/10.4995/thesis/10251/139076openalex-snapshot

Formal Methods for Constraint-Based Testing and Reversible Debugging in Erlang

inferred← citeshttps://doi.org/10.4995/thesis/10251/1888openalex-snapshot

Una aproximación offline a la evaluación parcial dirigida por narrowing

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/55796openalex-snapshot

Análisis semántico y transformación de programas lógico-funcionales.

inferred← citeshttps://doi.org/10.70675/1423c0dez59dez4873zac7fzc6cd90f116dbopenalex-snapshot

Generic bidirectional typing in a logical framework for dependent type theories

inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0065openalex-snapshot

On Extra Variables in (Equational) Logic Programming

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.