Pages that link to "Item:Q2947004"
From MaRDI portal
The following pages link to Automated complexity analysis based on ordered resolution (Q2947004):
Displaying 16 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Deducibility constraints and blind signatures (Q462488) (← links)
- Automatic decidability and combinability (Q549666) (← links)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- (Q4738360) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- From Search to Computation: Redundancy Criteria and Simplification at Work (Q4916077) (← links)
- Constructing Bachmair-Ganzinger Models (Q4916082) (← links)
- On Combinations of Local Theory Extensions (Q4916087) (← links)
- Towards an algorithmic construction of cut-elimination procedures (Q5458060) (← links)
- On Hierarchical Reasoning in Combinations of Theories (Q5747749) (← links)
- Equivalence checking for orthocomplemented bisemilattices in log-linear time (Q6535616) (← links)