Parameterised complexity of model checking and satisfiability in propositional dependence logic
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Mahmood, Y.; Meier, A.: Parameterised complexity of model checking and satisfiability in propositional dependence logic. In: Annals of mathematics and artificial intelligence 90 (2022), Nr. 2-3, S. 271-296. DOI: https://doi.org/10.1007/s10472-021-09730-w
- Event
-
Veröffentlichung
- (where)
-
Hannover
- (who)
-
Gottfried Wilhelm Leibniz Universität Hannover
- (when)
-
2021
- Event
-
Veröffentlichung
- (where)
-
Hannover
- (who)
-
Technische Informationsbibliothek (TIB)
- (when)
-
2021
- Creator
-
Mahmood, Yasir
Meier, Arne
- DOI
-
10.15488/12823
- URN
-
urn:nbn:de:101:1-2022101302111668913666
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Mahmood, Yasir
- Meier, Arne
- Gottfried Wilhelm Leibniz Universität Hannover
- Technische Informationsbibliothek (TIB)
Time of origin
- 2021
Other Objects (12)
Parametrised complexity of satisfiability in temporal logic
The complexity of generalized satisfiability for linear temporal logic
Complexity and expressivity of dependence logic extensions
Satisfiability Checking for the Coalgebraic µ-Calculus
Logics on data words : Expressivity, satisfiability, model checking
New Perspectives in Symbolic Computation and Satisfiability Checking
Satisfiability and model checking in team based logics
Proof complexity of Satisfiability Modulo Theories
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
The parameterized space complexity of model-checking bounded variable first-order logic
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
A satisfiability algorithm for a typed feature logic
Parametrised complexity of satisfiability in temporal logic
The complexity of generalized satisfiability for linear temporal logic
Complexity and expressivity of dependence logic extensions
Satisfiability Checking for the Coalgebraic µ-Calculus
Logics on data words : Expressivity, satisfiability, model checking
New Perspectives in Symbolic Computation and Satisfiability Checking
Satisfiability and model checking in team based logics
Proof complexity of Satisfiability Modulo Theories
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
The parameterized space complexity of model-checking bounded variable first-order logic
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
A satisfiability algorithm for a typed feature logic
Parametrised complexity of satisfiability in temporal logic
The complexity of generalized satisfiability for linear temporal logic
Complexity and expressivity of dependence logic extensions
Satisfiability Checking for the Coalgebraic µ-Calculus
Logics on data words : Expressivity, satisfiability, model checking
New Perspectives in Symbolic Computation and Satisfiability Checking
Satisfiability and model checking in team based logics
Proof complexity of Satisfiability Modulo Theories
Conservative Extensions and Satisfiability in Fragments of First-Order Logic : Complexity and Expressive Power
The parameterized space complexity of model-checking bounded variable first-order logic
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471