aboutsummaryrefslogtreecommitdiff
path: root/src/test
diff options
context:
space:
mode:
authorFederico Igne <federico.igne@cs.ox.ac.uk>2020-10-23 20:55:36 +0200
committerFederico Igne <federico.igne@cs.ox.ac.uk>2020-10-23 20:55:36 +0200
commit697dd84aa64bbfb40b60a4d132f91168eba19d5a (patch)
tree64d8318d279aebc8f44f8b535518997d74414346 /src/test
parent4ac28e74095c473e4ae0a44b0fb8db77a9ef3193 (diff)
downloadRSAComb-697dd84aa64bbfb40b60a4d132f91168eba19d5a.tar.gz
RSAComb-697dd84aa64bbfb40b60a4d132f91168eba19d5a.zip
Implement naive version of 'cycle' as in paper
This implementation is more closely related to the paper definition of 'cycle'. The initial implementation was an improvement on the generation of the logic program (but not necessarely on the Datalog engine side) because it generate far fewer new constants. We decided to stick with the naive version to be as close as possible to the paper description. This temporarely breaks some tests.
Diffstat (limited to 'src/test')
0 files changed, 0 insertions, 0 deletions