Rewrite semantics for production rule systems: theory and applications

DOI10.1007/3-540-61511-3_110zbMATH Open1412.68273OpenAlexW1512599305MaRDI QIDQ4647544FDOQ4647544

Authors: Wayne Snyder, James G. Schmolze 

Publication date: 15 January 2019

Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61511-3_110

Recommendations

• Rewriting semantics of production rule sets
• scientific article; zbMATH DE number 4049117
• Computing with rewrite systems
• Modeling production rules by means of predicate transition networks
• Modeling rule-based systems by stochastic programmed production systems

zbMATH Keywords

critical pairproduction ruleground instancenegative conditionwork memory

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic in artificial intelligence (68T27)

Cites Work

• A semantics for a class of stratified production system programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equational problems and disunification
• Redundancy criteria for constrained completion
• Rewrite semantics for production rule systems: theory and applications

Cited In (8)

• Title not available (Why is that?)
• Semantics of production systems
• Title not available (Why is that?)
• Rewriting semantics of production rule sets
• Simulating production rules using ACTHEX
• A class of rewriting rules and reverse transformation for rule-based equivalent transformation
• Rewrite semantics for production rule systems: theory and applications
• Syntax-guided rewrite rule enumeration for SMT solvers

This page was built for publication: Rewrite semantics for production rule systems: theory and applications

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