886 search results - page 17 / 178 » Modal logic and invariance |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
JOLLI
2002
13 years 6 months ago
2002
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
AIML
2004
13 years 8 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...
APAL
2010
13 years 6 months ago
2010
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more prim...
FUIN
2000
13 years 6 months ago
2000
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...