Cautious reasoning in ASP via minimal models and unsatisfiable cores

@article{Alviano2018CautiousRI,
  title={Cautious reasoning in ASP via minimal models and unsatisfiable cores},
  author={Mario Alviano and Carmine Dodaro and Matti J{\"a}rvisalo and Marco Maratea and Alessandro Previti},
  journal={Theory Pract. Log. Program.},
  year={2018},
  volume={18},
  pages={319-336}
}
  • Mario Alviano, Carmine Dodaro, +2 authors Alessandro Previti
  • Published 2018
  • Computer Science, Mathematics
  • Theory Pract. Log. Program.
  • Answer Set Programming (ASP) is a logic-based knowledge representation framework, supporting---among other reasoning modes---the central task of query answering. In the propositional case, query answering amounts to computing cautious consequences of the input program among the atoms in a given set of candidates, where a cautious consequence is an atom belonging to all stable models. Currently, the most efficient algorithms either iteratively verify the existence of a stable model of the input… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    Abstract Solvers for Computing Cautious Consequences of ASP programs

    VIEW 11 EXCERPTS
    CITES METHODS, BACKGROUND & RESULTS

    Omission-Based Abstraction for Answer Set Programs

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Minipref: A Tool for Preferences in SAT (short paper)

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 55 REFERENCES

    On the relation among answer set solvers

    VIEW 2 EXCERPTS

    A Tableau Calculus for Minimal Model Reasoning

    VIEW 1 EXCERPT

    The Sixth Answer Set Programming Competition

    VIEW 6 EXCERPTS