The remaining arguments can be any combination of matrices and numbers (as long as the number of columns in a preceeding matrix equals the number of rows in the following one). The result is a number if all the remaining arguments are numbers; otherwise the result is a matrix. and is ?max (max (absoluteValue ?arg1) (absoluteValue ?arg2))\ (if greater ?max 1.0e100\ is ?result 1.0e100\ is ?result ?arg1 * ?arg2) safeMultiply ?result ?arg1 ?arg2 0 ! - "comment stating purpose of method" clause first unifyWith: (GPCodeHolder nextNormalRandom) bindings: bindings continuation: continuation5 HUnify the first argument with the absolute value of the second argument. Tif greater ?arg 0\ = ?result 1\ (if less ?arg 0\ = ?result -1\ = ?result 0) signOf ?result ?arg 7 ^Unify the first argument with the product of the remaining arguments.
The remaining arguments can be any combination of matrices and numbers (as long as the number of columns in a preceeding matrix equals the number of rows in the following one). The result is a number if all the remaining arguments are numbers; otherwise the result is a matrix. and absoluteValue ?aarg1 ?arg1\ absoluteValue ?aarg2 ?arg2\ (if thereExists (or greater ?aarg1 1.0e100\ less ?aarg2 1.0e-100)\ is ?result 1.0e100 * (signOf ?arg1) * (signOf ?arg2)\ is ?result ?arg1 / ?arg2) safeDivide ?result ?arg1 ?arg2 < : 1 3.6$- bruce b.edmonds@mmu.ac.uk ?Centre for Policy Modelling, Manchester Metropolitan Universityu" : 2 4.1+;CDEv- : 3G,3CDEvd+ : 4G -CDEv帹 : 5 4.1 "7CDEun B replace Predicate lists 8 UniversalAgent listOf lastOf first binarySearchPrimitive binarySearch third withoutDuplicates appendedList replaceInList second notEmpty cummulateList flattened lists fitness Agent List inst }The first list is the second list appended to the third list.
This can be used to join lists together or split them apart. backward true appendedList [] [] bottom Gand appendedList ?restList ?rest\ appended ?list ?firstList ?restList 'appendedList ?list [?firstList | ?rest] " recurse Term true ,third ?third [?first ?second ?third | ?rest] * top-level ) /and length ?list ?len\ index ?list ?len ?item lastOf ?item ?list 0. GroundList5 true withoutDuplicates [] [] 6# =and withoutDuplicates ?rest ?rawRest\ includes ?rest ?first +withoutDuplicates ?rest [?first | ?rawRest] 9 recurse - dup Kand withoutDuplicates ?rest ?rawRest\ notInferred includes ?rest ?first 6withoutDuplicates [?first | ?rest] [?first | ?rawRest] 9 recurse - no dup GroundTerm5 C 5 :mappedList ?resulltList ?list [?item ?replacement] replace 3replaceInList ?resulltList ?list ?item ?replacement D top ) true 'second ?second [?first ?second | ?rest] J. 5 5 and isKindOf ?first List\ notInferred isKindOf ?first String\ flattened ?flattenedFirst ?first\ flattened ?flattenedRest ?rest\ appended ?list ?flattenedFirst ?flattenedRest flattened ?list [?first | ?rest] O first is list jand (or notInferred isKindOf ?first List\ isKindOf ?first String)\ flattened ?flattenedRest ?rest 4flattened [?first | ?flattenedRest] [?first | ?rest] R first not list true flattened [] [] R empty ) true first ?first [?first | ?rest] ]. Number b b true cummulateList [] [] ?cumm c# Fand is ?newCumm ?first + ?cumm\ cummulateList ?restOp ?rest ?newCumm 9cummulateList [?newCumm | ?restOp] [?first | ?rest] ?cumm f' cummulateList ?res ?list 0 cummulateList ?res ?list f. b bbbinarySearchPrimitive ?position ?number ?sortedListOfNumbers
The first argument is unified with its position in the second (a list). primitive "unify the first argument with the maximum depth of tree" clause first unifyWith: (GPCodeHolder findPositionIn: ((clause at: 3) unbindUsing: bindings) of: ((clause at: 2) unbindUsing: bindings)) bindings: bindings continuation: continuationo true notEmpty [?something | ?rest] qH }The first list is the second list appended to the third list.
This can be used to join lists together or split them apart. true appendedList [] [] u# Gand appendedList ?restList ?rest\ appended ?list ?firstList ?restList 'appendedList ?list [?firstList | ?rest] x' b and greater ?length 0\ includes ?sourceList ?item\ is ?lengthMinus ?length - 1\ listOf ?restList ?lengthMinus ?sourceList\ = ?list [?item | ?restList] listOf ?list ?length ?sourceList }' true listOf [] 0 ?sourceList # b b bb 5 >and length ?list ?top\ index ?list ?top ?biggest\ max ?max ?biggest ?number\ = ?list [?smallest | ?rest]\ min ?min ?number ?smallest\ appended ?searchListMax ?list [?max]\ appended ?searchList [?min] ?searchListMax\ is ?upper ?top + 1\ binarySearch ?posPlus ?number 1 ?upper ?searchList\ is ?pos ?posPlus - 1 binarySearch ?pos ?number ?list!initiate binary search for number topLevel >and is ?lowerPlus ?lower + 1\ less ?lowerPlus ?upper\ is ?middle (truncated (?lower + ?upper) / 2)\ index ?list ?middle ?value\ (or (and notInferred less ?number ?value\ binarySearch ?pos ?number ?middle ?upper ?list)\ (and less ?number ?value\ binarySearch ?pos ?number ?lower ?middle ?list)) -binarySearch ?pos ?number ?lower ?upper ?list recursive step is ?upper ?lower + 1 /binarySearch ?upper ?number ?lower ?upper ?list bottom step C C CC 5if = ?old ?match\ = ?new ?replacement\ = ?new ?old %replace ?new ?old ?match ?replacement H : 1 3.1b4- bruce b.edmonds@mmu.ac.uk ?Centre for Policy Modelling, Manchester Metropolitan Universityv : 2 3.1b46(v> : 3 3.4a"&v2 : 4 3.4a#53vE~ : 5 4.1 -*v : 6 4.1 "9t+ : 7 4.1 . scott s.moss@mmu.ac.uk ?Centre for Policy Modelling, Manchester Metropolitan Universityv'f trees 11 Agent labelOf Predicate UniversalAgent allLabels isSubTreeOf maxDepth mappedLeaves includesLeaf isTree subTreeOf modifyBranch nodeListPrimitive isLeaf branches leafOf nodeOf hasLeaf noBranches mappedLabels randomTree maxDepthPrimitive subTree graft randomNodeChoice branch fixedRandomCrossover tree hasBranches allLeaves mappedLeafLabels leafListPrimitive fixedRandomNodeChoice label crossover allLeafLabels fixedRandomTree nodeList inst GroundList NumbernoBranches ?num ?tree backward length ?branches ?num $noBranches ?num [?label | ?branches] 3 top-level 0/0/0/03graft ?resultTree ?originalTree ?posList ?graftTree2 and branch ?branch ?firstPos ?originalTree\ graft ?resultSubTree ?branch ?restPosList ?graftTree\ modifyBranch ?resultTree ?originalTree ?firstPos ?resultSubTree Egraft ?resultTree ?originalTree [?firstPos | ?restPosList] ?graftTree 97 true ,graft ?graftTree ?originalTree [] ?graftTree 9 bottom /0hasBranches ?tree2 % true 1hasBranches [?label ?firstBranch | ?restBranches] C7 0/00/0/0/0jcrossover ?firstChildTree ?secondChildTree ?firstPosList ?secondPosList ?firstParentTree ?secondParentTree2 + and subTree ?firstGraft ?firstParentTree ?firstPosList\ subTree ?secondGraft ?secondParentTree ?secondPosList\ graft ?firstChildTree ?firstParentTree ?firstPosList ?secondGraft\ graft ?secondChildTree ?secondParentTree ?secondPosList ?firstGraft jcrossover ?firstChildTree ?secondChildTree ?firstPosList ?secondPosList ?firstParentTree ?secondParentTree H7 / GroundTerm0/0*fixedRandomNodeChoice ?posList ?tree ?term2 ) 6fixedRandomChoice ?posList ?pl ?term nodeOf ?pl ?tree *fixedRandomNodeChoice ?posList ?tree ?term N7 0/0"nodeList ?listOfNodePosLists ?tree2 . 8sortedList ?list ?nodePosList nodeOf ?nodePosList ?tree nodeList ?list ?tree S7 M/0label ?label ?list2 * true label ?label [?label | ?rest] X7 /00allLabels ?labelList ?tree2 true allLabels [?label] [?label] ] leaf and = ?branches [?something | ?rest]\ mappedList ?resultList ?branches allLabels\ randomList ?subLeafList ?lb true (and includes ?resultList ?list\ includes ?list ?lb)\ appended ?labelList [?label] ?subLeafList )allLabels ?labelList [?label | ?branches] ` recusive /M/MsubTreeOf ?subTree ?tree2 Mand includes [?firstBranch | ?branches] ?branch\ subTreeOf ?subTree ?branch 4subTreeOf ?subTree [?label ?firstBranch | ?branches] g recurse true subTreeOf [?label] [?label] ja 0/1/0/0/MgrandomTree ?tree ?maxDepth ?nodeList ?terminalList ?term
(?nodeList = pairs of [label noOfBranches])2 - dand
greater ?depth 0\
fixedRandomChoice [?label ?noBranches] ?node ?term
includes ?nodeList ?node\
is ?newDepth ?depth - 1\
sortedList ?pairList ?pair
(and
inInterval ?branchNo 1 ?noBranches\
fixedRandomTree ?branch ?newDepth ?nodeList ?terminalList [?branchNo | ?term]\
= ?pair [?branchNo ?branch])\
mappedList ?branches ?pairList second IfixedRandomTree [?label | ?branches] ?depth ?nodeList ?terminalList ?term p7 >fixedRandomChoice ?label ?lb ?term
includes ?terminalList ?lb 8fixedRandomTree [?label] 0 ?nodeList ?terminalList ?term sA /M/MsubTreeOf ?subTree ?tree2 and
notInferred
= ?subTree [?label ?firstBranch | ?branches]\
includes [?firstBranch | ?branches] ?branch\
isSubTreeOf ?subTree ?branch 6isSubTreeOf ?subTree [?label ?firstBranch | ?branches] wk true isSubTreeOf ?tree ?tree za 0/0>the first argument is unified with a list of nodes in the tree
primitive
"unify the first argument with a list of leaves in argument 2"
clause first
unifyWith: (GPCodeHolder nodeList: (clause at: 2))
bindings: bindings
continuation: continuation /00leafOf ?leaf ?tree2 6and
includes ?branches ?branch\
leafOf ?leaf ?branch !leafOf ?leaf [?label | ?branches] 7 true leafOf [?label] [?label] a /0Mbranches ?branchList ?tree2 true +branches ?branchList [?label | ?branchList] 7 /00/0/ means
Optional arguments:
4) List of variables. Each element of the list must be a distinct uninstantiated variable; every variable used in the term must be in this list, but not all elements of the list need to be used in the term).
5) List of strings representing variable names. This list should be the same length as the fourth argument.
N.B. Printing takes place in the context of the agent for which the clause is being evaluated. Paths (using "@") are printed when necessary.& ! Vand
isKindOf ?term String\
strip ?intString ?term <'>\
strip ?string ?intString <"> singlePrinted ?term ?term l string and
notInferred
isKindOf ?term String\
printed ?rawString ?term\
strip ?intString ?rawString <'>\
strip ?string ?intString <"> singlePrinted ?string ?term o not string 7 77 5 !L 5 !R 7%$X means
1. one reaches max valued state (must be more than current)
2. one with fewest num positive acitons
3. random
PS. could be made more efficient by storing considered chain lengths Not needed because of the prevalence of the nullAction X no actionsW and
linkSign ?link true\
currentlyHolds ?start\
linkStart ?link ?start\
linkCondition ?link ?clause\
?clause\
linkEnd ?link ?end\
notInferred
(and
linkSign ?anotherLink false\
currentlyHolds ?anotherStart\
linkStart ?anotherLink ?anotherStart\
linkCondition ?anotherLink ?anotherClause\
?anotherClause\
linkEnd ?anotherLink ?end)\
associatedText ?end standard ?endText\
(if
notEmpty ?endText\
= ?rep ?endText\
= ?rep ?end) /and
every negotiationCycle (nextWillHold ?end)VnullAction will ensure that states persist unless this is blocked with a negative link X effect of actionsW report 6if
nextWillHold ?state\
true\
currentlyHolds ?state ,report "(State of " self ") is: " ?state "." f final statee carry over Qand
notInferred
perceivedAction ?action\
last actionCycle (triedChain ?chain) *every negotiationCycle (triedChain ?chain) l
haveTriedk &last actionCycle (nextWillHold ?state) .every negotiationCycle (currentlyHolds ?state) l}k initialise false every actionCycle (and
possibleAction ?state ?action\
associatedText ?action standard "The null action"\
perceivedAction ?action)X means
The first argument can be an uninstantiated variables, in which case the subclause is evaluated at all possible time levels for which a previous time exists. Otherwise the subclause is evaluated for a single stage determined from the time level (if such a stage has been simulated).& Vif
time negotiationCycle 1\
last actionCycle ?clause\
last negotiationCycle ?clause previous ?clause 3 5 ; 5 Ý 5 ( Ý%7 & Xand
mappedList ?clauseArgs ?argList parseCondition\
clauseList ?clause and ?clauseArgs 'parseCondition ?clause [and | ?argList]
Qand
parseCondition ?clauseArg ?arg\
clauseList ?clause notInferred [?clauseArg] !parseCondition ?clause [not ?arg]
not rand
isKindOf ?string String\
namedInstance ?action Action ?string\
clauseList ?clause perceivedAction [?action] parseCondition ?clause ?string
R 5 ] 5 òS 5 %S7 & b false findPossibleChain ?chain 0Gand
table agreement TthereExists
and
toBeDoneBy ?agent ?action\
notInferred
doneBy ?agent ?action "every negotiationCycle actionPhase R {and
final negotiationCycle\
agreed ?name\
tabledAgreementActions ?name ?agent ?actionList\
includes ?actionList ?action 2and
every actionCycle (toBeDoneBy ?agent ?action)I
myOfferOfAgreement ?agentOfferList ?endStates\
sortedList ?opStringList ?string
(and
includes ?agentOfferList [?agent ?actionList]\
printed ?agentString ?agent\
asPrintedList ?agentActionString ?actionList\
appended ?string ?agentString " will do " ?agentActionString)\
asPrintedList ?opString ?opStringList ";"\
asPrintedList ?endString ?endStates\
= ?text ?opString " in order to achieve: " ?endString "."\ report ?agent " is committed to " ?action "."\ post commitments from agreementR and
last (notInferred
and
message ?from ?to ?content\
notInferred
last (message ?from ?to ?content))\
last (notInferred
and
agreed ?name\
notInferred
last (agreed ?name)) and
final negotiationCyclea report "Negotiation round ends since nobodoy has anything else to offer"\ final negotiation cycle and
tabledAgreement ?name\
notInferred
(and
tabledAgreementActions ?name ?agent ?list\
notInferred
message ?agent ?other (iAgreeTo ?name)) *and
agreed ?name\
final negotiationCycleG report "Agreement has been reached on: " ?name\ 'all agree then final negotiation cycle false Greport "--------------------------------------------------------------"?and
time negotiationCycle ?neg\
greater ?neg 1\ announce round false Greport ?agreementName " consisting of: " ?text " has just been tabled."and
tabledAgreementText ?agreementName ?text\
notInferred
last negotiationCycle (tabledAgreementText ?agreementName ?text)\ announce tabled agreement time negotiationCycle 10 final negotiationCycle max final negotiation cycle
finishing ! true final run
final run ! time actionCycle ?neg Treport "==========================================================================="#time actionCycle ?neg\ announce negotiation session nlast actionCycle (and
notInferred
actionPhase\
unchangedFromLast actionCycle (message ?from ?to ?message)) /and
every negotiationCycle (final actionCycle)and
final actionCycle init ! true and
timeLevels [run actionCycle negotiationCycle]\
initialTime run 1\
initialTime actionCycle 1\
initialTime negotiationCycle 1 time parse viewpoints ! parameters and
thereExists
indicator ?indicator\
negotiatorInfo ?negotiator ?indicatorInfo ?indicatorExpression ?nodeInfo\
includes ?nodeInfo [?name ?description ?indicatorList ?actionList ?linkList]\
cleanUp ?cleanedName ?name\
cleanUp ?cleanedDescription ?description\
namedInstance ?state State ?cleanedName\
includes ?actionList [?actionStr ?actionDesc]\
namedInstance ?action Action ?actionStr Vevery actionCycle (and
state ?state ?cleanedDescription\
action ?action ?actionDesc) initialise nodes with actions and
thereExists
state ?state ?description\
negotiatorStartInfo ?negotiator ?startList\
(if
= ?startList []\
(and
negotiatorInfo ?negotiator ?indicatorInfo ?indicatorExpression ?nodeInfo\
lastOf [?name ?description ?indicatorList ?actionList ?linkList] ?nodeInfo\
cleanUp ?cleanedName ?name\
namedInstance ?state State ?cleanedName)\
(and
includes ?startList ?name\
cleanUp ?cleanedName ?name\
namedInstance ?state State ?cleanedName)) 8at ?negotiator (all actionCycle (currentlyHolds ?state))1
last actionCycle (notInferred
or
doneBy ?name ?actions\
agreed ?agreement)\
notInferred
(or
doneBy ?name ?actions)\
agreed ?agreement\and
initial node &and
thereExists
indicator ?indicator\
negotiatorInfo ?negotiator ?indicatorInfo ?indicatorExpression ?nodeInfo\
includes ?nodeInfo [?name ?description ?indicatorList [] ?linkList]\
cleanUp ?cleanName ?name\
cleanUp ?cleanedDescription ?description\
namedInstance ?state State ?cleanName 9every actionCycle (and
state ?state ?cleanedDescription) !initialise nodes without actions and
viewpointsFileName ?viewpointsFileName\
fileContents ?viewpointsFileName ?rawString\
preparse ?string ?rawString\
splitIntoAgents ?list ?string\
mappedList ?parsedList ?list parseAgentString\
includes ?parsedList ?agentInfo\
= [?name ?description ?indicatorInfo ?indicatorExpression ?nodeInfo ?startList] ?agentInfo\
cleanUp ?cleanName ?name\
namedInstance ?negotiator Negotiator ?cleanName and
negotiatorInfo ?negotiator ?indicatorInfo ?indicatorExpression ?nodeInfo\
negotiatorStartInfo ?negotiator ?startList\
every actionCycle (and
negotiator ?negotiator\
negotiatorDescription ?negotiator ?description\
activeSubAgent ?negotiator)
thereExists
state ?state ?description\
negotiatorInfo ?negotiator ?indicatorInfo ?indicatorExpression ?nodeInfo\
lastOf [?name ?description ?indicatorList ?actionList ?linkList] ?nodeInfo\
cleanUp ?cleanedName ?name\
namedInstance ?state State ?cleanedName\and
read in file Zand
= ?fn "example3-extended"\
appended ?filename ?fn ".txt"\
appended ?opfn ?fn ".res" Oand
viewpointsFileName ?filename\
reportToTextFile textReportTranscript ?opfn viewpoint file false .every actionCycle (action ?action ?actionDesc)s
viewpointsFileName ?viewpointsFileName\
fileContents ?viewpointsFileName ?string\
splitIntoAgents ?list ?string\
mappedList ?parsedList ?list parseAgentString\
includes ?parsedList ?agentInfo\
= [?name ?description ?indicatorInfo ?indicatorExpression ?nodeInfo] ?agentInfo\
cleanUp ?cleanName ?name\
namedInstance ?negotiator Negotiator ?cleanName\and
namedInstance ?action Action "nullAction"\
= ?actionDesc "The null action"\ initialise with nullAction and
negotiatorInfo ?negotiator ?indicatorInfo ?indicatorExpression ?nodeInfo\
includes ?indicatorInfo [?indicatorStr ?weightStr]\
namedInstance ?indicator Indicator ?indicatorStr\
parsed ?weightStr ?weight (every actionCycle (indicator ?indicator) initialise indicators List String inst#$%$ backward !V /notInferred
foundSubList ?pos ?string "Agent:" 7splitIntoAgents [?string | ?lastList] ?lastList ?string ' bottom xand
splitAtFirst ?firstAgentString ?rest ?string "Agent:"\
splitIntoAgents ?list [?firstAgentString | ?lastList] ?rest 'splitIntoAgents ?list ?lastList ?string * recurse }if
splitAtFirst ?preamble ?butPreamble ?string "Agent:"\
splitIntoAgents ?list [] ?butPreamble\
error "No Agent in string" splitIntoAgents ?list ?string * top
forward !.R %$ GroundList & !p and
findMatchingBracket ?posRBr ?rest\
splitAtPos ?midStr ?tailStr ?rest ?posRBr\
strip ?mid ?midStr\
parseBrackets ?midTree ?mid\
strip ?tail ?tailStr\
parseBrackets ?tailTree ?tail 2parseBrackets [?midTree | ?tailTree] [<(> | ?rest]~and
8 first is bracket and
notInferred
= ?ch <(>\
splitAtFirst ?firstStr ?afterStr ?rest "("\
parseBrackets ?firstList [?ch | ?firstStr]\
parseBrackets ?restTree [<(> | ?afterStr]\
appended ?tree ?firstList ?restTree !parseBrackets ?tree [?ch | ?rest] ; bracket is not first and
differenceList ?string ?string "("\
strip ?strippedString ?string\
(if
notEmpty ?strippedString\
splitByAtLeastOneOf ?list ?strippedString " "\
= ?list ?strippedString) parseBrackets ?list ?string ; no brackets 7%$ & ! and
cleanUp ?cleanRest ?rest\
findMatchingBracket ?posRBr ?rest\
length ?rest ?posRBr\
butLast ?inside ?cleanRest\
parseGoalBrackets ?tree ?inside %parseGoalBrackets ?tree [<(> | ?rest] F #first and last is matching bracket and
notInferred
= ?ch <(>\
splitAtFirst ?firstStr ?afterStr ?rest "("\
parseGoalBrackets ?firstList [?ch | ?firstStr]\
parseGoalBracketsList ?restTree [<(> | ?afterStr]\
appended ?tree ?firstList ?restTree %parseGoalBrackets ?tree [?ch | ?rest] I functor and arg list and
differenceList ?string ?string "("\
strip ?strippedString ?string\
(if
notEmpty ?strippedString\
splitByAtLeastOneOf ?list ?strippedString " "\
= ?list [])\
mappedList ?result ?list replaceInGoal !parseGoalBrackets ?result ?string ID %$$% Integer$%S & ! and
is ?endFirst ?pos - 1\
is ?startRest ?pos + ?width\
subList ?first ?string 1 ?endFirst\
subList ?rest ?string ?startRest +splitAtPos ?first ?rest ?string ?pos ?width T at pos &splitAtPos ?first ?rest ?string ?pos 1 $splitAtPos ?first ?rest ?string ?pos W3 GroundTermmessage ?from ?to ?message 5 ! ] 5 !, #
##
conditionalOffer ?conditionActionList ?myOfferedActionList
= ?string "sdfsfsdf( sdf sdf ) dsfasf"\
foundSubList ?posBr ?string "("\
notInferred
(and
foundSubList ?posSp ?string " "\
greater ?posBr ?posSp)\
splitAtFirst ?firstStr ?restStr ?string "("\
findMatchingBracket ?posRBr ?restStr\
splitAtPos ?midStr ?tailStr ?restStr ?posRBr\
I will do ?myOfferedActionList if others do ?conditionActionList 5 ! %$7XparseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& ! "and
(if
splitAtFirst ?linkStuff ?descStr ?string ":"\
true\
(and
= ?linkStuff ?string\
= ?descStr []))\
cleanUp ?description ?descStr\
splitAtFirst ?conditionStr ?DestinationStr ?linkStuff "=>"\
parseACondition ?condition ?conditionStr\
cleanUp ?destination ?DestinationStr 9parseALink [?condition ?destination ?description] ?string a3 %$7XparseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& ! and
replaceInList ?inlineString ?string
3) numeric format, used to print all numbers in the term, which must currently be one of the following (if omitted, normal is assumed):
integer print as integers (rounding to nearest ones)
float print in floating point
'decimal-<n>' print as decimals with <n> decimal places (<n> can be any integer from 1 to 20, but note that SDML floating point numbers only have about 14 significant figures)
normal integer for members of type Integer, otherwise float
parseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& !W Oif
splitAtFirst ?nodeStuff ?restStringList ?nodeString "Indicators:"\
(and
(if
splitAtFirst ?nameStr ?descriptionStr ?nodeStuff ":"\
(and
stripLine ?name ?nameStr\
stripLine ?description ?descriptionStr\
(if
splitAtFirst ?indicatorStuff ?restStuff ?restStringList "
"\
(and
cleanUp ?cleanIndicatorStuff ?indicatorStuff\
parseIndicatorString ?indicatorList ?cleanIndicatorStuff\
parseRest ?actionList ?linkList ?restStuff)\
= ?indicatorStuff ?restStuff))\
error "No : to indicate node description"))\
error "No Indicators: in string" UparseNodeString [?name ?description ?indicatorList ?actionList ?linkList] ?nodeString x3 #
#
responsiveThreat ?othersActionList ?myResponseActionList
If others do ?othersActionList I will do ?myResponseActionList 5 !J 5 !A 77 5 !A %7$%$ & ! true asPrintedList [] [] ?sep empty singlePrinted ?string ?first #asPrintedList ?string [?first] ?sep one and
asPrintedList ?stringRest [?second ?third | ?rest] ?sep\
singlePrinted ?string1 ?first\
appended ?string ?string1 ?sep " " ?stringRest :asPrintedList ?string [?first ?second ?third | ?rest] ?sep many pand
singlePrinted ?string1 ?first\
singlePrinted ?string2 ?second\
appended ?string ?string1 " and " ?string2 +asPrintedList ?string [?first ?second] ?sep two asPrintedList ?string ?term "," asPrintedList ?string ?term 3 & !M .error "You have left an XXX marker in a rule!" XXX 3 5 !^ 7%7%7 & ! and
asSet ?set1 ?list1\
asSet ?set2 ?list2\
sortedList ?intersection ?memb
(and
includes ?set1 ?memb\
includes ?set2 ?memb) (intersection ?intersection ?list1 ?list2 3 7%7%7 & ! pairList ?pairList [] ?list pairList ?pairList ?list 3 4pairList ?pairList [[?first ?second] | ?soFar] ?rest 2pairList ?pairList ?soFar [?first ?second | ?rest] / true pairList ?soFar ?soFar [] false pairList + 7%7%7 & !] Fand
asSet ?set ?list\
sortedList ?pset ?subSet
subSet ?subSet ?set power ?pset ?list 3 %7%77 & ! false JreplaceStringeByFunctorsInTree ?resultTree ?tree ?listOfStringFunctorPairs 3 $%
Character%$ & ! )stripBack ?strippedString ?string parseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& !| fand
replaceInList ?inlineString ?string parseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& ! fand
splitBy ?actionStringList ?string "Action:"\
mappedList ?actions ?actionStringList parseAnAction parseActions ?actions ?string 3
5 !R Number%7 & ! )and
asSet ?set ?list\
length ?set ?size setSize ?size ?list 3 %$7XparseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& !j [and
splitBy ?linkStringList ?string "Link:"\
mappedList ?links ?linkStringList parseALink parseLinks ?links ?string 3 %7%77 & !K and
asSet ?set1 ?list1\
asSet ?set2 ?list2\
sortedList ?product ?pair
(and
includes ?set1 ?memb1\
includes ?set2 ?memb2\
= ?pair [?memb1 ?memb2]) product ?product ?list1 ?list2 3 ] 5 !D 5 !? %7%7%$77ZparseRest ?actionList ?linkList ?restStuff& !: ~if
splitAtFirst ?actionStuff ?linkStuff ?string "Link:"\
(and
parseLinks ?linkList ?linkStuff\
(if
splitAtFirst ?preAction ?postAction ?actionStuff "Action:"\
parseActions ?actionList ?postAction\
= ?actionList []))\
(and
= ?linkList []\
(if
splitAtFirst ?preAction ?postAction ?string "Action:"\
parseActions ?actionList ?postAction\
= ?actionList [])) 'parseRest ?actionList ?linkList ?string 3 #$%$%#$ & !k .notInferred
foundSubList ?pos ?string "Node:" 6splitIntoNodes [?string | ?lastList] ?lastList ?string + tand
splitAtFirst ?firstNodeString ?rest ?string "Node:"\
splitIntoNodes ?list [?firstNodeString | ?lastList] ?rest &splitIntoNodes ?list ?lastList ?string "/ splitIntoNodes ?list [] ?string splitIntoNodes ?list ?string "3 %77 & !I true asSet [] [] *+ and
isKindOf ?first List\
notInferred
isKindOf ?first String\
asSet ?firstAsSet ?first\
asSet ?restAsSet ?rest\
(if
includes ?restAsSet ?firstAsSet\
= ?set ?restAsSet\
= ?set [?firstAsSet | ?restAsSet])\
sortedList ?sortedSet ?m
includes ?set ?m !asSet ?sortedSet [?first | ?rest] - first is list and
(or
notInferred
isKindOf ?first List\
isKindOf ?first String)\
asSet ?restAsSet ?rest\
(if
includes ?restAsSet ?first\
= ?set ?restAsSet\
= ?set [?first | ?restAsSet])\
sortedList ?sortedSet ?m
includes ?set ?m !asSet ?sortedSet [?first | ?rest] - first is not list # 5 !S %$%$7%7 & !y rand
appended ?doubleMark ?mark ?mark\
replaceAll ?result ?string ?doubleMark ?mark\
splitBy ?list ?result ?mark 'splitByAtLeastOneOf ?list ?string ?mark 83 %7%7%77 & ! and
foundSubList ?pos ?old ?search\
splitAtFirst ?left ?right ?old ?search\
appended ?protoNew ?left ?replacement ?right\
replaceAll ?new ?protoNew ?search ?replacement )replaceAll ?new ?old ?search ?replacement =
found one +notInferred
foundSubList ?pos ?old ?search )replaceAll ?old ?old ?search ?replacement @ none _and
foundSubList ?pos ?replacement ?search\
error "Infinite search and replace"\
= ?new ?old )replaceAll ?new ?old ?search ?replacement @ error %$] & !Q objectName ?functor ?string replaceInGoal ?functor ?string K functor 5and
parsed ?string ?object\
isKindOf ?object Number replaceInGoal ?object ?string N number yand
thereExists
(and
indicator ?indicator\
printed ?string ?indicator)\
namedInstance ?object Indicator ?string replaceInGoal ?object ?string Nq S%$%S & ! true findMatchingBracket 0 ?string 0 X at position and
greater ?level 0\
(if
= ?char <(>\
is ?nextLevel ?level + 1\
(if
= ?char <)>\
is ?nextLevel ?level - 1\
is ?nextLevel ?level))\
findMatchingBracket ?posMinus ?rest ?nextLevel\
is ?pos ?posMinus + 1 /findMatchingBracket ?pos [?char | ?rest] ?level [ recurse forward empty string "findMatchingBracket ?pos ?string 1 findMatchingBracket ?pos ?string [3 %$$ & ! if
minValue ?minHashPos ?hashPos
index ?string ?hashPos <#>\
(and
is ?end ?minHashPos - 1\
subList ?result ?string 1 ?end)\
= ?result ?string stripComment ?result ?string e
end in cr %$7 & !7 Cif
= [<-> | ?rest] ?string\
= ?list [not ?rest]\
= ?list ?string parseNegation ?list ?string k3 $ 5 !~ 5 ! ]%$ & !v parsed ?string ?term reverseParsed ?term ?string r3 %$$ & !s `and
splitByAtLeastOneOf ?list ?string "
"\
mappedList ?commentlessList ?list stripComment\
mappedList ?cleanedList ?commentlessList [" " " "] replaceAll\
mappedList ?strippedList ?cleanedList strip\
mappedList ?listWithCR ?strippedList ["
"] appended\
appendedList ?preparsedString ?listWithCR\
replaceAll ?finalString ?preparsedString "
" "
" preparse ?finalString ?string w3 %$$ & !m Oand
stripTrailingSpaces ?result1 ?string\
stripLeadingSpaces ?result ?result1 stripSpaces ?result ?string |3 7%$XparseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& !8 nand
splitAtFirst ?actionStr ?descStr ?string ":"\
cleanUp ?action ?actionStr\
cleanUp ?description ?descStr ,parseAnAction [?action ?description] ?string`and
3 7%$X
= ?action "action"\
= ?description "description"\parseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& !f if
splitAtFirst ?agentStuff ?nodeStringList ?agentString "Node:"\
(and
splitIntoNodes ?nodeList ?nodeStringList\
mappedList ?nodeListList ?nodeList parseNodeString\
(if
splitAtFirst ?agentName ?restAgentStuff ?agentStuff ":"\
(and
cleanUp ?name ?agentName\
(if
splitAtFirst ?agentDescription ?indicatorStuff ?restAgentStuff "IndicatorWeights:"\
(and
(if
splitAtFirst ?indicatorWeightStuff ?afterStateVal ?indicatorStuff "StateValuationClause:"\
(and
(if
splitAtFirst ?indicatorExpressionStuff ?initialNodes ?afterStateVal "InitialNodes:"\
(and
cleanUp ?cleanInitialNodes ?initialNodes\
parseStartString ?startList ?cleanInitialNodes)\
(and
= ?startList []\
= ?indicatorExpressionStuff ?afterStateVal))\
cleanUp ?description ?agentDescription\
cleanUp ?indicatorString ?indicatorWeightStuff\
parseIndicatorString ?indicatorList ?indicatorString\
cleanUp ?indicatorExpression ?indicatorExpressionStuff)\
error "No indicator expression in string"))\
error "No IndicatorWeights in string"))\
error "No : after agent name"))\
error "No Node: in string" oparseAgentString [?name ?description ?indicatorList ?indicatorExpression ?nodeListList ?startList] ?agentStringif
3 $ 5 !q 7%7 & !N 9and
reversed [?last | ?rest] ?list\
reversed ?res ?rest butLast ?res ?list 3 %$$ & !c true stripLeadingSpaces [] [] Xif
= ?first
splitAtFirst ?agentStuff ?nodeStringList ?agentString "Node:"\
(and
splitIntoNodes ?nodeList ?nodeStringList\
mappedList ?nodeListList ?nodeList parseNodeString\
(if
splitAtFirst ?agentName ?restAgentStuff ?agentStuff ":"\
(and
cleanUp ?name ?agentName\
(if
splitAtFirst ?agentDescription ?indicatorStuff ?restAgentStuff "IndicatorWeights:"\
(and
cleanUp ?description ?agentDescription\
cleanUp ?indicatorString ?indicatorStuff\
parseIndicatorString ?indicatorList ?indicatorString)\
error "No IndicatorWeights: in string"))\
error "No : after agent name"))\
error "No Node: in string"\parseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& !6 gand
replaceInList ?inlineString ?string splitAtFirst ?firstStr ?afterStr ?string "("\ ® first and rest - first bracket and
cleanUp [?firstCh | ?rest] ?string\
notInferred
= ?firstCh <(>\
strip ?strippedRest ?rest\
splitAtFirst ?firstStr ?afterStr ?strippedRest "("\
parseGoalBrackets ?firstTree ?firstStr\
parseGoalBracketsList ?restTreeList ?afterStr\
appended ?list ?firstTree ?restTreeList #parseGoalBracketsList ?list ?string ± !firstand rest - no first bracket true parseGoalBracketsList [] [] ± ^and
notEmpty ?string\
differenceList ?string ?string "("\
parseGoalBrackets ?result ?string %parseGoalBracketsList ?result ?string ±D 7 5 !&
$ 5 !R %% Clause & !r ^and
sortedList ?list ?clause
?clause\
last ?timeLevel (sortedList ?list ?clause
?clause) $unchangedFromLast ?timeLevel ?clause 3 args Sand
sortedList ?list ?clause
?clause\
last (sortedList ?list ?clause
?clause) unchangedFromLast ?clause 2 args $ 5 !e %%$$ & !@ %strip ?strippedString ?string parseAgentString ?name ?description ?indicatorString ?nodeStringList ?agentString\& ! zand
replaceInList ?inlineString ?string and
conditional offer and
notInferred
actionPhase\
numSteps ?n\
findPossibleChain ?linkList ?n\
generatedInstance ?chain Chain (wrt [run] ?linkList)\
notInferred
previous (triedChain ?chain) 9and
consideredChain ?chain\
chainLinks ?chain ?linkListh
broadcast (conditionalOffer ?otherActions ?myActions ?endStateList)\
report self ": I will " ?actionString " if others " ?otherString " to achieve " ?endStateString "."\every negotiationCycle (and
considered chains, and
notInferred
actionPhase\
randomList ?saidList ?item true
(and
mostRecent negotiationCycle ?n (saidBy ?agent (conditionalOffer ?othersActions ?theirActions ?endStateList))\
= ?item [?agent ?othersActions ?theirActions ?endStateList])\
notEmpty ?saidList\
subSet ?subListOfSaidList ?saidList\
thereExists
includes ?subListOfSaidList [self | ?rest]\
notInferred
(and
includes ?subListOfSaidList [?agent1 ?othersActions1 ?theirActions1 ?endStateList1]\
thereExists
(and
includes ?othersActions1 ?oneOfOthersActions1\
notInferred
(and
includes ?subListOfSaidList [?agent2 ?othersActions2 ?theirActions2 ?endStateList2]\
includes ?theirActions2 ?oneOfOthersActions1))) $possibleAgreement ?subListOfSaidList
consideredChain ?chain\
chainLinks ?chain ?linkList)\and
find any agreements and
myConditionalOffer [] ?myActions ?endStateList\
notEmpty ?myActions\
notInferred
last negotiationCycle (saidTo ?other (conditionalOffer [] ?myActions ?endState))\
asPrintedList ?actionString ?myActions\
asPrintedList ?endStateString ?endStateList and
broadcast (conditionalOffer [] ?myActions ?endStateList)\
report self ": I will " ?actionString " to achieve " ?endStateString "."w
randomList ?saidList ?item true
(and
mostRecent negotiationCycle ?n (saidBy ?agent (conditionalOffer ?othersActions ?theirActions ?endStateList))\
= ?item [?agent ?othersActions ?theirActions ?endStateList])\
notEmpty ?saidList\
subSet ?subListOfSaidList ?saidList\
thereExists
includes ?subListOfSaidList [self | ?rest]\
includes ?subListOfSaidList [self ?othersActions1 ?theirActions1 ?endStateList1]\
(if
notEmpty ?othersActions1\
(and
includes ?othersActions1 ?otherAction1\
includes ?subListOfSaidList [?agent2 ?othersActions2 ?theirActions2 ?endStateList2]\
includes ?theirActions2 ?otherAction1))\and
unconditional offer false =report self ": I suggest the following agreement: " ?text "."c
broadcast (offer ?myActions)\
report self ": I will do " ?myActions "."\and
say agreement to agents and
toBeDoneBy self ?action\
currentlyHolds ?state\
possibleAction ?state ?action\
notInferred
last actionCycle (doneBy self ?action) yand
do ?action\
every actionCycle (doneBy self ?action)\
report self " has done " ?action "."\
final negotiationCycle #peform committments where possible pand
currentlyHolds ?endState\
stateValuationExpression ?clause\
valueStateExpression ?value ?endState ?clause currentValue ?value current value, and
notInferred
actionPhase\
saidBy ?agent (conditionalOffer ?wishList [] ?endStateList1)\
notInferred
= ?agent self\
currentlyHolds ?currentState\
sortedList ?myActions ?possAction
(and
possibleAction ?currentState ?possAction\
includes ?wishList ?possAction)\
notEmpty ?myActions\
saidBy self (conditionalOffer ?myWishList [] ?endStateList2)\
appended ?endStates ?endStateList1 ?endStateList2 4myConditionalOffer ?myWishList ?myActions ?endStates consider requests and
chosenChain ?chain\
chainLinks ?chain ?linkList\
lastOf ?lastLink ?linkList\
linkEnd ?lastLink ?endState\
currentlyHolds ?thisState\
notInferred
= ?endState ?thisState\
mappedList ?positiveActionSets ?linkList linkToActions\
flattened ?actionList ?positiveActionSets\
sortedList ?myActions ?action
(and
includes ?actionList ?action\
possibleAction ?aState ?action)\
differenceList ?othersActions ?actionList ?myActions and
every negotiationCycle (myConditionalOffer ?othersActions ?myActions [?endState])\
every negotiationCycle (triedChain ?chain)
myOfferOfAgreement ?agentOfferList ?endStates\
notInferred
last negotiationCycle (myOfferOfAgreement ?agentOfferList ?endStates)\
sortedList ?opStringList ?string
(and
includes ?agentOfferList [?agent ?actionList]\
printed ?agentString ?agent\
asPrintedList ?agentActionString ?actionList\
appended ?string ?agentString " will do " ?agentActionString)\
asPrintedList ?opString ?opStringList ";"\
asPrintedList ?endString ?endStates\
appended ?text ?opString " in order to achieve: " ?endString\and
make offer, message self ?other ?message /every negotiationCycle (saidTo ?other ?message) remember what I said and
last negotiationCycle (myOfferOfAgreement ?actionList ?endList)\
findAgreementName ?name ?actionList ?endList\
tabledAgreement ?name\
tabledAgreementActions ?name ?agent ?actions\
notInferred
last negotiationCycle (iHaveAgreedTo ?name) Nand
broadcast (iAgreeTo ?name)\
every negotiationCycle (iHaveAgreedTo ?name) agree +and
broadcast ?message\
negotiator ?other 5every negotiationCycle (message self ?other ?message).
chosenChain ?chain\
chainLinks ?chain ?linkList\
lastOf ?lastLink ?linkList\
linkEnd ?lastLink ?endState\
currentlyHolds ?thisState\
notInferred
= ?endState ?thisState\
mappedList ?positiveActionSets ?linkList linkToActions\
flattened ?actionList ?positiveActionSets\
sortedList ?myActions ?action
(and
includes ?actionList ?action\
possibleAction ?thisState ?action)\
differenceList ?othersActions ?actionList ?myActions\ notInferred
broadcast messages and
consideredChain ?chain\
chainLinks ?chain ?linkList\
(if
notEmpty ?linkList\
(and
lastOf ?lastLink ?linkList\
linkEnd ?lastLink ?endState)\
currentlyHolds ?endState)\
stateValuationExpression ?clause\
valueStateExpression ?value ?endState ?clause chainValue ?chain ?value
= ?other self\valueState
value chains, and
myConditionalOffer ?othersList [] ?endStateList\
notEmpty ?othersList\
notInferred
last negotiationCycle (saidTo ?other (conditionalOffer ?othersList [] ?endStateList))\
asPrintedList ?otherString ?othersList\
asPrintedList ?endStateString ?endStateList and
broadcast (conditionalOffer ?othersList [] ?endStateList)\
report self ": Can someone please " ?otherString " so we can achieve " ?endStateString "?"and
request actions and
myOfferOfAgreement ?agentOfferList ?endStates\
notInferred
last negotiationCycle (myOfferOfAgreement ?agentOfferList ?endStates)\
mappedList ?toList ?agentOfferList first\
includes ?agentOfferList [?toAgent | ?rest] Cmessage self ?toAgent (offerOfAgreement ?agentOfferList ?endStates) post agreement to agents nand
currentValue ?currentValue\
maxValue ?max ?value
(and
consideredChain ?chain\
chainValue ?chain ?value\
greater ?value ?currentValue)\
sortedList ?maxChainPairs ?pair
(and
consideredChain ?chain\
chainValue ?chain ?max\
calcChainLength ?len ?chain\
= ?pair [?len ?chain])\
mappedList [?chosenChain | ?restChain] ?maxChainPairs second chosenChain ?chosenChain
broadcast (request ?othersList)\
report self ": Can someone please do " ?othersList "?"\Choose chain by
choose chain, Fand
possibleAgreement ?list\
mappedList ?toList ?list first\
mappedList ?endStateList ?list lastOf\
flattened ?flatEndStateList ?endStateList\
asSet ?endStates ?flatEndStateList\
sortedList ?agentOfferList ?pair
(and
includes ?list [?agent ?otherActions ?theirActions ?stateList]\
= ?pair [?agent ?theirActions]) Fevery negotiationCycle (myOfferOfAgreement ?agentOfferList ?endStates) agreement offer <and
broadcast (iAgreeTo ?name)\
tabledAgreementActions ?name self ?myActions\
sortedList ?othersActions ?act
(and
tabledAgreementActions ?name ?agent ?actions\
notInferred
= ?agent self\
includes ?actions ?act)\
notEmpty ?myActions\
= ?othersActions []\
asPrintedList ?myActionsString ?myActions (report self ": I will " ?myActionsString "report that agree - unconditional tand
broadcast (iAgreeTo ?name)\
tabledAgreementActions ?name self ?myActions\
sortedList ?othersActions ?act
(and
tabledAgreementActions ?name ?agent ?actions\
notInferred
= ?agent self\
includes ?actions ?act)\
notEmpty ?myActions\
notEmpty ?othersActions\
asPrintedList ?myActionsString ?myActions\
asPrintedList ?othersActionsString ?othersActions Oreport self ": I agree to " ?myActionsString " if others " ?othersActionsString report that agree - conditional do actions doneBy ?agent ?action 0every negotiationCycle (perceivedAction ?action) X perceive actionsW and
notInferred
(and
linkCondition ?link ?clause\
?clause\
linkStart ?link ?start\
last actionCycle (currentlyHolds ?start))\
last actionCycle (currentlyHolds ?end) *every negotiationCycle (nextWillHold ?end)and
notInferred
(and
linkCondition ?link ?clause\
?clause\
linkStart ?link ?start\
last actionCycle (currentlyHolds ?start))\
last actionCycle (currentlyHolds ?end)\and
myState ?state\
namedInstance ?action Action "nullAction"\ u actions - null actiont and
= ?inintNumSteps 2 +every actionCycle (numSteps ?inintNumSteps) u paramst false every actionCycle (and
link ?link\
linkStart ?link ?state\
linkCondition ?link ?actionCondition\
linkEnd ?link ?state\
associatedText ?link standard ?linkDescr\
linkSign ?link true) and
myState ?state\
= ?linkDescr "null link"\
= ?actionConditionList "nullAction"\
generatedInstance ?link Link [?state ?actionConditionList ?state ?linkDescr]\
parseCondition ?actionCondition ?actionConditionList\ u links - null actiont and
negotiatorInfo self ?indicatorInfo ?indicatorExpressionString ?nodeInfo\
parseValuationExpressionString ?clause ?indicatorExpressionString 4every actionCycle (stateValuationExpression ?clause) u indicator expressiont and
negotiatorInfo self ?indicatorInfo ?indicatorExpression ?nodeInfo\
includes ?nodeInfo [?stateStr ?desc ?indicatorValues ?actionInfo ?linkInfo]\
cleanUp ?cleanedStateStr ?stateStr\
namedInstance ?state State ?cleanedStateStr\
includes ?actionInfo [?actionStr ?actionDescrStr]\
cleanUp ?cleanedActionStr ?actionStr\
cleanUp ?cleanedActionDescrStr ?actionDescrStr\
namedInstance ?action Action ?cleanedActionStr oevery actionCycle (and
possibleAction ?state ?action\
associatedText ?action standard ?cleanedActionDescrStr) u actionst and
negotiatorInfo self ?indicatorInfo ?indicatorExpression ?nodeInfo\
includes ?nodeInfo [?stateStr ?desc ?indicatorValues ?actionInfo ?linkInfo]\
cleanUp ?cleanedStateStr ?stateStr\
namedInstance ?state State ?cleanedStateStr\
includes ?linkInfo [?actionConditionList ?destinationStr ?linkDescr]\
cleanUp ?cleanedDestinationStr ?destinationStr\
(if
= [<-> | ?rootDestinationStr] ?cleanedDestinationStr\
= ?sign false\
(and
= ?rootDestinationStr ?cleanedDestinationStr\
= ?sign true))\
namedInstance ?destination State ?rootDestinationStr\
generatedInstance ?link Link [?state ?actionConditionList ?destination ?linkDescr]\
parseCondition ?actionCondition ?actionConditionList every actionCycle (and
link ?link\
linkStart ?link ?state\
linkCondition ?link ?actionCondition\
linkEnd ?link ?destination\
associatedText ?link standard ?linkDescr\
linkSign ?link ?sign) u linkst and
negotiatorInfo self ?indicatorInfo ?indicatorExpression ?nodeInfo\
includes ?nodeInfo [?stateStr ?desc ?indicatorValues ?actionInfo ?linkInfo]\
cleanUp ?cleanedStateStr ?stateStr\
cleanUp ?cleanedDesc ?desc\
namedInstance ?state State ?cleanedStateStr\
includes ?indicatorValues [?indicatorStr ?valueStr]\
namedInstance ?indicator Indicator ?indicatorStr\
parsed ?valueStr ?value every actionCycle (and
myState ?state\
associatedText ?state standard ?cleanedDesc\
stateValuation ?state ?indicator ?value) u states and indicatorst and
negotiatorInfo self ?indicatorInfo ?indicatorExpression ?nodeInfo\
includes ?indicatorInfo [?indicatorStr ?weightStr]\
namedInstance ?indicator Indicator ?indicatorStr\
parsed ?weightStr ?weight 9every actionCycle (indicatorWeighting ?indicator ?weight) u indicator weightst ] 5 [
5 R 7% & ` [and
linkCondition ?link ?cond\
actionsInCondition ?positiveActions ?negativeActions ?cond $linkToActions ?positiveActions ?link Ø3
GroundClause 5 - 5 X ] 5 ] 5 5 + 5 \ 5 5 Y 5 } %S#% & and
greater ?n 0\
is ?nMinus ?n - 1\
sortedList ?nextStates ?st
(and
linkStart ?link ?fromState\
linkEnd ?link ?nextState\
statesReachableInNSteps ?nextListOfStates ?nextState ?nMinus\
includes ?nextListOfStates ?st) @statesReachableInNSteps [?fromState | ?nextStates] ?fromState ?n ç/ true 3statesReachableInNSteps [?startState] ?startState 0 ê+ 3statesReachableInNSteps ?lsitOfStates ?startState 1 1statesReachableInNSteps ?lsitOfStates ?startState ê3 sole Boolean 5 E % 5 > 5 P $] 5 5 Z %#%] & _ total ?total ?weightedValue
and
indicatorWeighting ?indicator ?weight\
stateValuation ?state ?indicator ?value\
is ?weightedValue ?value * ?weight BvalueStateExpression ?total ?state sumOfAllWeightedIndicatorValues ùX yand
stateValuation ?state ?indicator ?value\
indicatorWeighting ?indicator ?weight\
is ?weightedValue ?value * ?weight NvalueStateExpression ?weightedValue ?state (weightedIndicatorValue ?indicator) ü> and
notInferred
isKindOf ?clause Number\
clauseList ?clause randomOneOf [?arg1]\
valueStateExpression ?list ?state ?arg1\
randomList [?value | ?rest] ?val (wrt [run actionCycle negotiationCycle] ?state ?clause ?list)
includes ?list ?val *valueStateExpression ?value ?state ?clause ü4 and
notInferred
isKindOf ?clause Number\
clauseList ?clause totalOf [?arg1]\
valueStateExpression ?list ?state ?arg1\
total ?value ?val
includes ?list ?val *valueStateExpression ?value ?state ?clause üh and
notInferred
isKindOf ?clause Number\
clauseList ?clause averageOf [?arg1]\
valueStateExpression ?list ?state ?arg1\
average ?value ?val
includes ?list ?val *valueStateExpression ?value ?state ?clause ü- and
notInferred
isKindOf ?clause Number\
clauseList ?clause maxOf [?arg1]\
valueStateExpression ?list ?state ?arg1\
maxValue ?value ?val
includes ?list ?val *valueStateExpression ?value ?state ?clause ü( and
notInferred
isKindOf ?clause Number\
clauseList ?clause minOf [?arg1]\
valueStateExpression ?list ?state ?arg1\
minValue ?value ?val
includes ?list ?val *valueStateExpression ?value ?state ?clause ü 7and
notInferred
isKindOf ?clause Number\
clauseList ?clause accessibleStateInOneStep [?arg1]\
statesReachableInNSteps ?listOfStates ?state 1\
sortedList ?pairList ?pair
(and
includes ?listOfStates ?st\
valueStateExpression ?val ?st ?arg1\
= ?pair [?st ?val])\
mappedList ?list ?pairList second )valueStateExpression ?list ?state ?clause ü accessibleStateInOneSteps rand
notInferred
isKindOf ?clause Number\
clauseList ?clause accessibleStateInNSteps [?arg2 ?arg1]\
valueStateExpression ?numSteps ?state ?arg1\
statesReachableInNSteps ?listOfStates ?state ?numSteps\
sortedList ?pairList ?pair
(and
includes ?listOfStates ?st\
valueStateExpression ?val ?st ?arg2\
= ?pair [?st ?val])\
mappedList ?list ?pairList second )valueStateExpression ?list ?state ?clause ü{ 'stateValuation ?state ?indicator ?value >valueStateExpression ?value ?state (indicatorValue ?indicator) ü and
notInferred
isKindOf ?clause Number\
clauseList ?clause sum ?argList\
total ?value ?summand
(and
includes ?argList ?arg\
valueStateExpression ?summand ?state ?arg) *valueStateExpression ?value ?state ?clause ü sum and
notInferred
isKindOf ?clause Number\
clauseList ?clause multiply [?arg1 ?arg2]\
valueStateExpression ?res1 ?state ?arg1\
valueStateExpression ?res2 ?state ?arg2\
multiply ?value ?res1 ?res2 *valueStateExpression ?value ?state ?clause ü multiply /and
isKindOf ?clause Number\
= ?value ?clause *valueStateExpression ?value ?state ?clause üS %
& t sand
clauseList ?clause ?and ?argList\
includes ?argList ?subClause\
negativeActionInCondition ?action ?subClause )negativeActionInCondition ?action ?clause and true HnegativeActionInCondition ?action (notInferred
perceivedAction ?action) negative action ò 5 C #
##
conditionalOffer ?conditionActionList ?myOfferedActionList
I will do ?myOfferedActionList if others do ?conditionActionList 5 x % & total ?total ?weightedVal
and
stateValuation ?state ?indicator ?val\
indicatorWeighting ?indicator ?weight\
is ?weightedVal ?val * ?weight valueState ?total ?state&Temporary until proper goals! by weights Ý 5 Ý 5 h 5 % 5 Ý 5 4 5 % & H and
chainLinks ?chain ?linkList\
mappedList ?actionSetList ?linkList linkToActions\
flattened ?flatList ?actionSetList\
withoutDuplicates ?actionList ?flatList\
length ?actionList ?len calcChainLength ?len ?chain 3 %The clause is true if the subclause was true at the previous time (at the specified time level, or the lowest one if that argument is omitted).
To be done depending on previous offered chains! end of offered chain Oand
greater ?n 0\
is ?nMinus ?n - 1\
findPossibleChain ?chainSoFar ?nMinus\
reversed ?revChainSoFar ?chainSoFar\
(if
= ?revChainSoFar []\
currentlyHolds ?reachedState\
(and
= [?lastLink | ?rest] ?revChainSoFar\
linkEnd ?lastLink ?reachedState))\
linkStart ?link ?reachedState\
appended ?nextChain ?chainSoFar [?link] findPossibleChain ?nextChain ?n recurse one step currentlyHolds ?state findPossibleChain [] 0 currently Holds Hand
greater ?n 0\
is ?nMinus ?n - 1\
findPossibleChain ?chain ?nMinus findPossibleChain ?chain ?n plus smaller ones 5 5 chainOriginator 5 d 7 5 T SÝ 5 { #
%#
& a and
sortedList ?positiveActions ?positiveAction
positiveActionInCondition ?positiveAction ?clause\
sortedList ?negativeActions ?negativeAction
negativeActionInCondition ?negativeAction ?clause