{"title":"对象和过程的逻辑模型","authors":"W. P. Coleman","doi":"10.1109/SIMSYM.1991.151515","DOIUrl":null,"url":null,"abstract":"This paper discusses the properties of certain languages for expressing and reasoning about physical or biological, manufacturing, or computational systems. These languages resemble those of symbolic logic and support formal procedures for interpretation and inference. The focus is on two aspects of such languages: on the relation between a physical object or system and the processes that run on it; and on the sense in which knowledge-bases can have languages that differ in expressive power. Objects or processes can be modeled by the action of a category C based on a finite directed graph G whose arrows are inputs or programs, respectively. An action D is a simplification of C if there is a left-invertible functor F:D to C. Thus, a system supports a lattice of processes, in which linguistic structures can be semantically interpreted.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Logical models of objects and of processes\",\"authors\":\"W. P. Coleman\",\"doi\":\"10.1109/SIMSYM.1991.151515\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses the properties of certain languages for expressing and reasoning about physical or biological, manufacturing, or computational systems. These languages resemble those of symbolic logic and support formal procedures for interpretation and inference. The focus is on two aspects of such languages: on the relation between a physical object or system and the processes that run on it; and on the sense in which knowledge-bases can have languages that differ in expressive power. Objects or processes can be modeled by the action of a category C based on a finite directed graph G whose arrows are inputs or programs, respectively. An action D is a simplification of C if there is a left-invertible functor F:D to C. Thus, a system supports a lattice of processes, in which linguistic structures can be semantically interpreted.<<ETX>>\",\"PeriodicalId\":174131,\"journal\":{\"name\":\"[1991] Proceedings of the 24th Annual Simulation Symposium\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 24th Annual Simulation Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.1991.151515\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 24th Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.1991.151515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
本文讨论了用于表达和推理物理或生物、制造或计算系统的某些语言的特性。这些语言类似于符号逻辑的语言,支持解释和推理的形式过程。重点放在这类语言的两个方面:物理对象或系统与在其上运行的进程之间的关系;在这个意义上,知识库可以有不同的表达能力的语言。对象或过程可以通过基于有限有向图G的类别C的作用来建模,其箭头分别是输入或程序。如果存在左可逆函子F:D to C,则动作D是C的简化。因此,系统支持过程格,其中语言结构可以在语义上解释
This paper discusses the properties of certain languages for expressing and reasoning about physical or biological, manufacturing, or computational systems. These languages resemble those of symbolic logic and support formal procedures for interpretation and inference. The focus is on two aspects of such languages: on the relation between a physical object or system and the processes that run on it; and on the sense in which knowledge-bases can have languages that differ in expressive power. Objects or processes can be modeled by the action of a category C based on a finite directed graph G whose arrows are inputs or programs, respectively. An action D is a simplification of C if there is a left-invertible functor F:D to C. Thus, a system supports a lattice of processes, in which linguistic structures can be semantically interpreted.<>