| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-04-23 | a trivial refactoring of the reasoner in the C runtime | kr.angelov | |
| 2013-02-11 | remove the pgf2yaml tool which was both broken and redundant. The ↵ | kr.angelov | |
| declarations for generic programming from data.c are removed as well | |||
| 2013-01-07 | a new reasoner in the C runtime. It supports tabling which makes it ↵ | kr.angelov | |
| decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order | |||
| 2012-12-14 | debugging infrastructure in the reasoner | kr.angelov | |
| 2012-12-14 | bugfix for the reasoner in the C runtime | kr.angelov | |
| 2012-12-14 | The first prototype for exhaustive generation in the C runtime. The trees ↵ | kr.angelov | |
| are always listed in decreasing probability order. There is also an API for generation from Python | |||
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |