-
1
-
-
84947913636
-
A modal logic for data analysis
-
W. Penczek, A. Szalas (Eds.), 21st Symp. on Mathematical Foundations of Computer Sciences (MFCS'96), Krakow, Springer, Berlin
-
P. Balbiani, A modal logic for data analysis, in: W. Penczek, A. Szalas (Eds.), 21st Symp. on Mathematical Foundations of Computer Sciences (MFCS'96), Krakow, Lecture Notes in Computer Science, vol. 1113, Springer, Berlin, 1996, pp. 167-179.
-
(1996)
Lecture Notes in Computer Science
, vol.1113
, pp. 167-179
-
-
Balbiani, P.1
-
2
-
-
0346662163
-
Axiomatization of logics based on Kripke models with relative accessibility relations
-
E. Orłowska (Ed.), Springer, to appear
-
P. Balbiani, Axiomatization of logics based on Kripke models with relative accessibility relations, in: E. Orłowska (Ed.), Rough Set Systems for Modelling and Processing Incomplete Information, Springer, 1997, to appear.
-
(1997)
Rough Set Systems for Modelling and Processing Incomplete Information
-
-
Balbiani, P.1
-
3
-
-
0002781743
-
Correspondence theory
-
D. Gabbay, F. Günthner (Eds.), Reidel, Dordrecht
-
J. van Benthem, Correspondence theory, in: D. Gabbay, F. Günthner (Eds.), Handbook of Philosophical Logic, vol. II, Reidel, Dordrecht, 1984, pp. 167-247.
-
(1984)
Handbook of Philosophical Logic
, vol.2
, pp. 167-247
-
-
Van Benthem, J.1
-
4
-
-
0346662161
-
Decidability by filtrations for graded normal logics (graded modalities V)
-
C. Cerrato, Decidability by filtrations for graded normal logics (graded modalities V), Studia Logica 53 (1) (1994) 61-73.
-
(1994)
Studia Logica
, vol.53
, Issue.1
, pp. 61-73
-
-
Cerrato, C.1
-
5
-
-
0348224319
-
Viewing hypothesis theories as constrained graded theories
-
C. MacNish, D. Pearce, L. Pereira (Eds.), JELIA-4, Springer, Berlin
-
P. Chatalic, Viewing hypothesis theories as constrained graded theories, in: C. MacNish, D. Pearce, L. Pereira (Eds.), JELIA-4, Lecture Notes in Artificial Intelligence, vol. 838, Springer, Berlin, 1994, pp. 261-278.
-
(1994)
Lecture Notes in Artificial Intelligence
, vol.838
, pp. 261-278
-
-
Chatalic, P.1
-
6
-
-
84947914744
-
A class of information logics with a decidable validity problem
-
W. Penczek, A. Szalas (Eds.), 21st Symp. on Mathematical Foundations of Computer Sciences (MFCS'96), Krakow, Springer, Berlin
-
St. Demri, A class of information logics with a decidable validity problem, in: W. Penczek, A. Szalas (Eds.), 21st Symp. on Mathematical Foundations of Computer Sciences (MFCS'96), Krakow, Lecture Notes in Computer Science, vol. 1113, Springer, Berlin, 1996, pp. 291-302.
-
(1996)
Lecture Notes in Computer Science
, vol.1113
, pp. 291-302
-
-
Demri, S.1
-
7
-
-
0038049444
-
The validity problem for the logic DALLA is decidable
-
St. Demri, The validity problem for the logic DALLA is decidable, Bull. Polish Academy Sci. 44 (1) (1996) 79-86.
-
(1996)
Bull. Polish Academy Sci.
, vol.44
, Issue.1
, pp. 79-86
-
-
St Demri1
-
8
-
-
85033923577
-
Logical analysis of indiscernibility
-
E. Orłowska (Ed.), Springer, Berlin, to appear
-
St. Demri, E. Orłowska, Logical analysis of indiscernibility, in: E. Orłowska (Ed.), Rough Set Systems for Modelling and Processing Incomplete Information, Springer, Berlin, 1997, to appear.
-
(1997)
Rough Set Systems for Modelling and Processing Incomplete Information
-
-
St Demri1
Orłowska, E.2
-
9
-
-
0003730235
-
-
The MIT Press, Cambridge, MA
-
R. Fagin, J. Halpern, Y. Moses, M. Vardi, Reasoning About Knowledge, The MIT Press, Cambridge, MA, 1995.
-
(1995)
Reasoning about Knowledge
-
-
Fagin, R.1
Halpern, J.2
Moses, Y.3
Vardi, M.4
-
10
-
-
0022047840
-
DAL - A logic for data analysis
-
Corrigendum in Theoret. Comput. Sci. 47 (1986) 345
-
L. Farinas del Cerro, E. Orłowska, DAL - A logic for data analysis, Theoret. Comput. Sci. 36 (1985) 251-264. Corrigendum in Theoret. Comput. Sci. 47 (1986) 345.
-
(1985)
Theoret. Comput. Sci.
, vol.36
, pp. 251-264
-
-
Farinas Del Cerro, L.1
Orłowska, E.2
-
11
-
-
0040307264
-
A general filtration method for modal logics
-
D. Gabbay, A general filtration method for modal logics, J. Philos. Logic 1 (1972) 29-34.
-
(1972)
J. Philos. Logic
, vol.1
, pp. 29-34
-
-
Gabbay, D.1
-
12
-
-
0012177856
-
-
Tech. Report 581, Institute of Computer Science, Polish Academy of Sciences, Warsaw
-
G. Gargov, Two completeness theorems in the logic for data analysis, Tech. Report 581, Institute of Computer Science, Polish Academy of Sciences, Warsaw, 1986.
-
(1986)
Two Completeness Theorems in the Logic for Data Analysis
-
-
Gargov, G.1
-
13
-
-
0003198753
-
Logics of Time and Computation
-
CSLI Stanford, 2d ed.
-
R. Goldblatt, Logics of Time and Computation, Lecture Notes 7, CSLI Stanford, 2d ed., 1992.
-
(1992)
Lecture Notes
, vol.7
-
-
Goldblatt, R.1
-
14
-
-
0026853865
-
A guide to completeness and complexity for modal logics of knowledge and belief
-
J. Halpern, Y. Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54 (1992) 319-379.
-
(1992)
Artificial Intelligence
, vol.54
, pp. 319-379
-
-
Halpern, J.1
Moses, Y.2
-
15
-
-
25744441968
-
Graded modalities in epistemic logic
-
W. van der Hoek, J.-J. Meyer, Graded modalities in epistemic logic, Logique Analyse 133-134 (1991) 251-270.
-
(1991)
Logique Analyse
, vol.133-134
, pp. 251-270
-
-
Van Der Hoek, W.1
Meyer, J.-J.2
-
18
-
-
0012035490
-
A formal language for reasoning about indiscernibility
-
B. Konikowska, A formal language for reasoning about indiscernibility, Bull. Polish Academy Sci. 35 (1987) 239-249.
-
(1987)
Bull. Polish Academy Sci.
, vol.35
, pp. 239-249
-
-
Konikowska, B.1
-
19
-
-
0000106182
-
A logic for reasoning about relative similarity
-
B. Konikowska, A logic for reasoning about relative similarity, Studia Logica 58(1) (1997) 185-226.
-
(1997)
Studia Logica
, vol.58
, Issue.1
, pp. 185-226
-
-
Konikowska, B.1
-
20
-
-
0000595575
-
The computational complexity of provability in systems of modal propositional logic
-
R. Ladner, The computational complexity of provability in systems of modal propositional logic SIAM J. Comput. 6(3) (1977) 467-480.
-
(1977)
SIAM J. Comput.
, vol.6
, Issue.3
, pp. 467-480
-
-
Ladner, R.1
-
21
-
-
0000982840
-
3 is undecidable
-
3 is undecidable, J. Symbolic Logic 45(2) (1980) 311-316.
-
(1980)
J. Symbolic Logic
, vol.45
, Issue.2
, pp. 311-316
-
-
Maddux, R.1
-
22
-
-
0000646416
-
On some completeness theorems in modal logic
-
D. Makinson, On some completeness theorems in modal logic, J. Symbolic Logic 12 (1966) 379-384.
-
(1966)
J. Symbolic Logic
, vol.12
, pp. 379-384
-
-
Makinson, D.1
-
24
-
-
0003440813
-
-
Ph.D. Thesis, Amsterdam University, Intstitute for Logic, Language and Computation, September
-
S. Mikulás, Taming logics, Ph.D. Thesis, Amsterdam University, Intstitute for Logic, Language and Computation, September 1995.
-
(1995)
Taming Logics
-
-
Mikulás, S.1
-
25
-
-
0026867066
-
On a logic based on fuzzy modalities
-
Sendai, IEEE Computer Society Press, Silver Spring, MD
-
A. Nakamura, On a logic based on fuzzy modalities, in: 22nd Internat. Symp. on Multiple-Valued Logic, Sendai, IEEE Computer Society Press, Silver Spring, MD, 1992, pp. 460-466.
-
(1992)
22nd Internat. Symp. on Multiple-Valued Logic
, pp. 460-466
-
-
Nakamura, A.1
-
26
-
-
0027599261
-
On a logic based on graded modalities
-
A. Nakamura, On a logic based on graded modalities, IEICE Trans. E76-D(5) (1993) 527-532.
-
(1993)
IEICE Trans.
, vol.E76-D
, Issue.5
, pp. 527-532
-
-
Nakamura, A.1
-
27
-
-
84992397806
-
Logic of indiscernibility relations
-
A. Skowron (Ed.), Computation Theory, 5th Symp., Zaborów, Poland, Springer, Berlin
-
E. Orłowska, Logic of indiscernibility relations, in: A. Skowron (Ed.), Computation Theory, 5th Symp., Zaborów, Poland, Lecture Notes in Computer Science, vol. 208, Springer, Berlin, 1984, pp. 177-186.
-
(1984)
Lecture Notes in Computer Science
, vol.208
, pp. 177-186
-
-
Orłowska, E.1
-
28
-
-
25744477997
-
Logic approach to information systems
-
E. Orłowska, Logic approach to information systems Fundam. Inform. 8 (1985) 361-379.
-
(1985)
Fundam. Inform.
, vol.8
, pp. 361-379
-
-
Orłowska, E.1
-
29
-
-
0003512921
-
Kripke models with relative accessibility and their applications to inferences from incomplete information
-
G. Mirkowska, H. Rasiowa (Eds.), Banach Center Publications, PWN - Polish Scientific Publishers, Warsaw
-
E. Orłowska, Kripke models with relative accessibility and their applications to inferences from incomplete information, in: G. Mirkowska, H. Rasiowa (Eds.), Mathematical Problems in Computation Theory, Banach Center Publications, vol. 21, PWN - Polish Scientific Publishers, Warsaw, 1988, pp. 329-339.
-
(1988)
Mathematical Problems in Computation Theory
, vol.21
, pp. 329-339
-
-
Orłowska, E.1
-
30
-
-
84981422039
-
Logic for reasoning about knowledge
-
E. Orłowska, Logic for reasoning about knowledge, Z. Math. Logik Grundlagen Math. 35 (1989) 559-568.
-
(1989)
Z. Math. Logik Grundlagen Math.
, vol.35
, pp. 559-568
-
-
Orłowska, E.1
-
31
-
-
0021434873
-
Expressive power of knowledge representation systems
-
E. Orłowska, Z. Pawlak, Expressive power of knowledge representation systems, Int. J. Man-Machines Stud. 20 (1984) 485-500.
-
(1984)
Int. J. Man-Machines Stud.
, vol.20
, pp. 485-500
-
-
Orłowska, E.1
Pawlak, Z.2
-
32
-
-
0347922723
-
Coverings by classes of permutable equivalence relations
-
E.A. Palyutin, Coverings by classes of permutable equivalence relations, Algebra Logic 34(3) (1995) 173-176.
-
(1995)
Algebra Logic
, vol.34
, Issue.3
, pp. 173-176
-
-
Palyutin, E.A.1
-
33
-
-
0019699783
-
Information systems theoretical foundations
-
Z. Pawlak, Information systems theoretical foundations, Inform. Systems 6(3) (1981) 205-218.
-
(1981)
Inform. Systems
, vol.6
, Issue.3
, pp. 205-218
-
-
Pawlak, Z.1
-
35
-
-
85015196509
-
Rough sets and fuzzy sets
-
Z. Pawlak, Rough sets and fuzzy sets, Fuzzy Sets and Systems 17 (1985) 99-102.
-
(1985)
Fuzzy Sets and Systems
, vol.17
, pp. 99-102
-
-
Pawlak, Z.1
-
37
-
-
0003507283
-
-
three vols., Tech. Report Filosofiska Studier nr 13, Uppsala Universitet
-
K. Segerberg, An essay in classical modal logic (three vols.), Tech. Report Filosofiska Studier nr 13, Uppsala Universitet, 1971.
-
(1971)
An Essay in Classical Modal Logic
-
-
Segerberg, K.1
-
38
-
-
0002878615
-
A modal logic for similarity relations in Pawlak knowledge representation systems
-
D. Vakarelov, A modal logic for similarity relations in Pawlak knowledge representation systems, Fundam. Inform. 15 (1991) 61-79.
-
(1991)
Fundam. Inform.
, vol.15
, pp. 61-79
-
-
Vakarelov, D.1
-
39
-
-
0026259028
-
Modal logics for knowledge representation systems
-
D. Vakarelov, Modal logics for knowledge representation systems, Theort. Comput. Sci. 90 (1991) 433-456.
-
(1991)
Theort. Comput. Sci.
, vol.90
, pp. 433-456
-
-
Vakarelov, D.1
-
40
-
-
0346031134
-
Information systems, similarity and modal logics
-
E. Orłowska (Ed.), Springer, Berlin, to appear
-
D. Vakarelov, Information systems, similarity and modal logics, in: E. Orłowska (Ed.), Rough Set Systems for Modelling and Processing Incomplete Information, Springer, Berlin, 1997, to appear.
-
(1997)
Rough Set Systems for Modelling and Processing Incomplete Information
-
-
Vakarelov, D.1
-
41
-
-
85033915453
-
A multi-modal logic for defeasible reasoning
-
to appear
-
A. Waaler, A multi-modal logic for defeasible reasoning, Theoria, to appear.
-
Theoria
-
-
Waaler, A.1
-
42
-
-
0003918299
-
-
Ph.D. Thesis, University of Berlin, August
-
F. Wolter, Lattices of modal logics. Ph.D. Thesis, University of Berlin, August 1993.
-
(1993)
Lattices of Modal Logics
-
-
Wolter, F.1
-
43
-
-
0013396131
-
On standard models of fuzzy modal logics
-
M.-S. Ying, On standard models of fuzzy modal logics, Fuzzy Sets and Systems 26 (1988) 357-363.
-
(1988)
Fuzzy Sets and Systems
, vol.26
, pp. 357-363
-
-
Ying, M.-S.1
-
44
-
-
49649152119
-
Similarity relations and fuzzy orderings
-
L. Zadeh, Similarity relations and fuzzy orderings, Inform. Systems 3 (1971) 177-200.
-
(1971)
Inform. Systems
, vol.3
, pp. 177-200
-
-
Zadeh, L.1
|