Global preferential consistency for the topological sorting-based maximal spanning tree problem

Rémy-Robert Joseph

We introduce a new type of fully computable problems, for DSS dedicated to maximal spanning tree problems, based on deduction and choice: preferential consistency problems. To show…