QUINTIC learns deterministic quantitative automata from preference queries using SMT-based conjectures over variable equivalences, with claimed guarantees of completeness and minimalism.
ACM Transactions on Human-Robot Interaction13(2), 1–27 (2024)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Learning Quantitative Automata Modulo Theories
QUINTIC learns deterministic quantitative automata from preference queries using SMT-based conjectures over variable equivalences, with claimed guarantees of completeness and minimalism.