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

被引:0
|
作者
Kuzelka, Ondrej [1 ]
机构
[1] Czech Tech Univ, Fac Elect Engn, Prague, Czech Republic
关键词
LOGIC;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:1281 / 1307
页数:27
相关论文
共 50 条