Discr tree multivar #214
Merged
Discr tree multivar #214
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
gares
force-pushed
the
discr-tree-multivar
branch
from
d0330a1 to
b7f7f77
Compare
FissoreD
force-pushed
the
discr-tree-multivar
branch
from
b601b85 to
204f3d4
Compare
gares
reviewed
May 27, 2024
gares
reviewed
May 27, 2024
gares
reviewed
May 27, 2024
|
It seems the branch needs to be rebased |
Let T = [1,2,3] be a term to be transformed into a path for the dt.
Before: T is transformed into
`[Constant(Cons,2), Primitive, Constant(Cons,2), Primitive, Constant(Cons,2), Primitive, Constant(Nil, 0)]`
Goal: T is compressed into
`[ListHead, Primitive, Primitive, Primitive, ListEnd]`
```prolog pred p i:list int. p [1,2,3]. (* I1 *) main :- p [1|X]. ``` the instance I1 was not filtered out
FissoreD
force-pushed
the
discr-tree-multivar
branch
from
204f3d4 to
4923df2
Compare
It is ok now |
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.
Goal:
if
L = [1,2,3]is a list, then the corresponding path used for indexing with discrimination tree is[Cons_2, Primitive, Cons_2, Primitive, Cons_2, Primitive, Nil_0]whereCons_2(respNil_0) tells that weare dealing with a constant of name
Cons(resp.Nil) of arity2(resp.0)In this encoding in each list, half of the size of the path is used for
Cons_2andNil_0.With this PR, we reduce the size of the path by adding two special marker for the Head and the End of a list and
remove all the Cons_2 and Nil_0.
The path for the list L will be encoded as
[ListHead, Primitive, Primitive, Primitive, ListEnd]