A Justification -based Truth Maintenance System (JTMS) is classically represented by a network of nodes together with a set of links (justifications) that represent dependencies between nodes. In this representation, the relations between the justifications are not explicit. We propose a dual representation of a JTMS based on the dependencies between justifications. This representation allows us to separate the monotonic and non-monotonic parts of the network of dependencies. Based on this representation, we develop an incremental backtracking algorithm to compute an admissible labeling of a JTMS. This algorithm allows us to go from an admissible labeling to another, and so it always finds an admissible labeling when one exists, and dependency-directed backtracking must be called uniquely when all the admissible labelings are inconsistent.
%0 Journal Article
%1 Dung1995
%A Dung, Truong Q.
%D 1995
%J LNCS
%K kiwi
%T A New Representation of JTMS
%V 990/1995
%X A Justification -based Truth Maintenance System (JTMS) is classically represented by a network of nodes together with a set of links (justifications) that represent dependencies between nodes. In this representation, the relations between the justifications are not explicit. We propose a dual representation of a JTMS based on the dependencies between justifications. This representation allows us to separate the monotonic and non-monotonic parts of the network of dependencies. Based on this representation, we develop an incremental backtracking algorithm to compute an admissible labeling of a JTMS. This algorithm allows us to go from an admissible labeling to another, and so it always finds an admissible labeling when one exists, and dependency-directed backtracking must be called uniquely when all the admissible labelings are inconsistent.
@article{Dung1995,
abstract = {A Justification -based Truth Maintenance System (JTMS) is classically represented by a network of nodes together with a set of links (justifications) that represent dependencies between nodes. In this representation, the relations between the justifications are not explicit. We propose a dual representation of a JTMS based on the dependencies between justifications. This representation allows us to separate the monotonic and non-monotonic parts of the network of dependencies. Based on this representation, we develop an incremental backtracking algorithm to compute an admissible labeling of a JTMS. This algorithm allows us to go from an admissible labeling to another, and so it always finds an admissible labeling when one exists, and dependency-directed backtracking must be called uniquely when all the admissible labelings are inconsistent.},
added-at = {2008-11-14T13:33:38.000+0100},
author = {Dung, Truong Q.},
biburl = {https://www.bibsonomy.org/bibtex/24f424dd8717096e880757634aba56601/fraktalek},
citeulike-article-id = {3508784},
interhash = {80214928bbbba30c50b9157a012a2401},
intrahash = {4f424dd8717096e880757634aba56601},
journal = {LNCS},
keywords = {kiwi},
posted-at = {2008-11-13 14:13:55},
priority = {2},
timestamp = {2008-11-14T13:33:39.000+0100},
title = {A New Representation of JTMS},
volume = {990/1995},
year = 1995
}