127
Voted
AIML
15 years 1 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...
103
Voted
AIML
15 years 1 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...
106
Voted
AIML
15 years 1 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...
84
Voted
AIML
15 years 1 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...
111
Voted
AIML
15 years 1 months ago
2004
abstract. Analytical investigations of agency are mostly concerned with a description ex post acto. However, continuous action (being doing something) needs to be considered as wel...
|
Logical Reasoning