Skip to main content
Stack Overflow
  1. About
  2. For Teams
Filter by
Sorted by
Tagged with
2 votes
1 answer
99 views

This is a similar question but I haven't been able to map it to my use case. Basically I want to use Dafny to prove a basic statement with nested quantifiers (for all X there exists Y) in first-order ...
0 votes
0 answers
35 views

I get passed manual user input and have to build format tests in SQL Server to check whether user input conforms to expected input. For example, an ID should start with two capital letters followed by ...
0 votes
2 answers
479 views

I am working with the Python API of Z3, because of convenience, but sometimes I need to convert my Python results into readable input for Z3/smt2. For instance, whenever I perform quantifier ...
0 votes
0 answers
109 views

I’m trying to export code from the Isabelle theorem prover using its code extraction tools. The code I’m trying to extract is based on an integrity constraint that returns a boolean value from a ...
gfs's user avatar
  • 1
0 votes
1 answer
167 views

Let C(x) be the statement "x has a cat," let D(x) be the statement "x has a dog," let F(x) be the statement "x has a ferret." Express each of these statements in terms of C(x), D(x), F(x), quantifiers,...
0 votes
1 answer
52 views

I found that the following paper/code (https://github.com/grigoryfedyukovich/aeval) solves Skolem function search for linear arithmetic. It performs really well. However, I would like to compute ...
0 votes
1 answer
50 views

Does quantifier elimination (QE) preserve equi-satisfiability or equivalence? I always thought QE preserves equi-satisfiability (and not equivalence) but in the book [Bradley, Manna], they say both ...
Theo Deep's user avatar
  • 786
0 votes
1 answer
126 views

I am concerned with whether there are algorithms (e.g., implemented in SMT solvers) that guarantee termination on the task of giving models of existential formulae; in the same way they guarantee ...
0 votes
1 answer
101 views

Consider the following Z3 definition of an array average function: IntSeqSort = SeqSort(IntSort()) sumArray = RecFunction('sumArray', IntSeqSort, IntSort()) sumArrayArg = FreshConst(IntSeqSort) ...
0 votes
1 answer
155 views

I want to check validity of a formula with the following quantifier alternation: ∃∀.φ Do I check validity of this formula if I solve Exists(exist_vars, ForAll(forall_vars, Phi)) in Z3Py? What is the ...
2 votes
1 answer
92 views

When I define data Foo a = Foo [a] then the type is of kind Foo :: * -> *. Having enabled PolyKinds and RankNTypes I'd like to explicitly quantify it with a more general kind signature Foo :: ...
0 votes
1 answer
130 views

Consider I have a formula with the shape: ∃a.∀b.∃c.∀d. Phi, where a,b,c,d belong to some first-order theory T that admits quantifier elimination. If I would like to get a model of this formula in Z3, ...
0 votes
1 answer
104 views

In Playing with Quantified Satisfaction they state as follows: Evaluating a quantified formula of the form ∃x∀y∃z∀u . F[x, y, z, u] can be naturally seen as a game between two parties: the ...
Theo Deep's user avatar
  • 786
0 votes
1 answer
176 views

This is my string : file_1234_test.pdf Task is to find the filename-without-extension and find the number. So the result should be : > Match 1 = file_1234_test.pdf > Group 1 = file_1234_test >...
0 votes
0 answers
103 views

I use this regular expression [\p{Greek}] to match any Greek character. It works as expected and matches the first Greek character on the line. However, I want to match all Greek characters that ...

15 30 50 per page
1
2 3 4 5
...
16

AltStyle によって変換されたページ (->オリジナル) /