scolobb/dds
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

networks: Fix and simplify the comment of Inferring interaction graphs.

Browse source
This commit is contained in:
Sergiu Ivanov 2020-11-12 01:11:15 +01:00
parent 5ece1f6c88
commit 60be01d979
1 changed files with 2 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
networks.rkt
View file

@ -278,19 +278,11 @@
;;; Inferring interaction graphs ;;; Inferring interaction graphs
;;; ============================ ;;; ============================
;;; I allow any syntactic forms in definitions of Boolean functions.
;;; I can still find out which Boolean variables appear in those
;;; syntactic form, but I have no reliable syntactic means of finding
;;; out what kind of action do they have (inhibition or activation)
;;; since I cannot do Boolean minimisation (e.g., I cannot rely on not
;;; appearing before a variable, since (not (not a)) is equivalent
;;; to a). On the other hand, going through all Boolean states is
;;; quite resource-consuming and thus not always useful.
;;;
;;; In this section I provide inference of both unsigned and signed ;;; In this section I provide inference of both unsigned and signed
;;; interaction graphs, but since the inference of signed interaction ;;; interaction graphs, but since the inference of signed interaction
;;; graphs is based on analysing the dynamics of the networks, it may ;;; graphs is based on analysing the dynamics of the networks, it may
;;; be quite resource-consuming. ;;; be quite resource-consuming, especially since I allow any
;;; syntactic forms in the definitions of the functions.
;;; Lists the variables of the network form appearing in the update ;;; Lists the variables of the network form appearing in the update
;;; function form for x. ;;; function form for x.