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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Статья |
| Jazyk: | English |
| Vydáno: |
CEUR-WS
2018
|
| Témata: | |
| On-line přístup: | 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 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|