Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

DALT

2005

Springer

2005

Springer

An agent who bases his actions upon explicit logical formulae has at any given point in time a ﬁnite set of formulae he has computed. Closure or consistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that agents represent their knowledge syntactically, and that they can only know ﬁnitely many formulae at a given time. In order to express interesting properties of such ﬁnite syntactic epistemic states, we extend the standard epistemic language with an operator expressing that an agent knows at most a particular ﬁnite set of formulae, and investigate axiomatization of the resulting logic. This syntactic operator has also been studied elsewhere without the assumption about ﬁnite epistemic states [5]. A strongly complete logic is impossible, and the main results are non-trivial characteriza...

Related Content

Added |
26 Jun 2010 |

Updated |
26 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
DALT |

Authors |
Thomas Ågotnes, Michal Walicki |

Comments (0)