On the semantics of conflict resolution in truth maintenance systems
Publication date
1991-03
Authors
Jonker, C.M.
Editors
Advisors
Supervisors
DOI
Document Type
Preprint
Metadata
Show full item recordCollections
License
Abstract
A Truth Maintenance -System (TMS) maintains a consistent state of belief given a set
J of justifications, i.e. arguments for belief. To resolve contradictions dependency-directed backtracking is performed.
In this paper we introduce a method that can, be used to track all dependency-directed
backtracking methods simultaneously. This has been, previously done, by adding the contrapositions
of justifications to J. We will show that contrapositions are not mandatory, namely
that the same result can be reached by adding one disjunctive justification (the consequent is
not one atom, but can be a disjunction of atoms).
Simplifying the added disjunctive justification leads to more informative models [Ross 89b].
Furthermore, we will give an alternative proof for the correctness of Witteveen's method
[Witteveen 90a] for computing the Well-Founded model
Keywords
provability, conflict resolution, TMS