1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
:- object(performance,
implements(event_handlersp)).
:- info([
version is 1.2,
author is 'Paulo Moura',
date is 2005/12/19,
comment is 'Performance monitor for state space searches.']).
:- uses(event_registry).
:- uses(before_event_registry).
:- uses(after_event_registry).
:- uses(list, [length/2]).
:- uses(numberlist, [min/2, max/2, sum/2]).
:- uses(time, [cpu_time/1]).
:- private(transitions_/3).
:- dynamic(transitions_/3).
:- mode(transitions_(?state, ?state, ?integer), zero_or_more).
:- private(solution_length_/1).
:- dynamic(solution_length_/1).
:- mode(solution_length_(?integer), zero_or_one).
:- private(time_/1).
:- dynamic(time_/1).
:- mode(time_(-number), zero_or_one).
:- public(time/1).
:- mode(time(-number), zero_or_one).
:- public(transitions/1).
:- mode(transitions(-number), zero_or_one).
:- public(branching/3).
:- mode(branching(-integer, -float, -integer), zero_or_one).
:- public(report/0).
:- mode(report, zero_or_one).
:- public(init/0).
:- mode(init, one).
:- public(stop/0).
:- mode(stop, one).
report :-
solution_length_(Length),
transitions(Number),
Ratio is Length / Number,
branching(Minimum, Average, Maximum),
time(Time),
write('solution length: '), write(Length), nl,
write('state transitions (including past solutions): '), write(Number), nl,
write('ratio solution length / state transitions: '), write(Ratio), nl,
write('minimum branching degree: '), write(Minimum), nl,
write('average branching degree: '), write(Average), nl,
write('maximum branching degree: '), write(Maximum), nl,
write('time: '), write(Time), nl.
report :- % clean up for next solution
retractall(time_(_)),
retractall(solution_length_(_)),
cpu_time(Start),
asserta(time_(Start)),
fail.
transitions(Number) :-
findall(N, transitions_(_, _, N), List),
sum(List, Number).
time(Time) :-
cpu_time(End),
retract(time_(Start)),
Time is End - Start.
branching(Minimum, Average, Maximum) :-
findall(
Length,
(transitions_(State1, _, _),
findall(State2, transitions_(State1, State2, _), States2),
length(States2, Length)),
Lengths),
min(Lengths, Minimum),
max(Lengths, Maximum),
sum(Lengths, Sum),
length(Lengths, Length),
Average is Sum / Length.
init :-
self(Self),
event_registry::set_monitor(_, solve(_, _, _), _, Self),
after_event_registry::set_monitor(_, next_state(_, _), _, Self),
event_registry::set_monitor(_, solve(_, _, _, _), _, Self),
after_event_registry::set_monitor(_, next_state(_, _, _), _, Self),
retractall(transitions_(_, _, _)),
retractall(time_(_)),
retractall(solution_length_(_)).
stop :-
self(Self),
before_event_registry::del_monitors(_, _, _, Self),
after_event_registry::del_monitors(_, _, _, Self).
before(_, solve(_, _, _), _) :-
!,
retractall(transitions_(_, _, _)),
cpu_time(Start),
retractall(time_(_)),
asserta(time_(Start)).
before(_, solve(_, _, _, _), _) :-
!,
retractall(transitions_(_, _, _)),
cpu_time(Start),
retractall(time_(_)),
asserta(time_(Start)).
after(_, next_state(S1, S2), _) :-
!,
(retract(transitions_(S1, S2, N)) ->
N2 is N + 1
;
N2 is 1),
assertz(transitions_(S1, S2, N2)).
after(_, next_state(S1, S2, _), _) :-
!,
(retract(transitions_(S1, S2, N)) ->
N2 is N + 1
;
N2 is 1),
assertz(transitions_(S1, S2, N2)).
after(_, solve(_, _, Solution), _) :-
!,
length(Solution, Length),
retractall(solution_length_(_)),
asserta(solution_length_(Length)).
after(_, solve(_, _, Solution, _), _) :-
!,
length(Solution, Length),
retractall(solution_length_(_)),
asserta(solution_length_(Length)).
:- end_object.
|
