From Probabilistic Programming to Complexity-based Programming

Giovanni Sileno, Jean-Louis Dessalles
7/28/2023
cs.AIcs.CL

No confident code implementation found for this paper.

Abstract

The paper presents the main characteristics and a preliminary implementation of a novel computational framework named CompLog. Inspired by probabilistic programming systems like ProbLog, CompLog 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Three Conjectures on Unexpectedeness

83% match2023

smProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation

82% match2023

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy

82% match2024

Hybrid Probabilistic Logic Programming: Inference and Learning

80% match2023

Enhancing SMT-based Weighted Model Integration by Structure Awareness

80% match1 repo262023

"Would life be more interesting if I were in AI?" Answering Counterfactuals based on Probabilistic Inductive Logic Programming

80% match2023

Cite this paper

@article{sileno2023from,
  title  = {From Probabilistic Programming to Complexity-based Programming},
  author = {Giovanni Sileno and Jean-Louis Dessalles},
  year   = {2023},
  eprint = {2307.15453},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.15453v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.15453.svg)](https://codeofpaper.com/paper/2307.15453)

Discussion