Intelligent systems. Theory and applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Intelligent systems. Theory and applications:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Intelligent systems. Theory and applications, 2019, Volume 23, Issue 3, Pages 35–40 (Mi ista236)  

Part 2. Special Issues in Intellectual Systems Theory

Graph based extended resolution for Boolean formulas

G. V. Bokov


Abstract: In this article we consider a graph based extended resolution for representing refutations of Boolean formulas in conjunction normal form. We prove that a Boolean formula is unsatisfiable iff there is its graph based refutation.

Keywords: Resolution, graph based refutation, unsatisfiability, Boolean formulas.

Full text: PDF file (275 kB)
References: PDF file   HTML file

Citation: G. V. Bokov, “Graph based extended resolution for Boolean formulas”, Intelligent systems. Theory and applications, 23:3 (2019), 35–40

Citation in format AMSBIB
\Bibitem{Bok19}
\by G.~V.~Bokov
\paper Graph based extended resolution for Boolean formulas
\jour Intelligent systems. Theory and applications
\yr 2019
\vol 23
\issue 3
\pages 35--40
\mathnet{http://mi.mathnet.ru/ista236}


Linking options:
  • http://mi.mathnet.ru/eng/ista236
  • http://mi.mathnet.ru/eng/ista/v23/i3/p35

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Intelligent systems. Theory and applications
    Number of views:
    This page:65
    Full text:12
    References:7

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021