scientific article; zbMATH DE number 5158957

zbMATH1126.68457MaRDI QIDQ3440993FDOQ3440993

Authors S. L. Krivoi, A. N. Chebotarev

Publication date 29 May 2007

zbMATH Keywords

finite automatalanguage Lreactive algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Improved resolution-based method for satisfiability checking formulas of the language \(L\)
• Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
• Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)
• Variable and clause elimination for LTL satisfiability checking
• A simple test improves checking satisfiability
• SAT-based explicit LTL reasoning and its application to satisfiability checking
• SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
• Enhancing disjunctive logic programming systems by SAT checkers
• Accelerating LTL satisfiability checking by SAT solvers
• scientific article; zbMATH DE number 2086516

Cited in

(4)

• Improved resolution-based method for satisfiability checking formulas of the language \(L\)
• Verifying specifications in the language L against temporal properties nonexpressible in this language
• Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I

This page was built for publication:

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