Finite limit sketches #444
Closed
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fixed from_combinatorial, still need to implement limit diagram checking / "activation" logic
I was wrong, this was not straightforward at all to extend from CSets. So, instead, a pseudo-Cset is created for ACSets and the problem is solved there before converting back to an ACSet
|
Made redundant by sketched CSets |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is a work in progress. It contains a combinatorial representation of Finite Limit Sketches (and a Julia data structure, LabeledFLS, to allow interacting with the FLS via LabeledGraphs which are much easier to interpret). Many example sketches are given in tests. Furthermore, we can take a Presentation and convert it to a Linear Sketch (a FLS without any cones) and do things such as check whether the equations hold.
The main way FLS are used here is to enumerate their models, which is currently treated as a constraint satisfaction problem in C-Rel (each C-Rel instance can be thought of as a collection of possible models; there are many possible foreign keys for a given primary key) rather than C-Set.
This is just a draft because it was written just to get something that works at all, whereas making things more organized/cleaner/efficient will be in the future. Sharing for anyone curious and would appreciate suggestions / radical changes to be made.
Caveat: this depends on CSet-automorphism code which hasn't yet been merged into master, so we should be careful about that dependency/duplication. It also includes GATmatch code which is not relevant and should be moved to its own branch. The only relevant files are in
src/sketches/andtest/sketches/