Separable resolution method for checking the satisfiability of formulas in the language L

DOI10.1007/BF02667147MaRDI QIDQ1968528zbMATH OpenFDO

Authors A. N. Chebotarev

Publication date 17 October 2000

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

Full work available at URL https://doi.org/10.1007/BF02667147

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Improved resolution-based method for satisfiability checking formulas of the language L
• scientific article; zbMATH DE number 5158957
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II
• Extension of the automaton specification logical language and the synthesis problem

Cites work

• Automatic Theorem Proving With Renamable and Semantic Resolution
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Resolution approach to testing compatibility of interacting automata

Cited in

(6)

• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
• Harmonization of automata specifications represented in the language L
• Improved resolution-based method for satisfiability checking formulas of the language L
• scientific article; zbMATH DE number 5158957 (Why is no real title available?)
• Verifying specifications in the language L against temporal properties nonexpressible in this language
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968528)