Model of decidable introspective reasoning with quantifying-in

被引:0
|
作者
机构
来源
| 1600年 / Morgan Kaufmann Publ Inc, San Mateo, CA, USA卷 / 01期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] A model for relational reasoning as verbal reasoning
    Krumnack, Antje
    Bucher, Leandra
    Nejasmic, Jelica
    Nebel, Bernhard
    Knauff, Markus
    COGNITIVE SYSTEMS RESEARCH, 2011, 12 (3-4) : 377 - 392
  • [43] Quantitative model checking revisited: Neither decidable nor approximable
    Giro, Sergio
    D'Argenio, Pedro R.
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2007, 4763 : 179 - +
  • [44] A class of mechanically decidable problems beyond Tarski's model
    Lu YANG~(1
    2 Institute of Theoretical Computing
    Science China Mathematics, 2007, (11) : 1611 - 1620
  • [45] A class of mechanically decidable problems beyond Tarski's model
    Yang, Lu
    Feng, Yong
    Yao, Yong
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2007, 50 (11): : 1611 - 1620
  • [46] Model checking LTL over controllable linear systems is decidable
    Tabuada, P
    Pappas, GJ
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, PROCEEDINGS, 2003, 2623 : 498 - 513
  • [47] A class of mechanically decidable problems beyond Tarski’s model
    Lu Yang
    Yong Feng
    Yong Yao
    Science in China Series A: Mathematics, 2007, 50 : 1611 - 1620
  • [48] Decidable Model-Checking for a Resource Logic with Production of Resources
    Alechina, Natasha
    Logan, Brian
    Hoang Nga Nguyen
    Raimondi, Franco
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 9 - +
  • [49] The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas
    Goncharov, S. S.
    Marchuk, M., I
    ALGEBRA AND LOGIC, 2021, 60 (03) : 200 - 206
  • [50] The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas
    S. S. Goncharov
    M. I. Marchuk
    Algebra and Logic, 2021, 60 : 200 - 206