Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)

DOI10.1007/BF02667147zbMath0946.68081MaRDI QIDQ1968528

Anatoli N. Chebotarev

Publication date: 17 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Verifying specifications in the language L against temporal properties nonexpressible in this language ⋮ Harmonization of automata specifications represented in the language L ⋮ Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I

Cites Work

• Unnamed Item
• Resolution approach to testing compatibility of interacting automata
• Automatic Theorem Proving With Renamable and Semantic Resolution

This page was built for publication: Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)