Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences

@article{Brewka1996WellFoundedSF,
  title={Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences},
  author={Gerhard Brewka},
  journal={J. Artif. Intell. Res.},
  year={1996},
  volume={4},
  pages={19-36}
}
The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Connicts among rules are resolved whenever… CONTINUE READING