Some (in)translatability results for normal logic programs and propositional theories
From MaRDI portal
Recommendations
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- A transformation system for deductive database modules with perfect model semantics
- ASSAT: computing answer sets of a logic program by SAT solvers
- Autoepistemic logic
- Characterizations of the disjunctive stable semantics by partial evaluation
- Evaluating the effect of semi-normality on the expressiveness of defaults
- Extending and implementing the stable model semantics
- scientific article; zbMATH DE number 1319354 (Why is no real title available?)
- scientific article; zbMATH DE number 592370 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic programming and knowledge representation---The A-Prolog perspective
- Logic programs with stable model semantics as a constraint programming paradigm
- On the correctness of unfold/fold transformation of normal and extended logic programs
- On the equivalence and range of applicability of graph-based representations of logic programs.
- On the intertranslatability of non-monotonic logics
- Propositional semantics for disjunctive logic programs
- Propositional theories are strongly equivalent to logic programs
- Representation results for defeasible logic
- Results on translating defaults to circumscription
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The expressive powers of the logic programming semantics
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- The Semantics of Predicate Logic as a Programming Language
- The well-founded semantics for general logic programs
- Tight logic programs
- Transformation of logic programs: Foundations and techniques
- Transformations of CLP modules
- Translating default logic into standard autoepistemic logic
- Why are there so many loop formulas?
Cited in
(42)- On the relation among answer set solvers
- Stable models and difference logic
- What is answer set programming to propositional satisfiability
- Conflict-driven answer set solving: from theory to practice
- On syntactic forgetting under uniform equivalence
- An abstract view on optimizations in SAT and ASP
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
- scientific article; zbMATH DE number 1696840 (Why is no real title available?)
- Writing declarative specifications for clauses
- On elementary loops of logic programs
- Applying visible strong equivalence in answer-set program transformations
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- SAT modulo graphs: acyclicity
- Advances in WASP
- Multi-level Algorithm Selection for ASP
- Testing and debugging techniques for answer set solver development
- Translating Preferred Answer Set Programs to Propositional Logic
- Relativized hyperequivalence of logic programs for modular programming
- Shared aggregate sets in answer set programming
- 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
- On the practical value of different definitional translations to normal form
- scientific article; zbMATH DE number 2090542 (Why is no real title available?)
- Relative expressiveness of defeasible logics
- Inconsistency proofs for ASP: the ASP-DRUPE format
- Why are there so many loop formulas?
- 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
- Logic Programming and Nonmonotonic Reasoning
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- Exploiting Database Management Systems and Treewidth for Counting
- An abstract view on optimizations in propositional frameworks
- IASCAR: incremental answer set counting by anytime refinement
- On the configuration of more and less expressive logic programs
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
- Logic programming as classical inference
This page was built for publication: Some (in)translatability results for normal logic programs and propositional theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647255)
