Inconsistency Proofs for ASP: The ASP-DRUPE Format

@article{Alviano2019InconsistencyPF,
  title={Inconsistency Proofs for ASP: The ASP-DRUPE Format},
  author={Mario Alviano and C. Dodaro and J. Fichte and Markus Hecher and T. Philipp and Jakob Rath},
  journal={Theory Pract. Log. Program.},
  year={2019},
  volume={19},
  pages={891-907}
}
  • Mario Alviano, C. Dodaro, +3 authors Jakob Rath
  • Published 2019
  • Computer Science
  • Theory Pract. Log. Program.
  • Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs. However, it is far from immediate to verify whether a program that is claimed to be inconsistent, indeed does not admit any answer sets. In this paper, we address this… CONTINUE READING

    References

    SHOWING 1-10 OF 44 REFERENCES
    On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic
    • 52
    • Highly Influential
    • PDF
    Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates
    • 36
    • PDF
    Verification of proofs of unsatisfiability for CNF formulas
    • E. Goldberg, Y. Novikov
    • Computer Science
    • 2003 Design, Automation and Test in Europe Conference and Exhibition
    • 2003
    • 178
    • Highly Influential
    • PDF
    Logic programs with propositional connectives and aggregates
    • 50
    • PDF
    Semantics and complexity of recursive aggregates in answer set programming
    • 212
    • PDF
    Verifying Refutations with Extended Resolution
    • 50
    • Highly Influential
    • PDF
    Some (in)translatability results for normal logic programs and propositional theories
    • T. Janhunen
    • Mathematics, Computer Science
    • J. Appl. Non Class. Logics
    • 2006
    • 80
    • PDF
    Verifying RUP Proofs of Propositional Unsatisfiability
    • 49
    • PDF
    A Unified Proof System for QBF Preprocessing
    • 36
    • PDF
    A Constructive semantic characterization of aggregates in answer set programming
    • 95
    • PDF