关于最小模型一阶推理的注解

HOWARD-60 Pub Date : 1900-01-01 DOI:10.29007/5bvp

D. Rydeheard, Jesús Héctor Domínguez Sánchez

{"title":"关于最小模型一阶推理的注解","authors":"D. Rydeheard, Jesús Héctor Domínguez Sánchez","doi":"10.29007/5bvp","DOIUrl":null,"url":null,"abstract":"In this note, we consider a notion of minimum model suitable for formulating a semantics of evolvable computing systems using a revision-based logic. We explore a range of proof systems for reasoning in the logic of minimum models and consider their application to the simulation of evolvable systems. Finally, we outline how these proof systems may be implemented in a logical framework.","PeriodicalId":422904,"journal":{"name":"HOWARD-60","volume":"521 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on first-order reasoning for minimum models\",\"authors\":\"D. Rydeheard, Jesús Héctor Domínguez Sánchez\",\"doi\":\"10.29007/5bvp\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this note, we consider a notion of minimum model suitable for formulating a semantics of evolvable computing systems using a revision-based logic. We explore a range of proof systems for reasoning in the logic of minimum models and consider their application to the simulation of evolvable systems. Finally, we outline how these proof systems may be implemented in a logical framework.\",\"PeriodicalId\":422904,\"journal\":{\"name\":\"HOWARD-60\",\"volume\":\"521 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"HOWARD-60\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29007/5bvp\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"HOWARD-60","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/5bvp","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这篇文章中，我们考虑了一个最小模型的概念，适合于使用基于修订的逻辑来表述可进化计算系统的语义。我们探索了最小模型逻辑推理的一系列证明系统，并考虑了它们在可进化系统模拟中的应用。最后，我们概述了如何在逻辑框架中实现这些证明系统。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A note on first-order reasoning for minimum models

In this note, we consider a notion of minimum model suitable for formulating a semantics of evolvable computing systems using a revision-based logic. We explore a range of proof systems for reasoning in the logic of minimum models and consider their application to the simulation of evolvable systems. Finally, we outline how these proof systems may be implemented in a logical framework.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

HOWARD-60

自引率

0.00%

发文量