Computing with rewrite systems

DOI10.1016/S0019-9958(85)80003-6MaRDI QIDQ3707361zbMATH OpenFDO

Authors Nachum Dershowitz

Publication date 1985

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(85)80003-6

zbMATH Keywords

equivalence-preserving rulesHorn clausesKnuth-Bendix completion procedurelogic programmingnarrowing procedurenegationpredicate calculusprogram specificationprogram synthesisterm rewriting systems

Mathematics Subject Classification ID

Varieties (08B99) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4088915
• scientific article; zbMATH DE number 4092742
• Rewriting Systems with Data
• An abstract formulation for rewrite systems
• The Rewriting Calculus as a Combinatory Reduction System
• Rewrite systems with constraints
• Rewriting techniques for program synthesis
• Rewriting systems over nested data words

Cited in

(57)

• Termination orderings for associative-commutative rewriting systems
• On sufficient-completeness and related properties of term rewriting systems
• History and basic features of the critical-pair/completion procedure
• Critical pair criteria for completion
• Fast Knuth-Bendix completion with a term rewriting system compiler
• Enumerating outer narrowing derivations for constructor-based term rewriting systems
• A rewrite mechanism for logic programs with negation
• When is an extension of a specification consistent? Decidable and undecidable cases
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• Deductive and inductive synthesis of equational programs
• Programs with restoration of computations
• Category-based modularisation for equational logic programming
• Linear and unit-resulting refutations for Horn theories
• Unification modulo an equality theory for equational logic programming
• Sufficient-completeness, ground-reducibility and their complexity
• Pushing the frontiers of combining rewrite systems farther outwards
• Canonical Inference for Implicational Systems
• scientific article; zbMATH DE number 3902026 (Why is no real title available?)
• scientific article; zbMATH DE number 3921956 (Why is no real title available?)
• scientific article; zbMATH DE number 3926235 (Why is no real title available?)
• scientific article; zbMATH DE number 4078853 (Why is no real title available?)
• scientific article; zbMATH DE number 4092824 (Why is no real title available?)
• scientific article; zbMATH DE number 4096777 (Why is no real title available?)
• Rewrite rule systems for modal propositional logic
• On rewrite programs: Semantics and relationship with prolog
• scientific article; zbMATH DE number 4123321 (Why is no real title available?)
• scientific article; zbMATH DE number 1534597 (Why is no real title available?)
• Rewrite semantics for production rule systems: theory and applications
• scientific article; zbMATH DE number 785049 (Why is no real title available?)
• Canonical ground Horn theories
• The third rewrite engines competition
• Completion for logically constrained rewriting
• Rewriting, and equational unification: the higher-order cases
• Proofs in parameterized specifications
• Program transformation and rewriting
• Encompassment properties and automata with constraints
• Rewrite systems for integer arithmetic
• An abstract concurrent machine for rewriting
• Set-theoretic graph rewriting
• A rewrite approach for constraint logic programming
• An introduction to category-based equational logic
• Recycling computed answers in rewrite systems for abduction
• No complete linear term rewriting system for propositional logic
• scientific article; zbMATH DE number 5172485 (Why is no real title available?)
• FLIC: application to caching of a dynamic dependency analysis for a 3D oriented CRS
• Basic rewriting via logic programming, with an application to the reachability problem
• A proof system for conditional algebraic specifications
• A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems
• Meta-rule synthesis from crossed rewrite systems
• Completion procedures as semidecision procedures
• Clausal rewriting
• Design strategies for rewrite rules
• A method of elimination of data structures based on formula rewriting systems
• Towards a foundation of completion procedures as semidecision procedures
• Bi-rewrite systems
• Synthetic programming
• A rationale for conditional equational programming

This page was built for publication: Computing with rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707361)