首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14篇
  免费   0篇
  2007年   2篇
  2006年   4篇
  2005年   1篇
  2002年   2篇
  2001年   3篇
  1998年   1篇
  1994年   1篇
排序方式: 共有14条查询结果,搜索用时 15 毫秒
11.
12.
Computers are increasingly present in education and make manyresources and activities available to teachers and pupils. Newpedagogical resources development is very interesting for both.Our digital library Summa Logicae is overtly involved in innovationand pedagogical systematization. It includes some software toolsfor teaching logic developed by computer science students, andin this article we present two of these tools. The MAFIA toolis especially attractive for first year students and helps themto understand the basic concepts of logic in an interactiveway using sematic tableaux. It also allows them to solve thecrazy cases in Mafia which their fellow students from previousyears proposed. The Modelos de Kripke tool, oriented to a moreadvanced level, serves for understanding the link between theproperties of the accessibility relation and the modal formulas,which is at the basis of the current developments of modal logic.  相似文献   
13.
Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the use of modal operators indexed by the terms of the logics. Thus, one can quantify over variables occurring in modal operators. In term-modal logics agents can be represented by terms, and knowledge of agents is expressed with formulas within the scope of modal operators.This gives us a flexible and uniform language for reasoning about the agents themselves and their knowledge. This article gives examples of the expressiveness of the languages and provides sequent-style and tableau-based proof systems for the logics. Furthermore we give proofs of soundness and completeness with respect to the possible world semantics.  相似文献   
14.
Multi-valued Calculi for Logics Based on Non-determinism   总被引:2,自引:0,他引:2  
  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号