AIML
2006
13 years 5 months ago
2006
AIML
2006
13 years 5 months ago
2006
AIML
2004
13 years 5 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
AIML
2004
13 years 5 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
AIML
2004
13 years 5 months ago
2004
In this paper we give the notion of modularity of a theory and analyze some of its properties, especially for the case of action theories in reasoning about actions. We propose alg...
AIML
2004
13 years 5 months ago
2004
AIML
2004
13 years 5 months ago
2004
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
AIML
2004
13 years 5 months ago
2004
In this paper we study the relation between two approaches to information change: Dynamic Epistemic Logic and Belief Revision. One of the main differences between these approaches...
AIML
2004
13 years 5 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
AIML
2004
13 years 5 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...