Add a description at the top of lp files
This commit is contained in:
		
				
					committed by
					
						
						Todd Gamblin
					
				
			
			
				
	
			
			
			
						parent
						
							f69c18a922
						
					
				
				
					commit
					fb83f8ef31
				
			@@ -3,9 +3,15 @@
 | 
				
			|||||||
%
 | 
					%
 | 
				
			||||||
% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
					% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
% Avoid cycles in the DAG
 | 
					% Avoid cycles in the DAG
 | 
				
			||||||
% some combinations of conditional dependencies can result in cycles;
 | 
					%
 | 
				
			||||||
% this ensures that we solve around them
 | 
					% Some combinations of conditional dependencies can result in cycles;
 | 
				
			||||||
 | 
					% this ensures that we solve around them. Note that these rules are quite
 | 
				
			||||||
 | 
					% demanding on both grounding and solving, since they need to compute and
 | 
				
			||||||
 | 
					% consider all possible paths between pair of nodes.
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
#program no_cycle.
 | 
					#program no_cycle.
 | 
				
			||||||
path(Parent, Child) :- depends_on(Parent, Child).
 | 
					path(Parent, Child) :- depends_on(Parent, Child).
 | 
				
			||||||
 
 | 
				
			|||||||
@@ -3,6 +3,11 @@
 | 
				
			|||||||
%
 | 
					%
 | 
				
			||||||
% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
					% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
 | 
					% Heuristic to speed-up solves
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					
 | 
				
			||||||
%-----------------
 | 
					%-----------------
 | 
				
			||||||
% Domain heuristic
 | 
					% Domain heuristic
 | 
				
			||||||
%-----------------
 | 
					%-----------------
 | 
				
			||||||
 
 | 
				
			|||||||
@@ -3,9 +3,11 @@
 | 
				
			|||||||
%
 | 
					%
 | 
				
			||||||
% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
					% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
% OS compatibility rules for reusing solves.
 | 
					% OS compatibility rules for reusing solves.
 | 
				
			||||||
% os_compatible(RecentOS, OlderOS)
 | 
					% os_compatible(RecentOS, OlderOS)
 | 
				
			||||||
% OlderOS binaries can be used on RecentOS
 | 
					% OlderOS binaries can be used on RecentOS
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
 | 
					
 | 
				
			||||||
% macOS
 | 
					% macOS
 | 
				
			||||||
os_compatible("monterey", "bigsur").
 | 
					os_compatible("monterey", "bigsur").
 | 
				
			||||||
 
 | 
				
			|||||||
@@ -3,6 +3,13 @@
 | 
				
			|||||||
%
 | 
					%
 | 
				
			||||||
% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
					% SPDX-License-Identifier: (Apache-2.0 OR MIT)
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
 | 
					% Minimize the number of literals that are not solved
 | 
				
			||||||
 | 
					%
 | 
				
			||||||
 | 
					% This minimization is used for the "when_possible" concretization mode,
 | 
				
			||||||
 | 
					% otherwise we assume that all literals must be solved.
 | 
				
			||||||
 | 
					%=============================================================================
 | 
				
			||||||
 | 
					
 | 
				
			||||||
% Give clingo the choice to solve an input spec or not
 | 
					% Give clingo the choice to solve an input spec or not
 | 
				
			||||||
{ solve_literal(ID) } :- literal(ID).
 | 
					{ solve_literal(ID) } :- literal(ID).
 | 
				
			||||||
literal_not_solved(ID) :- not solve_literal(ID), literal(ID).
 | 
					literal_not_solved(ID) :- not solve_literal(ID), literal(ID).
 | 
				
			||||||
 
 | 
				
			|||||||
		Reference in New Issue
	
	Block a user