Re: [opencog-dev] automated code generation

Oh, and also to clarify what Alex says: yes, I forgot -- from the 1990's onwards (and even earlier e.g. smalltalk) there was this idea that people would draw diagrams, hit a button, and the diagrams get converted into high-level code. Alex's email uses the various catch-phrases that were popular

Re: [opencog-dev] automated code generation

There has been a thing I'm working on more thoroughly, recently, and that is "intensional" representation of deduction/abduction tree. A classic way for deducing conclusions is extensional, meaning ranging over starting set of formulas and enriching the starting set by new conclusions, repeating

Re: [opencog-dev] automated code generation

In principle the opencog Rule Engine and backward chainer can do this... Getting it to run quickly and scalably on such tasks without combinatorial explosion is gonna be nontrivial however... but important and interesting.. On Sun, May 7, 2017 at 11:46 PM, Dmitry Ponyatov

Re: [opencog-dev] automated code generation

Ooops, I incidentantly hit the send button prematurely... What I mean is: Disjunction: ((a -> T) ∧ (b -> T) ∧ c -> T) ∨ ((a -> T) ∧ (b -> F) ∧ c -> T) ∨ ((a -> F) ∧ (b -> T) ∧ c -> T) ∨ ((a -> F) ∧ (b -> F) ∧ c -> T) ∨ ((a -> T) ∧ (b -> F) ∧ c -> F) ∨ ((a -> F) ∧ (b -> T) ∧ c -> F)

Re: [opencog-dev] automated code generation

Correct me if I'm wrong, but isn't backward chainer what Dimitry is looking for? Is it possible to insert a set of formulas: (a -> T, b -> T, c -> T) ∨ (a -> T, b -> F, c -> T) ∨ (a -> F, b -> T, c -> T) ∨ (a -> F, b -> F, c -> T) ∨ (a -> T, b -> F, c -> F) ∨ (a -> F, b -> T, c -> F) (a1

[opencog-dev] automated code generation

Is opencog suitable for automated code generation ? I'm searching in some AI technologies which can be applied in transformational programming, especially in automated code generation: synthsize programs code in mainstream languages like C(++), Java, JS,... basing on declarative highlevel