A fragment of dependence logic capturing polynomial time
type: Item
instance of: scholarly article
zbMATH Open document ID: 1338.68090
DOI: 10.2168/LMCS-10(3:3)2014
author: Johannes Ebbing
author: Juha Kontinen
author: Julian-Steffen Müller
author: Heribert Vollmer
published in: Logical Methods in Computer Science
publication date: 2014-09-05T00:00:00Z
full work available at URL: https://arxiv.org/abs/1210.3321
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6340394
zbMATH Keywords: dependence logic
zbMATH Keywords: Horn-formulae
zbMATH Keywords: computational complexity
zbMATH Keywords: descriptive complexity
MaRDI profile type: Publication
arXiv ID: 1210.3321
Recommended article: A parameterized view on the complexity of dependence logic
Recommended article: A parameterized view on the complexity of dependence and independence logic
Recommended article: Expressivity and Complexity of Dependence Logic
Recommended article: Q3509072
Recommended article: Computer Science Logic
Recommended article: Q4995356
Recommended article: Complexity of validity for propositional dependence logics
Recommended article: An NP-complete fragment of fibring logic
Recommended article: Q3647277
Recommended article: Parameterised complexity of model checking and satisfiability in propositional dependence logic
title: A fragment of dependence logic capturing polynomial time
description: scientific article; zbMATH DE number 6340394