Login / Signup
Variant Satisfiability of Parameterized Strings.
José Meseguer
Published in:
WRLA@ETAPS (2020)
Keyphrases
</>
satisfiability problem
computational complexity
finite alphabet
string matching
hamming distance
np complete
real time
finite automata
propositional logic
edit distance
databases
data sets
phase transition
temporal logic
variable length
knowledge base
pattern languages
database
terminological reasoning