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...
Sparad:
| Huvudupphov: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Logical Methods in Computer Science e.V.
2019-04-01
|
| Serie: | Logical Methods in Computer Science |
| Ämnen: | |
| Länkar: | https://lmcs.episciences.org/4215/pdf |
| Taggar: |
Inga taggar, Lägg till första taggen!
|