Model checking and validity in propositional and modal inclusion logics

Autor: Jonni Virtema, Lauri Hella, Antti Kuusisto, Arne Meier
Přispěvatelé: Larsen, Kim G., Bodlaender, Hans L., Raskin, Jean-Francois, Department of Mathematics and Statistics, Informaatioteknologian ja viestinnän tiedekunta - Faculty of Information Technology and Communication Sciences, Tampere University, Luonnontieteiden tiedekunta - Faculty of Natural Sciences, University of Tampere
Rok vydání: 2019
Předmět:
Inclusion logic
FOS: Computer and information sciences
Complexity bounds
Computer Science - Logic in Computer Science
Model checking
Normal modal logic
02 engineering and technology
01 natural sciences
Reasoning problems
Computer Science::Logic in Computer Science
0202 electrical engineering
electronic engineering
information engineering
111 Mathematics
Calculus
Accessibility relation
10. No inequality
Mathematics
Propositional variable
Matematiikka - Mathematics
Modal logic
Semantics
010201 computation theory & mathematics
Hardware and Architecture
020201 artificial intelligence & image processing
Semantics
Complexity
T-norm fuzzy logics
Logic
0102 computer and information sciences
Theoretical Computer Science
Arts and Humanities (miscellaneous)
Monoidal t-norm logic
Tietojenkäsittely ja informaatiotieteet - Computer and information sciences
0101 mathematics
Reasoning problems
Model checking
Konferenzschrift
Discrete mathematics
000 Computer science
knowledge
general works
010102 general mathematics
Classical logic
Complexity
113 Computer and information sciences
Computer circuits
model checking
Logic in Computer Science (cs.LO)
validity problem
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
team semantics
Computer Science
Kripke semantics
ddc:004
complexity
Software
Inclusion Logic
Zdroj: Leibniz International Proceedings in Informatics, LIPIcs 83 (2017)
Article
ISSN: 1465-363X
0955-792X
Popis: Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both problems, covering both lax and strict team semantics. By doing so, we come close to finalizing the programme that aims to completely classify the complexities of the basic reasoning problems for modal and propositional dependence, independence and inclusion logics.
Databáze: OpenAIRE
Externí odkaz: