Improved resolution-based method for satisfiability checking formulas of the language L

DOI10.1007/978-3-540-70881-0_38zbMATH Open1185.68617OpenAlexW2123900472MaRDI QIDQ3401966FDOQ3401966

Authors: Anatoly Chebotarev, S. L. Kryvyi 

Publication date: 2 February 2010

Published in: Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70881-0_38

Recommendations

• scientific article; zbMATH DE number 5158957
• Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)
• Improved method of synthesis of an automaton from its specification in the language \(L\)
• 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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (4)

• Title not available (Why is that?)
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
• Separable resolution method for checking the satisfiability of formulas in the language \({\mathfrak L}\)

This page was built for publication: Improved resolution-based method for satisfiability checking formulas of the language \(L\)

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