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

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

2012-03-29

arxiv.org/abs/1203.6534v1

Computer Science

Artificial Intelligence

12 pages, 7 figures, conference : Workshop on modeling and solving problems with constraints (ECAI 2008-W31), Patras, Greece,

Scientific paper

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 its interest, we describe a new compact representation of preferences specific to spanning trees, identifying an efficient maximal spanning tree sub-problem. Next, we compare this problem with the Pareto-based multiobjective one. And at last, we propose an efficient algorithm solving the associated preferential consistency problem.

Affiliated with

Also associated with

No associations

Rating

Global preferential consistency for the topological sorting-based maximal spanning tree problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Global preferential consistency for the topological sorting-based maximal spanning tree problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Global preferential consistency for the topological sorting-based maximal spanning tree problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57823