The following pages link to KoMeT (Q40434):
Displaying 12 items.
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- IeanCOP: lean connection-based theorem proving (Q1404981) (← links)
- A uniform procedure for converting matrix proofs into sequent-style systems (Q1854382) (← links)
- Practically useful variants of definitional translations to normal form (Q1854384) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- T-string unification: Unifying prefixes in non-classical proof methods (Q4645241) (← links)
- Converting non-classical matrix proofs into sequent-style systems (Q4647538) (← links)
- Integration of automated and interactive theorem proving in ILF (Q5234689) (← links)
- ILF-SETHEO (Q5234690) (← links)
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models (Q5927982) (← links)
