Automated complexity analysis based on ordered resolution
From MaRDI portal
Recommendations
- Automated higher-order complexity analysis
- scientific article; zbMATH DE number 2087550
- Automated Complexity Analysis Based on the Dependency Pair Method
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- On the complexity of automatic complexity
- Complexity analysis by graph rewriting
- Complexity Analysis by Rewriting
- Automated Implicit Computational Complexity Analysis (System Description)
- scientific article; zbMATH DE number 5041651
Cited in
(19)- Constructing Bachmair-Ganzinger models
- Algorithms and reductions for rewriting problems. II.
- scientific article; zbMATH DE number 1414298 (Why is no real title available?)
- On Hierarchical Reasoning in Combinations of Theories
- Harald Ganzinger's legacy: contributions to logics and programming
- Locality transfer: from constrained axiomatizations to reachability predicates
- On deciding satisfiability by theorem proving with speculative inferences
- Automatic decidability and combinability
- Towards an algorithmic construction of cut-elimination procedures
- Deducibility constraints and blind signatures
- A rewriting approach to satisfiability procedures.
- On combinations of local theory extensions
- Challenges in the Automated Verification of Security Protocols
- Model Checking Security Protocols
- From search to computation: redundancy criteria and simplification at work
- Symbolic Model Construction for Saturated Constrained Horn Clauses
- Variant-Based Satisfiability in Initial Algebras
- scientific article; zbMATH DE number 2087550 (Why is no real title available?)
- Equivalence checking for orthocomplemented bisemilattices in log-linear time
This page was built for publication: Automated complexity analysis based on ordered resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947004)
