Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00349564" target="_blank" >RIV/68407700:21230/21:00349564 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1613/jair.1.12320" target="_blank" >https://doi.org/10.1613/jair.1.12320</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1613/jair.1.12320" target="_blank" >10.1613/jair.1.12320</a>

Result language
angličtina
Original language name
Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
Original language description
It is known due to the work of Van den Broeck, Meert and Darwiche that weighted first-order model counting (WFOMC) in the two-variable fragment of first-order logic can be solved in time polynomial in the number of domain elements. In this paper we extend this result to the two-variable fragment with counting quantifiers.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)