joshua/nominal-lstar
1
Fork 0
mirror of https://github.com/Jaxan/nominal-lstar.git synced 2025-04-27 14:47:45 +02:00
Code Issues Releases Activity
49 commits 1 branch 0 tags 214 KiB
Commit graph

49 commits

This branch
This branch
All branches
Author SHA1 Message Date
Joshua Moerman
a3e6d0581c simpler benchmarks 2020-05-28 09:21:42 +02:00
Joshua Moerman
16b0f6ed79 Cleaned up the cabal file and moved some bits around 2020-05-27 18:37:53 +02:00
Joshua Moerman
d6173c4381 some cleanup 2020-05-25 17:22:34 +02:00
Joshua Moerman
2f88417749 Adds more example on residual languages 2020-05-25 17:22:27 +02:00
Joshua Moerman
df7a45fb69 Added feature to start with a bigger table 2020-05-25 16:38:46 +02:00
Joshua Moerman
56ad54ecb0 Fixes bug that NL* may return sink states 2020-05-25 16:33:03 +02:00
Joshua Moerman
96ae5ba868 Forgot to add the new Main2.hs file :-( 2017-10-24 14:31:05 +02:00
Joshua Moerman
e91859b61f Updates README accordingly 2017-10-21 10:45:23 +02:00
Joshua Moerman
7da6db27b3 Two things: Optimisations (now only adds one row to fix closedness, and one column to fix inconsistencies) and IO (now also speaks the protocol used in the new paper) 2017-10-21 10:40:59 +02:00
Joshua Moerman
7b062904d8 Updates the README 2017-03-30 14:19:05 +01:00
Joshua Moerman
b05d958666 Updates it to use the new nlambda (with better support for generics). 2017-03-30 13:57:53 +01:00
Joshua Moerman
2d1d5d7bfd Generalizes external Teacher. Uses read-atoms branch from NLambda. 2016-12-05 14:47:41 +01:00
Joshua Moerman
3cc387a068 Splits the Teacher.hs into more files 2016-12-05 12:35:19 +01:00
Joshua Moerman
e475c5b471 Removed some debug IO 2016-12-02 16:10:40 +01:00
Joshua Moerman
15a02c4762 Uses the new NLambda features for an external teacher 2016-12-02 15:49:48 +01:00
Michał Szynwelski
e1b00e192b NLambda paragraph 2016-10-09 21:30:33 +02:00
Joshua Moerman
b7d48030f0 Prepared a bundles artifact for evaluation 2016-10-07 11:47:56 +02:00
Joshua Moerman
2ebd8b9774 Made code anonymous 
Also removed some vague comments
 2016-07-06 21:26:03 +02:00
Joshua Moerman
3de97f93c6 Main.hs now read arguments 2016-07-04 15:30:00 +02:00
Michał Szynwelski
5f51951b0d Optimization of size and maxSize functions. 2016-07-03 18:17:44 +02:00
Joshua Moerman
8d54c1a553 Adds better support for counter membership queries 
VERY EXPERIMENTAL AND SLOW
 2016-06-30 11:44:25 +02:00
Joshua Moerman
6337defa0e Adds a counter to the teacher (bery hacky) 2016-06-30 10:58:32 +02:00
Joshua Moerman
28145815c6 Improves performance by using more simplify 2016-06-28 12:08:10 +02:00
Joshua Moerman
8946bc941e Adds the examples from the paper 2016-06-28 10:35:12 +02:00
Joshua Moerman
a10c1cb84a Simplifies my own naive take on NL* 2016-06-27 14:51:36 +02:00
Joshua Moerman
8998042874 Adds a teacher for NFAs (bounded to a depth). 
Also includes a variation of the up-to technique found in the 'hacking
non-determinism' paper by Bonchi and Pous.
 2016-06-27 14:50:57 +02:00
Michał Szynwelski
a9b3738cd3 Optimization of consistencyTestDirect.candidates function. 2016-06-26 21:06:18 +02:00
Joshua Moerman
ec5fe35c79 Simplified consistency in Angluin 2016-06-24 13:57:17 +02:00
Joshua Moerman
7109eb1ec6 Improved the Bollig implementation 2016-06-24 10:41:00 +02:00
Joshua Moerman
e65a099948 Fixes a bug in my Bollig implementation 2016-06-23 17:16:02 +02:00
Joshua Moerman
9ac25c4d9b Refactors code to be more modular. 
Now all three variations: Angluin, Bollig and homebrew NL* are using the
same framework. I did not extensively test the refactor.
 2016-06-23 16:20:33 +02:00
Joshua Moerman
f24ed31ac8 Implemented NL* by Bollig et al (verbatim) 2016-06-23 14:50:30 +02:00
Joshua Moerman
25d47a3550 Refactors the IO monad out. Made functions pure again. 2016-06-23 11:16:47 +02:00
Joshua Moerman
f5f88a2ef7 Adds the NFA example by Bollig et al 2016-06-23 11:16:01 +02:00
Joshua Moerman
43c85612bb Refactors the code to use simpler types. 2016-06-22 17:30:26 +02:00
Joshua Moerman
9ee755117e Adds ways to control strictness. 
Increases efficiency by 1.5x (if used in observation table)
 2016-06-22 17:27:35 +02:00
Joshua Moerman
600f2fe1e8 Simplification in observation table 2016-06-20 16:40:18 +02:00
Joshua Moerman
24e2c1ff88 Hacked NL* together. 
Not complete yet, but it already works for the prototypical NFA: all
words with duplicate atoms.
 2016-06-20 16:40:08 +02:00
Joshua Moerman
2e901070d9 Code now compiles on windows as well. (Doesn't run well yet) 2016-06-20 09:54:32 +02:00
Michał Szynwelski
fbcba8c580 Optimization of incompleteness function. 2016-06-17 14:12:09 +02:00
Joshua Moerman
c3c6645039 Merge branch 'master' of github.com:UCL-PPLV/nominal-learning 2016-06-17 08:58:10 +02:00
Joshua Moerman
e403d7dbd6 Adds definition for inconsistency by Bartek 2016-06-17 08:57:15 +02:00
Michał Szynwelski
e683a4e384 Optimization of row function. 2016-06-14 00:09:16 +02:00
Joshua Moerman
cb09b2d306 Code: Fixes some warnings and made sure everything compiles out of the box (ghc 7.10) 2016-05-10 11:57:27 +02:00
Joshua Moerman
afd27369a1 Code: Teacher now uses bisimulation to find counter examples 2016-04-29 11:15:42 +01:00
Joshua Moerman
7c0cdcf7c3 Code: Implemented adding CEs as columns (Rivest Schapire variant?) 2016-04-28 17:47:51 +01:00
Joshua Moerman
004e71ccd9 Code: some cleanup 2016-04-28 17:26:16 +01:00
Michał Szynwelski
440e5ef854 Formula simplifications + constants. 2016-04-24 23:15:07 +02:00
Joshua Moerman
d52f991a74 Code: Angluin's algorithm with NLambda 2016-04-14 17:36:03 +01:00