Equivalence checking for orthocomplemented bisemilattices in log-linear time
From MaRDI portal
Publication:6535616
DOI10.1007/978-3-030-99527-0_11zbMATH Open1547.68428MaRDI QIDQ6535616
Publication date: 1 February 2024
Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Free lattices, projective lattices, word problems (06B25) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision procedures. An algorithmic point of view
- Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings
- Untersuchungen über das logische Schliessen. I
- Free lattices.
- Automatic Verification of TLA + Proof Obligations with SMT Solvers
- Automated complexity analysis based on ordered resolution
- HOL Light: An Overview
- A Brief Overview of Mizar
- Topological sorting of large networks
- The Isabelle Framework
- A solution of the uniform word problem for ortholattices
- Hard examples for resolution
- On the Computational Complexity of Algebra on Lattices
- Complete Sets of Reductions for Some Equational Theories
- Free Ortholattices
- Proof Complexity
- Term Rewriting and All That
- Automatic recognition of tractability in inference relations
- Computer Aided Verification
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
Related Items (1)
This page was built for publication: Equivalence checking for orthocomplemented bisemilattices in log-linear time
