Dual-normal logic programs – the forgotten class

DOI10.1017/S1471068415000186zbMath1379.68061arXiv1507.05388MaRDI QIDQ4592993

Johannes K. Fichte, Stefan Woltran, Miroslaw Truszczynski

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.05388

zbMATH Keywords

propositional satisfiabilityanswer set programmingclasses of logic programsstrong and uniform equivalence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Related Items (1)

A multiparametric view on answer set programming

Cites Work

• Unnamed Item
• Unnamed Item
• Answer set based design of knowledge systems
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
• Team-building with answer set programming in the Gioia-Tauro seaport
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Some (in)translatability results for normal logic programs and propositional theories
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Model-based recasting in answer-set programming
• Logic Programming
• Unfolding partiality and disjunctions in stable model semantics
• Semantical characterizations and complexity of equivalences in answer set programming
• Strongly equivalent logic programs
• Logic programming and nonmonotonic reasoning. 6th international conference, LPNMR 2001, Vienna, Austria, September 17--19, 2001. Proceedings

This page was built for publication: Dual-normal logic programs – the forgotten class