Adaptive Reactive Synthesis for LTL and LTLf Modulo Theories

被引:0
|
作者
Rodriguez, Andoni [1 ,2 ]
Sanchez, Cesar [1 ]
机构
[1] IMDEA Software Inst, Madrid, Spain
[2] Univ Politecn Madrid, Madrid, Spain
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Reactive synthesis is the process of generate correct controllers from temporal logic specifications. Typically, synthesis is restricted to Boolean specifications in LTL. Recently, a Boolean abstraction technique allows to translate LTLT specifications that contain literals in theories into equi-realizable LTL specifications, but no full synthesis procedure exists yet. In synthesis modulo theories, the system receives valuations of environment variables (from a first-order theory T) and outputs valuations of system variables from T. In this paper, we address how to syntheize a full controller using a combination of the static Boolean controller obtained from the Booleanized LTL specification together with on-the-fly queries to a solver that produces models of satisfiable existential T formulae. This is the first synthesis method for LTL modulo theories. Additionally, our method can produce adaptive responses which increases explainability and can improve runtime properties like performance. Our approach is applicable to both LTL modulo theories and LTLf modulo theories.
引用
收藏
页码:10679 / 10686
页数:8
相关论文
共 50 条
  • [41] Answer Set Programming Modulo Theories
    Wang, Yisong
    Zhang, Mingyi
    APPLIED INFORMATICS AND COMMUNICATION, PT 5, 2011, 228 : 655 - +
  • [42] Motion Planning with Satisfiability Modulo Theories
    Hung, William N. N.
    Song, Xiaoyu
    Tan, Jindong
    Li, Xiaojuan
    Zhang, Jie
    Wang, Rui
    Gao, Peng
    2014 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2014, : 113 - 118
  • [43] Clausal Presentation of Theories in Deduction Modulo
    高建华
    Journal of Computer Science & Technology, 2013, 28 (06) : 1085 - 1096
  • [44] Personnel Scheduling as Satisfiability Modulo Theories
    Erkinger, Christoph
    Musliu, Nysret
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 614 - 621
  • [45] OptiMathSAT: A Tool for Optimization Modulo Theories
    Sebastiani, Roberto
    Trentin, Patrick
    COMPUTER AIDED VERIFICATION, PT I, 2015, 9206 : 447 - 454
  • [46] A progressive simplifier for satisfiability modulo theories
    Sheini, Hossein M.
    Sakallah, Karem A.
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 184 - 197
  • [47] Splitting on demand in SAT modulo theories
    Barrett, Clark
    Nieuwenhuis, Robert
    Oliveras, Albert
    Tinelli, Cesare
    Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings, 2006, 4246 : 512 - 526
  • [48] Combined satisfiability modulo parametric theories
    Krstic, Sava
    Goel, Amit
    Grundy, Jim
    Tinelli, Cesare
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2007, 4424 : 602 - +
  • [49] An abstract framework for satisfiability modulo theories
    Tinelli, Cesare
    Automated Reasoning with Analytic Tableaux and Related Methods, Proceedings, 2007, 4548 : 10 - 10
  • [50] Temporal Stream Logic modulo Theories
    Finkbeiner, Bernd
    Heim, Philippe
    Passing, Noemi
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2022), 2022, 13242 : 325 - 346