Sciweavers

FUIN
2000
115views more  FUIN 2000»
13 years 9 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen
AIML
2004
13 years 10 months ago
On the Complexity of Fragments of Modal Logics
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...
Linh Anh Nguyen