Assumption-Free Semantics for Ordered Logic Programs: On the Relationship between Well-Founded and Stable Partial Models

@article{Laenens1992AssumptionFreeSF,
  title={Assumption-Free Semantics for Ordered Logic Programs: On the Relationship between Well-Founded and Stable Partial Models},
  author={Els Laenens and Dirk Vermeir},
  journal={J. Log. Comput.},
  year={1992},
  volume={2},
  pages={133-172}
}
Ordered logic programming is an extension of logic programming that includes, besides classical inference mechanisms, object-oriented abstractions and amenities for nonmonotonic reasoning. Ordered logic programs are partially-ordered sets of 'traditional' logic programs where negation may also occur in the rule heads. The central issue of this paper is the definition of a new unifying semantics for ordered logic programs, called assumption-free semantics, capable of capturing different… CONTINUE READING

From This Paper

Topics from this paper.
14 Citations
39 References
Similar Papers

References

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

LOCO, a logic-based language for complex objects

  • E. Laenens, D. Vermeir, B. Verdonk
  • In Proceedings of the Esprit conference,
  • 1989
Highly Influential
4 Excerpts

Pure semantics for negative logic programs

  • E. Laenens, D. Vermeir
  • In preparation
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…