Validity and Entailment in Modal and Propositional Dependence Logics
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal dependence logic. Thus far, however, the validity and entailment...
Збережено в:
| Автор: | |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Logical Methods in Computer Science e.V.
2019-04-01
|
| Серія: | Logical Methods in Computer Science |
| Предмети: | |
| Онлайн доступ: | https://lmcs.episciences.org/4215/pdf |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|