65 search results - page 10 / 13 » About cut elimination for logics of common knowledge |
DLOG
2007
13 years 9 months ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
UAI
2003
13 years 8 months ago
2003
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
AGENTS
2001
Springer
13 years 11 months ago
2001
Springer
Agents are intended to interact in open systems where the knowledge about others (reputation) is incomplete and uncertain. Also, this knowledge about other agents is subjective si...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...