Recent Posts

Pages: [1] 2 3 ... 10
1
AI Programming / Re: Borsuk
« Last post by 8pla.net on Today at 09:28:19 pm »
Pawal, what I meant by my question, is that I can relate to that.  Although I was careful, when I expanded my own project... I ran into some trouble. So, I had to go backwards to figure out a new strategy forward.
2
At real-time, GAN, its resolution, and cloud support for hordes of crazy testing friends telling friends, it's bound to die hard fast.
3
General AI Discussion / Re: OH DEAR HEAVENS, AND I GOT TO IT FIRST WOHO!
« Last post by Freddy on Today at 07:24:13 pm »
Can't get it to work in Chrome, Edge or Firefox.
5
AI Programming / Re: Borsuk
« Last post by pawel.biernacki on Today at 05:54:09 pm »
Borsuk is not fully implemented. It is indeed related with Perkun, I used some Perkun code to produce Borsuk.

I encourage you to use Perkun, it is good when you do not have too many variables.

https://sourceforge.net/projects/perkun/
6
General AI Discussion / Re: Anyone wants to learn logic?
« Last post by ivan.moony on Today at 05:26:58 pm »
We may have a set:

car ∊ Vehicles; train ∊ Vehicles; plane ∊ Vehicles


Now, to say:

(∀x∊Vehicles).Rides(x)

it is the same as we write:

Rides(car) ∧ Rides(train) ∧ Rides(plane)


But if we say:

(∃x∊Vehicles).HasWheels(x)

it is the same as we write:

HasWheels(car) ∨ HasWheels(train) ∨ HasWheels(plane)
7
AI Programming / Re: Borsuk
« Last post by 8pla.net on Today at 05:14:30 pm »
Is it not fully implemented, as a result of expansion?
8
General AI Discussion / Re: Anyone wants to learn logic?
« Last post by LOCKSUIT on Today at 04:30:33 pm »
In English, you mean the training data / the premises sets / the base knowledge, is 'marked'/tagged with rank truths, and that to determine one's truth requires modifiers that can validate it and then assign over truth?
9
AI Programming / Re: Borsuk
« Last post by pawel.biernacki on Today at 02:41:21 pm »
I am afraid it is not fully functional yet. I just wanted to share with you the syntax of the variable templates.

The following commands work in Borsuk already:

cout << variables << eol;
cout << objects << eol;
cout << rules << eol;
cout << actions << eol;
cout << payoff << eol;
cout << visible states << eol;
cout << model << eol;


The command "loop" which is entering the interactive optimization mode is not fully implemented yet.

As long as I don't have Borsuk completed you have to use Perkun in order to use my algorithm.

The objective is to maximize the expected value of the payoff function. When you add the command "loop(2);" for example then you will enter the optimization mode. You need to enter the values of the input variables, then Perkun/Borsuk chooses the optimal action that is maximizing the payoff within the next 2 steps.
10
General AI Discussion / Re: Anyone wants to learn logic?
« Last post by ivan.moony on Today at 02:12:35 pm »
When you have a whole compound sentence that is true, there are rules that say which parts should be true for the whole sentence to be true. If sentence is composed of only one part [i.e. Sleep(x)] than that part has to be true. Otherwise, the sentence is false.

You may see quantificators as a sentence modifiers that allow variables to range over sets. That is why quantificators itself can't have any truth value assigned - as a parts of a sentence. Only predicates - as a parts of a sentence - can have assigned a truth value.
Pages: [1] 2 3 ... 10