Clarify method for obtaining directed-tree CSPs

An issue was logged by "a user" at the following url:

https://courses.voll-ki.fau.de/course-notes/ai-1#gps/section/cspropagation/section/csprop-localsearch/section

The issue as described by the user:

To obtain a directed-tree constraint network when using AcyclicCG, we use:
Tree-structured CSPs
Cutset conditioning is used when the graph is “almost” a tree (you remove a small set of variables to reduce it to a tree).
Backtracking search is the general search method, not the specialized decomposition approach

The text highlighted while reporting this issue:

Tree-structured CSPs         What can we use to obtain directed-tree constraint network when using the AcyclicCG algorithm? 
	
	Tree-structured CSPs 
	
	Cutset conditioning 
	
	Backtracking search

The selected text was in the following section hierarchy:

INNERMOST SECTION FIRST

1. (Problem) GitLab: https://gl.mathhub.info/courses/FAU/AI/problems/-/blob/main/source/csp/quiz/constraint_prop9.en.tex
   Uri: https://stexmmt.mathhub.info/:sTeX?a=courses/FAU/AI/problems&p=csp/quiz&d=constraint_prop9&l=en&e=problem

2. (Section) GitLab: https://gl.mathhub.info/courses/FAU/AI/course/-/blob/main/source/csp/sec/cspropagation.en.tex
   Uri: https://mathhub.info?a=courses/FAU/AI/course&p=csp/sec&d=cspropagation&l=en&e=section

3. (Section) GitLab: https://gl.mathhub.info/courses/FAU/AI/course/-/blob/main/source/course/sec/gps.en.tex
   Uri: https://mathhub.info?a=courses/FAU/AI/course&p=course/sec&d=gps&l=en&e=section