Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
From MaRDI portal
Publication:2508787
DOI10.1007/s10559-005-0084-xzbMath1102.68646OpenAlexW1999397533MaRDI QIDQ2508787
S. L. Kryvyi, Anatoli N. Chebotarev
Publication date: 20 October 2006
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-005-0084-x
Related Items
Cites Work
- Synthesis of a nondeterministic automaton from its logical specification. II
- Consistency test for simple specifications of automaton systems
- Synthesis of a nondeterministic automaton from its logical specification. I
- Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)
- Unnamed Item