论文信息 - Accomplishable Tasks in Knowledge Representation

Accomplishable Tasks in Knowledge Representation

Knowledge Representation (KR) is traditionally based on the logic of facts, expressed in boolean logic. However, facts about an agent can also be seen as a set of accomplished tasks by the agent. This paper proposes a new approach to KR: the notion of task logical KR based on Computability Logic. This notion allows the user to represent both accomplished tasks and accomplishable tasks by the agent. This notion allows us to build sophisticated KRs about many interesting agents, which have not been supported by previous logical languages.

Keehang Kwon | Mi-Young Park

[1] Frank Pfenning,et al. Efficient Resource Management for Linear Logic Proof Search , 1996, ELP.

[2] Gopalan Nadathur,et al. Programming with Higher-Order Logic , 2012 .

[3] Gopalan Nadathur,et al. A Logic Programming Approach to Manipulating Formulas and Programs , 1987, SLP.

[4] Patrick Lincoln,et al. Linear logic , 1992, SIGA.

[5] Giorgi Japaridze,et al. Introduction to computability logic , 2003, Ann. Pure Appl. Log..

[6] Giorgi Japaridze,et al. Sequential operators in computability logic , 2007, Inf. Comput..

[7] 番原睦則,et al. Design and implementation of linear logic programming languages , 2002 .

[8] Dale Miller,et al. Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[9] Frank Pfenning,et al. Efficient resource management for linear logic proof search , 1996, Theor. Comput. Sci..

[10] Dae-Seong Kang,et al. Extending LogicWeb via Hereditary Harrop Formulas , 2008, IEICE Trans. Inf. Syst..

[11] Giorgi Japaridze,et al. The logic of tasks , 2002, Ann. Pure Appl. Log..