Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/20.500.12258/3068
Title: An abstract dual propositional model counter
Authors: Holldobler, S.
Keywords: Formal framework;Non-dual;Propositional formulas;Real-world problem
Issue Date: 2017
Publisher: CEUR-WS
Citation: Biere, A., Hölldobler, S., Möhle, S. An abstract dual propositional model counter // CEUR Workshop Proceedings. - 2017. - Volume 1837. - Pages 17-26
Series/Report no.: CEUR Workshop Proceedings
Abstract: Various real-world problems can be formulated as the task of counting the models of a propositional formula. This problem, also called #SAT, is therefore of practical relevance. We present a formal framework describing a novel approach based on considering the formula in question together with its negation. This method enables us to close search branches earlier. We formalize a non-dual variant and argue that our framework is sound
URI: https://www.scopus.com/record/display.uri?eid=2-s2.0-85019910602&origin=resultslist&sort=plf-f&src=s&nlo=&nlr=&nls=&sid=1037d22933cbf8bcd3e6624b57a854a1&sot=aff&sdt=sisr&sl=174&s=AF-ID%28%22North+Caucasus+Federal+University%22+60070541%29+OR+AF-ID%28%22Stavropol+State+University%22+60070961%29+OR+AF-ID%28%22stavropolskij+Gosudarstvennyj+Tehniceskij+Universitet%22+60026323%29&ref=%28An+abstract+dual+propositional+model+counter%29&relpos=0&citeCnt=0&searchTerm=
http://hdl.handle.net/20.500.12258/3068
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 355 .pdf
  Restricted Access
62.21 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.