A Term Rewriting Technique for Decision Graphs
From MaRDI portal
Publication:5170280
DOI10.1016/j.entcs.2009.10.016zbMath1291.68243OpenAlexW1991116256MaRDI QIDQ5170280
Publication date: 23 July 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.10.016
Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Cites Work
- Zero, successor and equality in BDDs
- BDD based procedures for a theory of equality with uninterpreted functions
- Solvable cases of the decision problem
- Fast Decision Procedures Based on Congruence Closure
- A Computing Procedure for Quantification Theory
- Computer Aided Verification
- Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
- Computer Aided Verification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Term Rewriting Technique for Decision Graphs