52 search results - page 4 / 11 » Algorithmic correspondence and completeness in modal logic |
CADE
2010
Springer
13 years 9 months ago
2010
Springer
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
AIEDAM
1999
13 years 7 months ago
1999
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
APAL
2010
13 years 8 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...