2920 search results - page 42 / 584 » Finite information logic |
110
click to vote
FUIN
2000
14 years 11 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...
FUIN
2007
14 years 11 months ago
2007
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
100
click to vote
ISMIS
1994
Springer
15 years 3 months ago
1994
Springer
We assume that safety of information stored in a database depends on the reliability of the agents who have performed the insertions in the database. We present a logic S to repres...
FSS
2006
14 years 11 months ago
2006
The paper proposes a formal delimitation of the class of `fuzzy logics' and answers some objections that can be raised against the definition; the focus is put on informal an...
SAS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...