CEisenhofer
|
79cdc91a75
|
Explicit formula for length computation of regexes
|
2026-06-28 14:14:52 +02:00 |
|
CEisenhofer
|
e983bc76d4
|
Try to do some processing already during assignments
|
2026-06-27 12:53:57 +02:00 |
|
CEisenhofer
|
c20bc0e631
|
First attempt for monadic decomposition
|
2026-06-05 18:40:36 +02:00 |
|
CEisenhofer
|
043c6c0ad1
|
Merge branch 'master' into c3
|
2026-06-03 17:33:26 +02:00 |
|
CEisenhofer
|
e74b235d87
|
Solve disequalities lazily
|
2026-05-27 17:25:39 +02:00 |
|
Nikolaj Bjorner
|
19166bd0b5
|
prepare for lambda unfolding in ho-matcher and selectively enable ho matching
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
|
2026-05-22 13:25:01 -07:00 |
|
CEisenhofer
|
5b3d734ecb
|
Fixed regex factorization again
|
2026-05-04 19:25:07 +02:00 |
|
CEisenhofer
|
a81ce477f5
|
Added classical regex factorization
|
2026-04-02 20:08:00 +02:00 |
|
CEisenhofer
|
b74f0bbb00
|
Signature splits
Fixed dot printing errorfor Skolems
|
2026-03-24 13:20:30 +01:00 |
|
Copilot
|
d53846d501
|
nseq: port ZIPT regex pre-check to fix benchmark discrepancy on regex-only problems (#8994)
* Initial plan
* Port ZIPT regex pre-check and DFS node budget to address nseq benchmark discrepancy
Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>
---------
Co-authored-by: copilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com>
Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>
|
2026-03-15 10:10:53 -07:00 |
|
CEisenhofer
|
e384e8f3d4
|
Added right-to-left rules
|
2026-03-13 17:25:14 +01:00 |
|
copilot-swe-agent[bot]
|
56e9e9df57
|
Add theory_seq_len: partial axiom instantiation for sequence length constraints
Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>
|
2026-03-10 18:02:04 +00:00 |
|
copilot-swe-agent[bot]
|
5003cece9d
|
Implement Parameter integration for theory_nseq (smt.nseq.max_depth)
Co-authored-by: CEisenhofer <56730610+CEisenhofer@users.noreply.github.com>
|
2026-03-04 15:45:55 +00:00 |
|
copilot-swe-agent[bot]
|
0bdec633d7
|
Implement ZIPT string solver skeleton (theory_nseq)
Add theory_nseq, a Nielsen-graph-based string solver plugin for Z3.
## New files
- src/smt/nseq_state.h/.cpp: constraint store bridging SMT context to
Nielsen graph with manual push/pop backtracking
- src/smt/nseq_regex.h/.cpp: regex membership handling via Brzozowski
derivatives (stub delegates to sgraph::brzozowski_deriv)
- src/smt/nseq_model.h/.cpp: model generation stub
- src/smt/theory_nseq.h/.cpp: main theory class implementing smt::theory
with its own private egraph/sgraph, returns FC_GIVEUP as skeleton
- src/test/nseq_basic.cpp: unit tests covering instantiation, parameter
validation, trivial-equality SAT, and node simplification
## Extensions to seq_nielsen.h/.cpp
- Add search_result enum and solve() iterative-deepening DFS entry point
- Add search_dfs() recursive DFS driver
- Add simplify_node(), generate_extensions(), collect_conflict_deps()
- Add nielsen_node::simplify_and_init(): trivial removal, empty
propagation, prefix matching, symbol clash detection
- Add nielsen_node::is_satisfied(), is_subsumed_by()
- Implement Det, Const Nielsen, and Eq-split modifiers in
generate_extensions()
## Integration
- smt_params.cpp: accept 'nseq' as valid string_solver value
- smt_params_helper.pyg: document 'nseq' option
- smt_setup.h/.cpp: add setup_nseq(), wire into setup_QF_S() and
setup_seq_str()
- smt/CMakeLists.txt: add new sources and smt_seq dependency
Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
|
2026-03-03 21:50:21 +00:00 |
|
Nikolaj Bjorner
|
fcd3a70c92
|
remove theory_str and classes that are only used by it
|
2025-08-07 21:05:12 -07:00 |
|
Nikolaj Bjorner
|
c387b20ac6
|
move smt params to params directory, update release.yml
|
2025-06-09 10:47:22 -07:00 |
|