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...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Logical Methods in Computer Science e.V.
2019-04-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/4215/pdf |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|