Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Combination of sequences and quantifiers #1235

Closed
aengelke opened this issue Aug 25, 2017 · 1 comment
Closed

Combination of sequences and quantifiers #1235

aengelke opened this issue Aug 25, 2017 · 1 comment

Comments

@aengelke
Copy link

Is the combination of sequences and quantifiers (currently) supported? If not, it would be great to receive confirmation about this.

Example (I'm aware that this is overly complicated):

(declare-const x (Seq Int))
(declare-const y (Seq Int))
(assert (= (seq.len x) 10))
(assert (= (seq.len y) 10))
(assert (forall ((i Int)) (= (seq.at x i) (seq.at y i))))
(check-sat)
(check-sat-using (then qe smt))
; Result: unknown unknown
@NikolajBjorner
Copy link
Contributor

There are no quantifier elimination algorithms for general sequences (Quine). There are some special classes, such as "queues". Ting Zhang's thesis considers these with length constraints. If you want to implement a quantifier elimination plugin for these cases you are welcome to add a pull request.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants