Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism

Dylus, Sandra; Christiansen, Jan; Teegen, Finn

doi:10.1017/s1471068419000085

Cited by 3 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are not so few attempts in the scientific literature to talk about new forms of determinism, about non-determinism and overcoming of classical path determinism [12,13,14]. Besides, philosophy should take into account not only purely rational arguments, but also value judgments, which, it seems, are not taken into account at all in the refutation of determinism and its crucial linkcausality.…”

Section: Resultsmentioning

confidence: 99%

Determinism: Collision of Natural and Social Sciences’ Interpretations

Орланов¹,

Orlanova²

2020

Proceedings of the International Scientific Conference on Philosophy of Education, Law and Science in the Era of Globalization

View full text Add to dashboard Cite

The article substantiates the thesis that the category of determinism retains its methodological significance in modern social sciences and natural sciences. The appeal to the category of determinism is relevant in the context of its contemporary criticism. A categorical rejection of determinism is present in many publications by M. Wieviorka, P. Bourdieu, I. Prigogine, I. Stengers, and other researchers. The critical position is dictated by the identification of some interpretation disadvantages of the "determinism" concept. The article substantiates the critic's insufficiency to send a cognitive tool such as determinism to the archive. Consideration should be given to the possibility of updating the concept of determinism, given the fundamental nature of this philosophical concept. The study outlines the contours of a methodological approach that allows preservation of determinism in the arsenal of practical categorical tools in the sciences of nature and society. The essence of this approach is expressed in the introduced concepts of reflexive determinism and case determinism. The content of these concepts is considered from the standpoint of the activity of the subject of knowledge.

show abstract

Section: Resultsmentioning

confidence: 99%

Determinism: Collision of Natural and Social Sciences’ Interpretations

Орланов¹,

Orlanova²

2020

Proceedings of the International Scientific Conference on Philosophy of Education, Law and Science in the Era of Globalization

View full text Add to dashboard Cite

show abstract

“…For example, evaluating the expression last [failed, True] (where failed is an expression that has no value) fails with the definition above due to the strictness of the unification operation. In contrast, the variant based on functional patterns yields True for the same expression and, thus, properly reflects the non-strict nature of Curry, which can benefit many applications in practice [11,12].…”

Section: Introductionmentioning

confidence: 99%

Research Summary on Implementing Functional Patterns by Synthesizing Inverse Functions

Teegen

2020

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

In this research summary we present our recent work on implementing functional patterns with inverse functions in the lazy functional-logic programming language Curry. Our goal is the synthesis of the inverse of any given function in Curry itself. The setting of a functional-logic language especially allows the inversion of non-injective functions. In general, inverse computation is a non-trivial problem in lazy programming languages due to their non-strict semantics. We are so far able to directly derive the inverse function for a limited class of functions, namely those consisting of rules that do not involve both extra variables and non-linear right-hand sides. Because the synthesized definitions are based on standard code, known optimizations techniques can be applied to them. For all other functions we can still provide an inverse function by using non-strict unification.

show abstract

A Functional Account of Probabilistic Programming with Possible Worlds

Berg

Schrijvers

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

While there has been much cross-fertilization between functional and logic programming-e.g., leading to functional models of many Prolog features-this appears to be much less the case regarding probabilistic programming, even though this is an area of mutual interest. Whereas functional programming often focuses on modeling probabilistic processes, logic programming typically focuses on modeling possible worlds. These worlds are made up of facts that each carry a probability and together give rise to a distribution semantics. The latter approach appears to be little-known in the functional programming community. This paper aims to remedy this situation by presenting a functional account of the distribution semantics of probabilistic logic programming that is based on possible worlds. We present a term monad for the monadic syntax of queries together with a natural interpretation in terms of boolean algebras. Then we explain that, because probabilities do not form a boolean algebra, they-and other interpretations in terms of commutative semirings-can only be computed after query normalisation to deterministic, decomposable negation normal form (d-DNNF). While computing the possible worlds readily gives such a normal form, it suffers from exponential blow-up. Using heuristic algorithms yields much better results in practice.

show abstract

Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism

Cited by 3 publications

References 25 publications

Determinism: Collision of Natural and Social Sciences’ Interpretations

Determinism: Collision of Natural and Social Sciences’ Interpretations

Research Summary on Implementing Functional Patterns by Synthesizing Inverse Functions

A Functional Account of Probabilistic Programming with Possible Worlds

Contact Info

Product

Resources

About