RankPL: A Qualitative Probabilistic Programming Language
원문 초록
In this paper we introduce RankPL, a modeling language that can be thought of as a qualitative variant of a probabilistic programming language with a semantics based on Spohn's ranking theory. Broadly speaking, RankPL can be used to represent and reason about processes that exhibit uncertainty expressible by distinguishing "normal" from" surprising" events. RankPL allows (iterated) revision of rankings over alternative program states and supports various types of reasoning, including abduction and causal inference. We present the language, its denotational semantics, and a number of practical examples. We also discuss an implementation of RankPL that is available for download.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Causally Predictable Outcomes from Psychiatric Longitudinal Data
Towards Robust Multimodal Emotion Recognition under Missing Modalities and Distribution Shifts
From Images to Insights: Explainable Biodiversity Monitoring with Plain Language Habitat Explanations
Paths to Causality: Finding Informative Subgraphs Within Knowledge Graphs for Knowledge-Based Causal Discovery
Causal Effect Identification in lvLiNGAM from Higher-Order Cumulants
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.