Some (in)translatability results for normal logic programs and propositional theories

DOI10.3166/jancl.16.35-86zbMath1184.68160OpenAlexW2050842068MaRDI QIDQ3647255

Tomi Janhunen

Publication date: 30 November 2009

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/jancl.16.35-86

zbMATH Keywords

expressive powermodularityanswer set programmingstable model semanticstranslation functionssatisfiability solvers

Mathematics Subject Classification ID

Related Items (31)

Backdoors to Normality for Disjunctive Logic Programs ⋮ A Model for Phase Transition of Random Answer-Set Programs ⋮ Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ On elementary loops of logic programs ⋮ Advances in WASP ⋮ Multi-level Algorithm Selection for ASP ⋮ Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ Shared aggregate sets in answer set programming ⋮ claspfolio2: Advances in Algorithm Selection for Answer Set Programming ⋮ SAT Modulo Graphs: Acyclicity ⋮ Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Exploiting Database Management Systems and Treewidth for Counting ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Dual-normal logic programs – the forgotten class ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ Complexity and compilation of GZ-aggregates in answer set programming ⋮ Random logic programs: Linear model ⋮ Inconsistency Proofs for ASP: The ASP - DRUPE Format ⋮ Logic programming as classical inference ⋮ What is answer set programming to propositional satisfiability ⋮ Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination ⋮ Relative expressiveness of defeasible logics ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Testing and debugging techniques for answer set solver development ⋮ On syntactic forgetting under uniform equivalence ⋮ An abstract view on optimizations in SAT and ASP ⋮ On the relation among answer set solvers ⋮ Stable models and difference logic ⋮ Relativized hyperequivalence of logic programs for modular programming ⋮ Writing Declarative Specifications for Clauses ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming

Uses Software

• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Transformations of CLP modules
• Evaluating the effect of semi-normality on the expressiveness of defaults
• ASSAT: computing answer sets of a logic program by SAT solvers
• Results on translating defaults to circumscription
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• A transformation system for deductive database modules with perfect model semantics
• Logic programming and knowledge representation---The A-Prolog perspective
• Extending and implementing the stable model semantics
• On the equivalence and range of applicability of graph-based representations of logic programs.
• The expressive powers of the logic programming semantics
• Propositional semantics for disjunctive logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• On the intertranslatability of non-monotonic logics
• On the correctness of unfold/fold transformation of normal and extended logic programs
• Representation results for defeasible logic
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Transformation of logic programs: Foundations and techniques
• Characterizations of the disjunctive stable semantics by partial evaluation
• Translating default logic into standard autoepistemic logic
• Tight logic programs
• Strong equivalence made easy: nested expressions and weight constraints
• Why are there so many loop formulas?
• Propositional theories are strongly equivalent to logic programs
• A Machine-Oriented Logic Based on the Resolution Principle
• Strongly equivalent logic programs

This page was built for publication: Some (in)translatability results for normal logic programs and propositional theories