On the public citation graph
Positive/Negative conditional rewriting
0 signed · 45 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-10856-4_85openalex-snapshot
On the power of algebraic specifications
inferredcites →https://doi.org/10.1007/3-540-17220-3_3openalex-snapshot
A compiler for conditional term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-17220-3_8openalex-snapshot
Term rewriting systems with priorities
inferredcites →https://doi.org/10.1007/978-3-642-69962-7openalex-snapshot
Fundamentals of Algebraic Specification 1
inferredcites →https://doi.org/10.1007/bfb0039613openalex-snapshot
Ground term confluence in parametric conditional equational specifications
inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot
Conditional rewrite rules
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50008-7openalex-snapshot
On the Declarative Semantics of Logic Programs with Negation
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.1109/sfcs.1977.9openalex-snapshot
Conflunt reductions: Abstract properties and applications to term rewriting systems
inferredcites →https://doi.org/10.1145/6012.15409openalex-snapshot
Positivism vs minimalism in deductive databases
inferredcites →https://doi.org/10.1145/800017.800519openalex-snapshot
Completion of a set of rules modulo a set of equations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1997.1449openalex-snapshot
Comparison of Functional and Predicative Query Paradigms
inferred← citeshttps://doi.org/10.1006/jsco.1994.1004openalex-snapshot
A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_114openalex-snapshot
Priority rewriting: Semantics, confluence, and conditionals
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_115openalex-snapshot
Negation with logical variables in conditional rewriting
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_82openalex-snapshot
Equivalences of rewrite programs
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_19openalex-snapshot
Beyond conditional equations
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_15openalex-snapshot
A constructor-based approach for positive/negative-conditional equational specifications
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_16openalex-snapshot
Semantics for positive/negative conditional rewrite 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-57867-6_20openalex-snapshot
Second-order proof systems for algebraic specification languages
inferred← citeshttps://doi.org/10.1007/3-540-57867-6_7openalex-snapshot
About the “correctness” and “adequacy” of PLUSS specifications
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_12openalex-snapshot
On notions of inductive validity for first-order equational clauses
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_15openalex-snapshot
Extensions of initial models and their second-order proof systems
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_9openalex-snapshot
Equation solving in projective planes and planar ternary rings
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_14openalex-snapshot
Affine geometry of collinearity and conditional term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_3openalex-snapshot
Equation solving in geometrical theories
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_1openalex-snapshot
Theorem Proving in Hierarchical Clausal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_7openalex-snapshot
Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories
inferred← citeshttps://doi.org/10.1007/bf02939525openalex-snapshot
A constructor-based EI-model semantics of EI-CTRS
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90043-dopenalex-snapshot
Using rewriting techniques to produce code generators and proving them correct
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/s0167-6423(99)00037-4openalex-snapshot
Generation of components for software renovation factories from context-free grammars
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80014-3openalex-snapshot
Term Rewriting for Sale
inferred← citeshttps://doi.org/10.1017/s0960129500000645openalex-snapshot
Parametric algebraic specifications with Gentzen formulas – from quasi-freeness to free functor semantics
inferred← citeshttps://doi.org/10.1109/eurmic.2000.874614openalex-snapshot
How to implement the future?
inferred← citeshttps://doi.org/10.1109/wcre.1997.624585openalex-snapshot
Generation of components for software renovation factories from context-free grammars
inferred← citeshttps://doi.org/10.1145/170035.170090openalex-snapshot
On the power of algebras with recursion
inferred← citeshttps://doi.org/10.48550/arxiv.0902.3614openalex-snapshot
Syntactic Confluence Criteria for Positive/Negative-Conditional Term Rewriting Systems
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.