Statistical Statements in Probabilistic Logic Programming

被引:13
作者
Azzolini, Damiano [1 ]
Bellodi, Elena [2 ]
Riguzzi, Fabrizio [1 ]
机构
[1] Univ Ferrara, Dipartimento Matemat & Informat, Via Saragat 1, I-44122 Ferrara, Italy
[2] Univ Ferrara, Dipartimento Ingn, Via Saragat 1, I-44122 Ferrara, Italy
来源
LOGIC PROGRAMMING AND NONMONOTONIC REASONING, LPNMR 2022 | 2022年 / 13416卷
关键词
Probabilistic Logic Programming; Statistical statements; Statistical Relational Artificial Intelligence; SEMANTICS; COMPLEXITY;
D O I
10.1007/978-3-031-15707-3_4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Probabilistic Logic Programs under the distribution semantics (PLPDS) do not allow statistical probabilistic statements of the form "90% of birds fly", which were defined "Type 1" statements by Halpern. In this paper, we add this kind of statements to PLPDS and introduce the PASTA ("Probabilistic Answer set programming for STAtistical probabilities") language. We translate programs in our new formalism into probabilistic answer set programs under the credal semantics. This approach differs from previous proposals, such as the one based on "probabilistic conditionals" as, instead of choosing a single model by making the maximum entropy assumption, we take into consideration all models and we assign probability intervals to queries. In this way we refrain from making assumptions and we obtain a more neutral framework. We also propose an inference algorithm and compare it with an existing solver for probabilistic answer set programs on a number of programs of increasing size, showing that our solution is faster and can deal with larger instances.
引用
收藏
页码:43 / 55
页数:13
相关论文
共 25 条
[1]   Aggregates in Answer Set Programming [J].
Alviano M. ;
Faber W. .
KI - Kunstliche Intelligenz, 2018, 32 (2-3) :119-124
[2]  
Aziz RA, 2015, AAAI CONF ARTIF INTE, P3468
[3]   Abduction with probabilistic logic programming under the distribution semantics [J].
Azzolini, Damiano ;
Bellodi, Elena ;
Ferilli, Stefano ;
Riguzzi, Fabrizio ;
Zese, Riccardo .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2022, 142 :41-63
[4]   Probabilistic reasoning with answer sets [J].
Baral, Chitta ;
Gelfond, Michael ;
Rushton, Nelson .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2009, 9 :57-144
[5]   Answer Set Programming at a Glance [J].
Brewka, Gerhard ;
Eiter, Thomas ;
Truszczynski, Miroslaw .
COMMUNICATIONS OF THE ACM, 2011, 54 (12) :92-103
[6]   The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference [J].
Cozman, Fabio Gagliardi ;
Maua, Denis Deratani .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 125 :218-239
[7]   On the Semantics and Complexity of Probabilistic Logic Programs [J].
Cozman, Fabio Gagliardi ;
Maua, Denis Deratani .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 60 :221-262
[8]  
De Raedt L, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2468
[9]  
Eiter T., 2021, P 18 INT C PRINC KNO, P269
[10]   Recursive aggregates in disjunctive logic programs: Semantics and complexity [J].
Faber, W ;
Leone, N ;
Pfeifer, G .
LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 :200-212