Parameterised complexity of model checking and satisfiability in propositional dependence logic

DOI10.1007/978-3-030-39951-1_10OpenAlexW3003548459MaRDI QIDQ5918987

Yasir Mahmood, Arne Meier

Publication date: 26 October 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-39951-1_10

zbMATH Keywords

model checkingsatisfiabilitypropositional dependence logicparameterised complexity

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (2)

A parameterized view on the complexity of dependence logic ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic

This page was built for publication: Parameterised complexity of model checking and satisfiability in propositional dependence logic