903 search results - page 7 / 181 » Completeness Results for Memory Logics |
JANCL
2007
13 years 7 months ago
2007
In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we ...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
JANCL
2008
13 years 7 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
JAIR
2011
13 years 2 months ago
2011
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
ATAL
2004
Springer
14 years 26 days ago
2004
Springer
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...