Applying Boolean discrete methods in the production of a real-valued probabilistic programming model

02/18/2016
by   Jonathan Darren Nix, et al.
0

In this paper we explore the application of some notable Boolean methods, namely the Disjunctive Normal Form representation of logic table expansions, and apply them to a real-valued logic model which utilizes quantities on the range [0,1] to produce a probabilistic programming of a game character's logic in mathematical form.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/14/2023

A Deductive Verification Infrastructure for Probabilistic Programs

This paper presents a quantitative program verification infrastructure f...
research
11/18/2020

Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing

We generalize the celebrated isoperimetric inequality of Khot, Minzer, a...
research
12/04/1998

Name Strategy: Its Existence and Implications

It is argued that colour name strategy, object name strategy, and chunki...
research
04/23/2019

A formalization of forcing and the unprovability of the continuum hypothesis

We describe a formalization of forcing using Boolean-valued models in th...
research
09/05/2021

Steady state distributions in generalized exclusion processes

The asymmetric simple exclusion process (ASEP) is a model of particle tr...
research
05/19/2020

On Restricting Real-Valued Genotypes in Evolutionary Algorithms

Real-valued genotypes together with the variation operators, mutation an...
research
07/22/2019

Aggregating Probabilistic Judgments

In this paper we explore the application of methods for classical judgme...

Please sign up or login with your details

Forgot password? Click here to reset