Constructors, sufficient completeness, and deadlock freedom of rewrite theories

DOI10.1007/978-3-642-16242-8_42zbMATH Open1306.68087OpenAlexW102151912MaRDI QIDQ4933334FDOQ4933334

Camilo Rocha, José Meseguer

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_42

Recommendations

• Sufficient-completeness, ground-reducibility and their complexity
• Sufficient completeness verification for conditional and constrained TRS
• scientific article; zbMATH DE number 4011938
• Completeness of combinations of constructor systems
• Completeness of combinations of constructor systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Logic in computer science (03B70)

Cited In (8)

• Twenty years of rewriting logic
• Ground confluence of order-sorted conditional specifications modulo axioms
• Metalevel algorithms for variant satisfiability
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Completeness of combinations of constructor systems
• Sufficient-completeness, ground-reducibility and their complexity
• Metalevel Algorithms for Variant Satisfiability
• A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems

Uses Software

• Maude
• ITP
• SCC

This page was built for publication: Constructors, sufficient completeness, and deadlock freedom of rewrite theories

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