Weighted first-order model counting in the two-variable fragment with counting quantifiers

被引:0
|
作者
Kuželka O. [1 ]
机构
[1] Faculty of Electrical Engineering, Czech Technical University in Prague, Prague
关键词
21;
D O I
10.1613/JAIR.1.12320
中图分类号
学科分类号
摘要
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. © 2021 AI Access Foundation. All rights reserved.
引用
收藏
页码:1281 / 1307
页数:26
相关论文
共 50 条