On Hierarchical Reasoning in Combinations of Theories

被引:0
|
作者
Ihlemann, Carsten [1 ]
Sofronie-Stokkermans, Viorica [1 ]
机构
[1] Max Planck Inst Informat, Saarbrucken, Germany
来源
AUTOMATED REASONING | 2010年 / 6173卷
关键词
LOCAL THEORY EXTENSIONS; UNIFORM WORD-PROBLEMS; SATISFIABILITY; COMPLEXITY; EQUALITY;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and modular reasoning is possible. We use a notion of locality of a theory extension parameterized by a closure operator on ground terms. We give criteria for recognizing these types of theory extensions. We then show that combinations of extensions of theories which are local in this extended sense also have a locality property and hence allow modular and hierarchical reasoning. We thus obtain parameterized decidability and complexity results for many (combinations of) theories important in verification.
引用
收藏
页码:30 / 45
页数:16
相关论文
共 50 条
  • [1] Hierarchical reasoning in local theory extensions and applications
    Sofronie-Stokkermans, Viorica
    16TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2014), 2014, : 34 - 41
  • [2] Inconsistency-tolerant temporal reasoning with hierarchical information
    Kamide, Norihiro
    INFORMATION SCIENCES, 2015, 320 : 140 - 155
  • [3] A Framework for Hierarchical Perception-Action Learning Utilizing Fuzzy Reasoning
    Windridge, David
    Felsberg, Michael
    Shaukat, Affan
    IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (01) : 155 - 169
  • [4] Situativity: a family of social cognitive theories for understanding clinical reasoning and diagnostic error
    Merkebu, Jerusalem
    Battistone, Michael
    McMains, Kevin
    McOwen, Kathrine
    Witkop, Catherine
    Konopasky, Abigail
    Torre, Dario
    Holmboe, Eric
    Durning, Steven J.
    DIAGNOSIS, 2020, 7 (03) : 169 - 176
  • [7] TRACTABLE COMBINATIONS OF TEMPORAL CSPS
    Bodirsky, Manuel
    Greiner, Johannes
    Rydval, Jakub
    LOGICAL METHODS IN COMPUTER SCIENCE, 2022, 18 (02)
  • [8] Modeling and Verifying Inconsistency-Tolerant Temporal Reasoning with Hierarchical Information: Dealing with Students' Learning Processes
    Kamide, Norihiro
    2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, : 1859 - 1864
  • [9] The Complexity of Reasoning for Fragments of Autoepistemic Logic
    Creignou, Nadia
    Meier, Arne
    Vollmer, Heribert
    Thomas, Michael
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2012, 13 (02)
  • [10] IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?
    Mosse, Milan
    Ibeling, Duligur
    Icard, Thomas
    REVIEW OF SYMBOLIC LOGIC, 2024, 17 (01) : 106 - 131