An abstract dual propositional model counter
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 n...
Salvato in:
Autore principale: | |
---|---|
Natura: | Статья |
Lingua: | English |
Pubblicazione: |
CEUR-WS
2018
|
Soggetti: | |
Accesso online: | 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= https://dspace.ncfu.ru/handle/20.500.12258/3068 |
Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|
id |
ir-20.500.12258-3068 |
---|---|
record_format |
dspace |
spelling |
ir-20.500.12258-30682020-07-07T12:09:41Z An abstract dual propositional model counter Holldobler, S. Formal framework Non-dual Propositional formulas Real-world problem 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 2018-09-25T13:04:50Z 2018-09-25T13:04:50Z 2017 Статья Biere, A., Hölldobler, S., Möhle, S. An abstract dual propositional model counter // CEUR Workshop Proceedings. - 2017. - Volume 1837. - Pages 17-26 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 en CEUR Workshop Proceedings application/pdf CEUR-WS |
institution |
СКФУ |
collection |
Репозиторий |
language |
English |
topic |
Formal framework Non-dual Propositional formulas Real-world problem |
spellingShingle |
Formal framework Non-dual Propositional formulas Real-world problem Holldobler, S. An abstract dual propositional model counter |
description |
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 |
format |
Статья |
author |
Holldobler, S. |
author_facet |
Holldobler, S. |
author_sort |
Holldobler, S. |
title |
An abstract dual propositional model counter |
title_short |
An abstract dual propositional model counter |
title_full |
An abstract dual propositional model counter |
title_fullStr |
An abstract dual propositional model counter |
title_full_unstemmed |
An abstract dual propositional model counter |
title_sort |
abstract dual propositional model counter |
publisher |
CEUR-WS |
publishDate |
2018 |
url |
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= https://dspace.ncfu.ru/handle/20.500.12258/3068 |
work_keys_str_mv |
AT holldoblers anabstractdualpropositionalmodelcounter AT holldoblers abstractdualpropositionalmodelcounter |
_version_ |
1760602001903714304 |