## Facilitate updating and merging.

## Expressive: classical negation, mutual exclusions, partially-ordered prioritization, reasoning to infer prioritization.

## Guarantee consistent, unique set of conclusions.

- Mutual exclusion is enforced. E.g., never conclude both p & ¬p.

## Efficient: low computational overhead beyond ordinary LP’s.

- Tractable given reasonable restrictions (Datalog, bound v on #var’s/rule):
- extra cost is equivalent to increasing v to (v+2) in ordinary LP’s.

- By contrast, more expressive prioritized rule representations (e.g., Prioritized Default Logic) add NP-hard overhead.

- Tractable given reasonable restrictions (Datalog, bound v on #var’s/rule):

Previous slide | Next slide | Back to first slide | View graphic version |