Highly Influenced

# 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} }

- Published 1992 in J. Log. Comput.
DOI:10.1093/logcom/2.2.133

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