Download PDFOpen PDF in browser

A note on first-order reasoning for minimum models

17 pagesPublished: February 12, 2014

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.

In: Andrei Voronkov and Margarita Korovina (editors). HOWARD-60. A Festschrift on the Occasion of Howard Barringer's 60th Birthday, vol 42, pages 289--305

Links:
BibTeX entry
@inproceedings{HOWARD-60:note_on_first_order_reasoning,
  author    = {David Rydeheard and Jes\textbackslash{}'us H\textbackslash{}'ector Dom\textbackslash{}'inguez S\textbackslash{}'anchez},
  title     = {A note on first-order reasoning for minimum models},
  booktitle = {HOWARD-60. A Festschrift on the Occasion of Howard Barringer's 60th Birthday},
  editor    = {Andrei Voronkov and Margarita Korovina},
  series    = {EPiC Series in Computing},
  volume    = {42},
  pages     = {289--305},
  year      = {2014},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/LDCX},
  doi       = {10.29007/5bvp}}
Download PDFOpen PDF in browser