From Probabilistic Programming to Complexity-based Programming - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

From Probabilistic Programming to Complexity-based Programming

Résumé

The paper presents the main characteristics and a preliminary implementation of a novel computational framework named Com-pLog. Inspired by probabilistic programming systems like ProbLog, Com-pLog builds upon the inferential mechanisms proposed by Simplicity Theory, relying on the computation of two Kolmogorov complexities (here implemented as min-path searches via ASP programs) rather than probabilistic inference. The proposed system enables users to compute ex-post and ex-ante measures of unexpectedness of a certain situation, mapping respectively to posterior and prior subjective probabilities. The computation is based on the specification of world and mental models by means of causal and descriptive relations between predicates weighted by complexity. The paper illustrates a few examples of application: generating relevant descriptions, and providing alternative approaches to disjunction and to negation.
Fichier principal
Vignette du fichier
HYDRA2023.pdf (305.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04464156 , version 1 (18-02-2024)

Identifiants

Citer

Giovanni Sileno, Jean-Louis Dessalles. From Probabilistic Programming to Complexity-based Programming. 26th European Conference on Artificial Intelligence ECAI 2023, Sep 2023, Kraków, Poland. pp.304-317, ⟨10.1007/978-3-031-50485-3_32⟩. ⟨hal-04464156⟩
24 Consultations
9 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More