Query complexity estimation

[Tomasz Kuchta]

Hello,

I was wondering whether there is some functionality in STP that can be used to estimate complexity of queries.

For example, is it possible to tell early on that one query will be expensive and thus take longer time to solve, while the other query will be more lightweight.

On a related question I was wondering whether it is possible to obtain satisfiable / unsatisfiable core for a given query?

Thank you in advance,

Tomasz

[Vijay Ganesh]

Hi Tomasz,

This is a great question.

I don't anybody who has done this for SMT solvers in general, let alone STP. I have some ideas how we can go about doing it, and I am happy to chat with you off-line.

-Vijay.

--
 
---
You received this message because you are subscribed to the Google Groups "stp-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to stp-users+...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.