A class of information logics with a decidable validity problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 291-302

  Demri, Stéphane ^a  

^a INPG IMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; EQUIVALENCE CLASSES;

ANALYSIS LOGIC; EQUIVALENCE RELATIONS; FILTRATION TECHNIQUES; FINITE MODEL PROPERTY; INFORMATION LOGIC;

COMPUTER CIRCUITS;

EID: 84947914744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_156     Document Type: Conference Paper

References (23)

1. Claudio Cerrato. Decidability by filtrations for graded normal logics (graded modalities V). Studia Logica, 53(1):61-73, 1994.
2. Stéphane Demri. The validity problem for the logic DALLA is decidable, 1996. To appear in the Bulletin of the Polish Academy of Sciences.
3. Stéphane Demri and Ewa Orlowska. Logical analysis of indiscernibility, 1996. In: Orlowska, Ewa (ed.), Reasoning with Incomplete Information. To appear.
4. Luis Fariñas del Cerro and Ewa Orlowska. DAL - A logic for data analysis. Theoretical Computer Science, 36:251-264, 1985. Corrigendum in T.C.S., 47:345, 1986.
5. Dov Gabbay. A general filtration method for modal logics. Journal of Philosophical Logic, 1:29-34, 1972.
6. George Gargov. Two completeness theorems in the logic for data analysis. Technical Report 581, Institute of Computer Science, Polish Academy of Sciences, Warsaw, 1986.
7. G. Hughes and Max Cresswell. An introduction to modal logic. Methuen and Co., 1968.
8. Joseph Halpern and Yoram Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
9. Beata Konikowska. A formal language for reasoning about indiscernibility. Bulletin of the Polish Academy of Sciences, 35:239-249, 1987.
10. Richard Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467-480, September 1977.
11. David Makinson. On some completeness theorems in modal logic. The Journal of Symbolic Logic, 12:379-384, 1966.
12. Maarten Marx, Szabolos Mikulás, and Istvan Németi. Taming Logic. Journal of Logic, Language and Information, 4:207-226, 1995.
13. Akira Nakamura. On a logic based on fuzzy modalities. In 22nd International Symposium on Multiple-Valued Logic, Sendai, pages 460-466. IEEE Computer Society Press, May 1992.
14. Akira Nakamura, On a logic based on graded modalities. IEICE Transactions, E76-D(5):527-532, May 1993.
15. Ewa Orlowska. Logic of indiscernibility relations. In Andrzej Skowron, editor, Computation Theory, 5th Symposium, Zaborów, Poland, pages 177-186. LNCS 208, Springer-Verlag, 1984.
16. Ewa Orłowska. Logic approach to information systems. Fundamenta Informaticae, 8:361-379, 1985.
17. Zdzislaw Pawlak. Information systems theoretical foundations. Information Systems, 6(3):205-218, 1981.
18. Zdzislaw Pawlak. Rough sets and fuzzy sets. Fuzzy sets and systems, 17:99-102, 1985.
19. Krister Segerberg. An essay in classical modal logic (three vols.). Technical Report Filosofiska Studier nr 13, Uppsala Universitet, 1971.
20. Dimiter Vakarelov. A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae, 15:61-79, 1991.
21. Dimiter Vakarelov. Modal logics for knowledge representation systems. Theoretical Computer Science, 90:433-456, 1991.
22. Ming-Sheng Ying. On standard models of fuzzy modal logics. Fuzzy sets and systems, 26:357-363, 1988.
23. Lofti Zadeh. Similarity relations and fuzzy orderings. Information Systems, 3:177-200, 1971.