Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
type: Item
instance of: scholarly article
title: Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
zbMATH Open document ID: 1242.68052
DOI: 10.1017/S1471068410000463
author: Mirosław Truszczyński
published in: Theory and Practice of Logic Programming
publication date: 2012-05-24T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 6038572
zbMATH Keywords: answer sets
zbMATH Keywords: supported models
zbMATH Keywords: complexity of reasoning
MaRDI profile type: Publication
cites work: Characterizations of the disjunctive stable semantics by partial evaluation
cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs
cites work: Propositional semantics for disjunctive logic programs
cites work: Negation as failure in the head
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Complexity of Default Logic on Generalized Conjunctive Queries
cites work: Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
cites work: The complexity of propositional closed world reasoning and circumscription
cites work: The complexity of model checking for circumscriptive formulae
cites work: What makes propositional abduction tractable
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: Autoepistemic logic
description: scientific article; zbMATH DE number 6038572