Complexity of computing with extended propositional logic programs
type: Item
instance of: scholarly article
title: Complexity of computing with extended propositional logic programs
zbMATH Open document ID: 0858.68018
DOI: 10.1007/BF01536401
author: Wiktor Marek
author: Arcot Rajasekar
author: Mirosław Truszczyński
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1996-12-03T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 937279
zbMATH Keywords: \(\mathcal F\)-program
MaRDI profile type: Publication
cites work: Negation by default and unstratifiable logic programs
cites work: A survey of complexity results for non-monotonic logics
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q4198056
cites work: Q3983043
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: Complexity Results for Nonmonotonic Logics
cites work: Q3026978
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Nonmonotonic Logic II
cites work: Q3939270
cites work: Autoepistemic logic
cites work: Q4273952
cites work: A logic for default reasoning
cites work: Q4282617
cites work: Q4012232
cites work: The Semantics of Predicate Logic as a Programming Language
full work available at URL: https://doi.org/10.1007/bf01536401
OpenAlex ID: W2024932524
description: scientific article; zbMATH DE number 937279