Complexity of computing with extended propositional logic programs

DOI10.1007/BF01536401zbMATH Open0858.68018OpenAlexW2024932524MaRDI QIDQ1924783FDOQ1924783

Wiktor Marek, Mirosław Truszczyński, Arcot Rajasekar

Publication date: 3 December 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01536401

zbMATH Keywords

\(\mathcal F\)-program

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• A logic for default reasoning
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Complexity Results for Nonmonotonic Logics
• Nonmonotonic Logic II
• A survey of complexity results for non-monotonic logics
• Negation by default and unstratifiable logic programs

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Complexity of computing with extended propositional logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924783)