I have a use case for algebraic groups over finite permutation sets. Because I would like to use the group for various permutation classes which are otherwise unrelated, I would like to do this as a m
I have a large Ruby application that is just crying out for the addition of an inference engine; I don\'t need a lot of functionality, am not afraid of integrating C libraries, and am coming up empty
I\'m developing a REST webservice in Scala using the Jersey JAX-RS reference implementation and I\'m getting a strange error.
The application I\'m working on is a \"configurator\" of sorts. It\'s written in C# and I even wrote a rules engine to go with it. The idea is that there are a bunch of propositional logic statements,
Using Allegrograph, Prolog functors are pretty awesome, but there is one downside. Let\'s say you define a functor that links two entities, for example parentOf which equals to \"!n:motherOf OR !n:f
Suppose you\'re writing a program that searches an exponentially large or infinite space: gameplaying, theorem proving, optimization etc, anything where you can\'t search the entire space, and the qua
I\'m not sure how to phrase this question concisely without just giving the example so here goes: public interface IThing<T>
My requirement is probably close to what one expects of an \"Expert System\". And looking for the simplest solution, that can give me real-time or near-real time inference, with some offline (non-real
I am trying to think of an algorithm where I can create number of possible binary combinations for my inference engine implementation
I found some short articles about both, and for me it sounds like both figure out things through logic, si开发者_StackOverflow中文版milar to how Prolog works. I must add I am new to this field so I mi
加载中,请稍侯......