Variant Satisfiability of Parameterized Strings

DOI10.1007/978-3-030-63595-4_6MaRDI QIDQ6486037zbMATH OpenFDO

Authors José Meseguer

Publication date 22 December 2022

Published in 1517.68165 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-63595-4_6

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Recommendations

• An efficient SMT solver for string constraints
• Variant-Based Satisfiability in Initial Algebras
• On the parameterised complexity of string morphism problems
• On the parameterised complexity of string morphism problems
• Constraint reasoning over strings
• Parameterized complexity of fixed variable logics
• Variant-based decidable satisfiability in initial algebras with predicates
• Computational and proof complexity of partial string avoidability
• scientific article; zbMATH DE number 6851884
• Constraint solving on bounded string variables

Cited in

(3)

• Metalevel algorithms for variant satisfiability
• Variant-Based Satisfiability in Initial Algebras
• Solving String Theories Involving Regular Membership Predicates Using SAT

This page was built for publication: Variant Satisfiability of Parameterized Strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6486037)