Path: ...!news.mixmin.net!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail
From: Mild Shock <janburse@fastmail.fm>
Newsgroups: comp.lang.java.programmer
Subject: Re: ANN: Dogelog Player 1.2.6 (Segmented Fileaccess)
Date: Sat, 8 Feb 2025 14:23:58 +0100
Message-ID: <vo7ltd$14pkn$2@solani.org>
References: <vmt1lh$bokb$3@solani.org> <vmtori$c5ui$4@solani.org>
 <vo2kki$11mi6$4@solani.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 8 Feb 2025 13:23:57 -0000 (UTC)
Injection-Info: solani.org;
	logging-data="1205911"; mail-complaints-to="abuse@news.solani.org"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:128.0) Gecko/20100101
 Firefox/128.0 SeaMonkey/2.53.20
Cancel-Lock: sha1:RCBFFMRNXgQ3v2oATQaXqKnXEnc=
X-User-ID: eJwNyckBwDAIA7CVApgj64DD/iO0+sotJCYRHvD1PcgSXMMtjfLWZPtTY1nHfcCeNlIrOCpIm91/htvl5PsAJk0VeA==
In-Reply-To: <vo2kki$11mi6$4@solani.org>
Bytes: 4744
Lines: 103


A SAT Solver is a computer program which aims to
solve the Boolean satisfiability problem. By a SAT
Learner we understand a computer program that tries
to find a Boolean formula, with a satisfiability that
matches some given data.

We find already evolutionary algorithms in John
Hollands book from 1975. Since we do not provide
cross-over we can implement island evolution with
random proportionate selection. The resulting Zero-Less
Decision Diagrams might not recognize all example
7-segment digits correctly.

See also:

SAT Learning in Dogelog Player
https://x.com/dogelogch/status/1888209886447653040

SAT Learning in Dogelog Player
https://www.facebook.com/groups/dogelog

Mild Shock schrieb:
> 
> Among algebraic approaches to logic we find binary
> decision diagrams. The approach is syntactical and not
> semantical, since it focuses on a certain formulas to
> represent truth tables. Unlike matrix like disjunctive
> or conjunctive normal forms, they give tree
> like normal forms.
> 
> Donald Knuth also popularized zero-suppressed
> decision diagrams, a binary decision diagram variant
> developed by Shin-Ichi Minato. Their appeal results
> from "jump" where nodes are omitted. We focused more
> on the cost of negation and arrived at zero-less
> decision diagram. They might have different niche
> application areas.
> 
> See also:
> 
> Zero-Less Decision Diagrams in Dogelog Player
> https://x.com/dogelogch/status/1887521934348374204
> 
> Zero-Less Decision Diagrams in Dogelog Player
> https://www.facebook.com/groups/dogelog
> 
> Mild Shock schrieb:
>>
>> The examined Prolog Notebook projects SWI for Sharing,
>> Ciao Notebooks and Tau Prolog all offer some Prolog
>> text coloring. We conducted an experiment whether we
>> can utilize some synergies in Dogelog Player to provide
>> a colorizer without using any 3rd party library.
>>
>> Since the batch processing slowed down the experience
>> of notebooks we changed our mind and started developping
>> a dynamic filter. Passive Logic Documents (PLD) are turned
>> into Active Logic Documents (ALD) via an asynchronous
>> call into a 100% in Prolog realized colorizer library.
>>
>> See also:
>>
>> Dogelog Notebooks with Prolog Coloring
>> https://x.com/dogelogch/status/1882455350739337230
>>
>> Dogelog Notebooks with Prolog Coloring
>> https://www.facebook.com/groups/dogelog
>>
>> Mild Shock schrieb:
>>> Dear All,
>>>
>>> We are happy to announce a new edition of the Dogelog player:
>>>
>>> - Segmented Fileaccess:
>>>    Due to UTF-8 problems, files were read completely into
>>> memory in order to then allow stream access.  In order to be
>>> able to use HTTP Transfer-Encoding: chunked, the UTF-8 problem
>>> has been solved and only individual blocks will be
>>> read into memory.
>>>
>>> - New library(crypto):
>>>    Segmented file access is supported not only for text files
>>> but also for binary files.  This allows hash digests to be
>>> calculated in a memory-saving manner.  The library implements
>>> a binding to the SHA-256 algorithms of JavaScript,
>>> Python and Java.
>>>
>>> - Backtracking Datastructures:
>>>    The libraries library(hash) and library(tree), which
>>> were only realized non-backtracking so far, have been
>>> expanded to include further predicates that allow
>>> backtracking updates.  library(hash) has been completely
>>> rewritten to open lists and only provides partial persistence,
>>> whereas library(tree) provides full persistence.
>>>
>>> For more details: Dogelog
>>>
>>> Have Fun!
>>>
>>> Jan Burse, http://www.xlog.ch/ , 23.01.2025
>>
>