An (almost) fuzzy logic of action and preferences, its quasi-model interpretations, and the problem of its decidability

被引:0
作者
Jobczyk, Krystian [1 ,2 ]
机构
[1] AGH Univ Sci & Technol, Al Mickiewicza 30, PL-30059 Krakow, Poland
[2] CUNY, Saul Kripke Ctr, 365 5th Ave, New York, NY 10016 USA
关键词
Logic of action and preferences; Fuzzy logic; Quasi-models; Decidability; TEMPORAL LOGIC;
D O I
10.1016/j.ijar.2023.109033
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The logical depiction of the concept of action forms a unique method of grasping its semantic content. It finds its reflection in different proposals of epistemic and deontic-logic systems describing actions as the operational behaviour of an agent as a game played over a given game tree. This perspective establishes some unique connection between actions and the agent's preferences. One of the logical-game-theoretic approaches to their modelling has been elaborated in van Benthem's school in the common area of game-theory, epistemic and fixed-point logic. In reference to some ideas of van Benthem's school - the article aims to propose a new (almost) fuzzy logic system AFLAP for actions and preferences describing a game-theoretic behaviour of an agent over a given game tree. Nevertheless, the backward induction strategy is idealised and exchanged for the Church-Rosser property, and a piece of fuzziness is introduced to the system by considering two unique 'epsilon' relations Move and BI, with their approximation sequences. An abstract model in the form of the so-called quasi-model is proposed for such a system. It forms a multi-level (potentially infinite) construction built due to the pattern recently elaborated and enhanced by Wolter-Kurucz's school. This construction is exploited in the article as a convenient basis for proving the decidability of AFLAP by showing its 'abstract' finite model property. This task is performed by constructing an additional workable quasi-model of the size dependent on the size of the set of subformulae of a given formula of AFLAP. Finally, some R-programming-oriented applications of the earlier theoretic considerations are presented.
引用
收藏
页数:32
相关论文
共 33 条
[1]  
[Anonymous], 2003, IJCAI
[2]  
[Anonymous], 1959, Journal of Symbolic Logic, DOI DOI 10.2307/2964568
[3]  
Carnap R., 1947, Meaning and Necessity
[4]  
Chellas B.F., 1969, The Logical Form of Imperatives
[5]  
Clarke E. M., 1981, LNCS, P52, DOI DOI 10.1007/BFB0025774
[6]   AUTOMATIC VERIFICATION OF FINITE-STATE CONCURRENT SYSTEMS USING TEMPORAL LOGIC SPECIFICATIONS [J].
CLARKE, EM ;
EMERSON, EA ;
SISTLA, AP .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1986, 8 (02) :244-263
[7]  
Ditmarsch H., 2003, AAMAS, P289
[8]  
Emerson E. A., 1980, Automata, Languages and Programming, Seventh Colloquium, P169
[9]  
Fagin R., 2003, REASONING KNOWLEDGE
[10]  
Fitch F. B., 1963, J SYMBOLIC LOGIC, V28, P135, DOI DOI 10.2307/2271594