Logics with Common Weak Completions

@article{Osorio2006LogicsWC,
  title={Logics with Common Weak Completions},
  author={Mauricio Osorio and Juan Antonio Navarro P{\'e}rez and Jos{\'e} R. Arrazola Ram{\'i}rez and Ver{\'o}nica Borja Mac{\'i}as},
  journal={J. Log. Comput.},
  year={2006},
  volume={16},
  pages={867-890}
}
We introduce the notion of X-stable models parametrized by a given logic X. Such notion is based on a construction that we call weak completions: a set of atoms M is an X-stable model of a theory T if M is a model of T, in the sense of classical logic, and the weak completion of T (namely T [ : e M) can prove, in the sense given by logic X, every atom in the set M. We prove that, for normal logic programs, the result obtained by these weak completions is invariant with respect to a large family… CONTINUE READING
Highly Cited
This paper has 84 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

84 Citations

051015'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 84 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

MINISAT—a SAT solver with confict-clause minimization

  • N. Eén, N. Sörensson
  • Poster presented at the SAT 2005 Competition,
  • 2005

Similar Papers

Loading similar papers…