T:/opt/logicmoo_workspace/packs_xtra/programk/temp/allThat1.pl ::oneThat([first,you,must,make,a,plan,of,action]). T:/opt/logicmoo_workspace/packs_xtra/programk/temp/allSaid1.pl ::oneSaid([<,a,href,=,'\'',http, ::,/,/,en,'.',wikipedia,'.',org,/,wiki,/,'Determinism','\'',target,=,'\'','_',blank,'\'',>,'[','Determinism',']',<,/,a,>,is,the,philosophical,proposition,that,every,event,',',including,human,cognition,',',decision,and,action,',',is,causally,determined,by,an,unbroken,chain,of,prior,occurrences,'.']). T:/opt/logicmoo_workspace/packs_xtra/programk/temp/alice.aiml.pl ::response(['I', 'NEED', *], [random([li(['What', actions, are, you, taking, to, get, person, ?]), li(['How', badly, do, you, need, set(it, [set(topic, [person])]), ?]), li(['Why', do, you, need, it, so, badly, ?]), li(['Who', would, you, usually, get, that, from, ?]), li(['Where', do, you, usually, get, person, from, ?]), li(['When', do, you, need, that, by, ?])]), think([set(want, [person])])]). T:/opt/logicmoo_workspace/packs_xtra/programk/prolog/programk/logicmoo_module_aiml_shared.pl :: map_action(D, B, E) T:/opt/logicmoo_workspace/packs_xtra/programk/prolog/programk/cyc_pl/new_cyc.pl :: writeFmt('

',[]), T:/opt/logicmoo_workspace/packs_xtra/programk/prolog/programk/cyc_pl/cyc_newest.pl :: writeFmt('

Id	Name	Status	Actions	Options	Goals

',[]), T:/opt/logicmoo_workspace/packs_xtra/programk/prolog/programk/cyc_pl/cyc.pl :: writeFmt('

Id	Name	Status	Actions	Options	Goals

',[]), T:/opt/logicmoo_workspace/packs_xtra/programk/prolog/programk/aiml_1_0/bootstrap.aiml.pl ::response(['I', 'NEED', *], [random([li(['What', actions, are, you, taking, to, get, person, ?]), li(['How', badly, do, you, need, set(it, [set(topic, [person])]), ?]), li(['Why', do, you, need, it, so, badly, ?]), li(['Who', would, you, usually, get, that, from, ?]), li(['Where', do, you, usually, get, person, from, ?]), li(['When', do, you, need, that, by, ?])]), think([set(want, [person])])]). T:/opt/logicmoo_workspace/packs_xtra/programk/prolog/notaiml/webserver.pl :: form([action=location_by_id(aiml_page), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_6.vs.plotagent.ui.UserActionSelectionPanel.html ::

Updating possible actions for character ::

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_6.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction.html ::P_agent_6.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction

Log for :: P_agent_6.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction

Created on :: Tue Feb 23 15 ::30 ::18 CET 2016

Id	Name	Status	Actions	Options	Goals

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_6.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip.html ::P_agent_6.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Log for :: P_agent_6.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Created on :: Thu Nov 19 14 ::59 ::51 CET 2015

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_21.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction.html ::P_agent_21.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction

Log for :: P_agent_21.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction

Created on :: Thu Nov 19 16 ::20 ::24 CET 2015

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_21.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip.html ::P_agent_21.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Log for :: P_agent_21.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Created on :: Thu Nov 19 16 ::20 ::27 CET 2015

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_11.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction.html ::P_agent_11.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction

Log for :: P_agent_11.vs.plotagent.ui.multitouch.view.actioninterface.InterfaceButtonClickAction

Created on :: Thu Nov 19 15 ::54 ::10 CET 2015

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_11.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip.html ::P_agent_11.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Log for :: P_agent_11.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Created on :: Tue Oct 01 15 ::03 ::12 CEST 2013

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/log/P_agent_1.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip.html ::P_agent_1.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Log for :: P_agent_1.vs.plotagent.ui.multitouch.view.actioninterface.ActionButtonStrip

Created on :: Tue Sep 20 11 ::16 ::07 CEST 2016

T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/Uijlings actions/transitMove.pl ::% added ( ) around action to make the action name available as a variable value T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/Uijlings actions/transfer.pl ::% added ( ) around action to make the action name available as a variable value T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/Uijlings actions/action_db.pl ::% File which loads in the action database and contains the main functionality of the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/Uijlings actions/action.pl ::% added ( ) around action to make the action name available as a variable value T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/thread_management.pl :: ::- use_module(planner). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schemas/transitMove.pl_ :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schemas/transfer.pl_ :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schemas/manipulate.pl_ :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schemas/improvisation.pl_ ::% head((actionName, [Agens, Patiens, Target, Instrument | Vars])) ::- ?. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schemas/event.pl_ ::% action database T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schemas/action.pl_ ::% action database T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schema_management.pl ::% Used by e.g. the planner, but usable by any algorithm that is seeking to fulfill T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/schema_management.pl :: , action_schema/1 T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/pop_explicit_bindings.pl ::% Partial Order planner with explicit binding constraints T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/pop_explicit_bindings.pl ::% NOTE :: add cut after chooseStart? Because if a goal is already true, we don't want to use other actions in order to make them true. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/pop.pl ::% Partial Order planner T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/pop.pl ::% NOTE :: add cut after chooseStart? Because if a goal is already true, we don't want to use other actions in order to make them true. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/PlotAgent/BasicPlotAgent.pl :: possible_action/2, % +Agens, -Action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/planner.pl ::% Uses the partial-order planner to choose actions that attain the goal state, where it only selects T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/planner.pl ::% Agent interface to the planner. What it does is provide functionality to T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/operators/transitMove.pl :: action, T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/operators/transfer.pl :: action, T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/operators/operators.pl ::% action, T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/operators/improvisations.pl ::% head((actionName, [Agens, Patiens, Target, Instrument | Vars])) ::- ?. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/operators/events.pl ::% action database T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/operators/actions.pl ::% action database T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/narrator.pl ::% Narrate an action or event T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/narrative_inspiration.pl :: createValidatedAction/3, % +RDFList, +ActionClass, -Action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/load_character.pl :: ::- use_module('planner.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/load.pl :: (getFromSchema(S, class(action)) ; getFromSchema(S, class(improvisation)) ), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/knowledgebase.plt :: query(rule(fabula ::'FabulaElement', owlr ::is, 'http :://www.owl-ontologies.com/FabulaKnowledge.owl#Action')). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/global_operators.pl :: fact(fabula ::'story_phase', is, fabula ::'rising_action') T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/fabula.pl :: action_rule_cause/2, T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/continuous.pl ::% For instance, Linda's plan involving an action "EatIce" with as precondition that she has ice might specify an action to T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/continuous.pl ::% Continuous planner, based on the partial order planner algorithm defined in pop.pl T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/CharacterAgent/reactive_layer.pl :: select_action_rule/2 % (+Agens, -ActionSelectionRule) See which actions are triggered in the current context of the simulation T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/CharacterAgent/BasicCharacterAgent.pl ::% Convert a goal to intentions for the planner, by taking its success conditions. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/prolog/CharacterAgent/BasicCharacterAgent.pl :: hasAction/2, % +Agens, -Actions T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/ontology/VSTontology.pont ::;+ (comment "The thing (e.g. Action) that causes this world change. Empty could be interpreted as \"no cause\", i.e. a setting change.") T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/test/schemas/schema.pl :: ::- multifile action_schema/1. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/swordfight/schemas/transitMove.pl :: % Agens can do the action, either with his own body or using an instrument that can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/swordfight/schemas/transfer.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/swordfight/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/swordfight/schemas/manipulate.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/swordfight/schemas/action.pl ::% action database for pirates T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/red/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/red/schemas/expectation.pl :: % Problem :: Act might bind with action already in the fabula, in which case these statements form T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/red/schemas/action_selection_rules.pl ::% Action selection rules. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/red/schemas/action.pl ::% action database for red T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_pjotter/schemas/transitMove.pl :: % Agens can do the action, either with his own body or using an instrument that can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_pjotter/schemas/transfer.pl :: % Can't steal from yourself; this might speed up the planner T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_pjotter/schemas/transfer.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_pjotter/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_pjotter/schemas/manipulate.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_pjotter/schemas/inference.pl :: fact(fabula ::'story_phase', is, fabula ::'rising_action') T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_pjotter/schemas/action.pl ::% action database for pirates T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper2/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper2/schemas/Copy of action.pl ::% Action database for the pirates_jasper2 domain T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper2/schemas/action.pl ::% Action database for the pirates_jasper2 domain T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper2/narration/narration.pl ::% Action semantics :: AGENS loads PATIENS with INSTRUMENT T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper/schemas/transitMove.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper/schemas/transfer.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper/schemas/manipulate.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_jasper/schemas/action.pl ::% Action database for the pirates_jasper domain T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo2/schemas/schemas.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo2/schemas/expectations.pl :: % There is (gonna be) a stab action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo2/schemas/actions_transitMove.pl :: % Agens can do the action, either with his own body or using an instrument that can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo2/schemas/actions_transfer.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo2/schemas/actions_manipulate.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo2/schemas/actions.pl ::% action database for pirates T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo2/schemas/action_selection_rules.pl ::% Action selection rules. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo/schemas/transitMove.pl :: % Agens can do the action, either with his own body or using an instrument that can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo/schemas/transfer.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo/schemas/manipulate.pl :: % Agens can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates_ivo/schemas/action.pl ::% action database for pirates T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates/schemas/transitMove.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates/schemas/transfer.pl :: Swartjes :: PutOnSelf is identical to PutOn with the target bound to Agens. The planner will find it automatically. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates/schemas/transfer.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates/schemas/manipulate.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/pirates/schemas/action.pl ::% action database for pirates T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/make_love_not_war/schemas/transitMove.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/make_love_not_war/schemas/transfer.pl :: Swartjes :: PutOnSelf is identical to PutOn with the target bound to Agens. The planner will find it automatically. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/make_love_not_war/schemas/transfer.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/make_love_not_war/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/make_love_not_war/schemas/manipulate.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/make_love_not_war/schemas/goal.pl :: % The planner cannot really deal with this either, will try to cause that either there is no ExpressHate action at all, T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/make_love_not_war/schemas/action.pl ::% action database for love-not-war T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop_dialogue/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop_dialogue/schemas/action.pl ::% action database for lollipop T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop/threads/schema.pl_ :: ::- include('action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop/schemas/transitMove.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop/schemas/transfer.pl :: Swartjes :: PutOnSelf is identical to PutOn with the target bound to Agens. The planner will find it automatically. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop/schemas/transfer.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop/schemas/manipulate.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/lollipop/schemas/action.pl ::% action database for lollipop T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/hitch/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/hitch/schemas/action.pl ::% I think that there were conflicting preconditions in the Move action_schema and the BeAtEarth T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/hitch/narration/narration.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit_demo_y1/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit_demo_y1/schemas/expectation.pl :: % Problem :: Act might bind with action already in the fabula, in which case these statements form T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit_demo_y1/schemas/action_selection_rules.pl ::% Action selection rules. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit_demo_y1/schemas/action.pl ::% action database for red T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit/schemas/schema.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit/schemas/action.pl ::% Example action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit/narration/narration_category.pl :: Text = ['Action']. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/commit/narration/narration.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/coherence_test/schemas/schemas.pl ::% ::- consult(schemas ::'action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/coherence_test/schemas/expectations.pl :: % There is (gonna be) a stab action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/coherence_test/schemas/actions_transfer.pl :: % Agent can do the action T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/coherence_test/schemas/actions_manipulate.pl :: fact(Road, swc ::from, CurrLoc), % CAREFUL, this disables any improvisation actions with effect "fromGeographicArea" or "toGeographicArea". T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/coherence_test/schemas/actions.pl ::% action database for pirates T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/coherence_test/schemas/action_selection_rules.pl ::% Action selection rules. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/coherence_test/narration/narration.pl ::% ACTIONS AND EVENTS T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/cinderella/schemas/transitMove.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/cinderella/schemas/transfer.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/cinderella/schemas/schema.pl :: ::- include('action.pl'). T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/cinderella/schemas/manipulate.pl :: class(action), T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/cinderella/schemas/improvisation.pl ::% head((actionName, [Agens, Patiens, Target, Instrument | Vars])) ::- ?. T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/cinderella/schemas/event.pl ::% action database T:/opt/logicmoo_workspace/packs_usr/redplushunter/VirtualStoryteller/knowledge/domain/cinderella/schemas/action.pl ::% action database T:/opt/logicmoo_workspace/packs_usr/readylog/interpreter/readylog.pl ::/* (1)- exogenous action occured */ T:/opt/logicmoo_workspace/packs_usr/readylog/interpreter/preprocessor.pl ::/* special rule for set(fluentname, Value)-action :: T:/opt/logicmoo_workspace/packs_usr/readylog/interpreter/options.pl ::bestDoMOpt(Name, Action, checkEvents, S, H, R, PL, T:/opt/logicmoo_workspace/packs_usr/readylog/interpreter/final_trans.pl :: * Make sure that after trans/4 completes, the history actually contains a new action. T:/opt/logicmoo_workspace/packs_usr/readylog/interpreter/definitions.pl :: exog_action/1, exog_occurs/2, T:/opt/logicmoo_workspace/packs_usr/readylog/interpreter/decisionTheoretic.pl :: /* end of chain :: do next action */ T:/opt/logicmoo_workspace/packs_usr/readylog/interpreter/config.pl :: * it means that after each action the database will be progressed T:/opt/logicmoo_workspace/packs_usr/readylog/examples/maze/xtra.pl :: * description :: eXecution TRAnsformation which maps primitive actions T:/opt/logicmoo_workspace/packs_usr/readylog/examples/maze/run.pl ::/* dt-planning on primitive actions T:/opt/logicmoo_workspace/packs_usr/readylog/examples/blocksworld/blocksworld.pl ::prim_action(stack(X, Y)) ::- T:/opt/logicmoo_workspace/packs_usr/OSCAR-web-page/PAPERS/Planner43-Reason-schemas.pdf ::1 0 obj << /CreationDate (D ::19991130160037) /Producer (Acrobat Distiller 3.01 for Power Macintosh) /Creator (Nisus\250 Writer :: LaserWriter 8 8.6.5) /Author (John L. Pollock) /Title (Planner43-Reason-schemas) >> endobj 3 0 obj << /Length 1267 /Filter [/ASCII85Decode /FlateDecode] >> stream T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/swi_prolog/water.pl ::legal_move([_V1,V2],Action,S1) ::- T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/swi_prolog/pert.pl ::% Times for each action T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/swi_prolog/farmer2.pl :: Plan=[Action|Plan1], T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/swi_prolog/farmer.pl ::legal_move([F,F,G,C],Action,S1) ::- T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/swi_prolog/bplan.pl :: General planner in SWI Prolog T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/sicstus/pert.pl ::% Times for each action T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/psi_ppl/icy_road.psi :: This example shows d-separation in action. The risks of Holmes and Watson crashing are only dependent T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/wumpus_v3.pi :: c_action(A), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/water.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/water.pi :: Later note :: Added the current water levels in the actions. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/trace_domains_ar_test.pi :: Trace domains via Action Rules in Picat. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/trace_domains_ar.pi :: Trace domains via Action Rules in Picat. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/tpk.pi :: * Print and show the program in action from a typical run here. (If the T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/towers_of_hanoi_planner.pi ::% Actions T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/towers_of_hanoi_planner.pi :: Towers of Hanoi as a planner problem T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/three_piles_of_coins.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/three_piles_of_coins.pi ::% The actions T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_water_jugs.pi :: This version use the built-in module planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_rotation.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_railroad_switching.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_railroad_switching.pi :: action(From,To,Move,_). T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_puzzle2x3.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_puzzle2x3.pi :: % action(S2,$up(X),S1). T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_monkey_banana.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_missionaries_and_cannibals.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_maze.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_M12.pi :: This variant use the built-in planner module instead of my bplan. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_farmer.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_farmer.pi ::action([F,F,G,C],S1,Action,ActionCost) ?=> T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_coins_planning.pi :: The three-coins problem formulated for the general planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_1d_rubiks_cube.pi :: This version use the built-in module planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/test_planner_1d_rubiks_cube.pi :: action(Init1,Init2,Move,_Cost), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner_gps.pi :: - http :://www.hakank.org/picat/school_problem_planner.pi T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner_gps.pi :: - name (action) T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner3.pi :: - http :://www.hakank.org/picat/school_problem_planner1.pi T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner3.pi :: - name (action) T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner2.pi :: - http :://www.hakank.org/picat/school_problem_planner.pi T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner2.pi :: - name (action) T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner.pi :: - http :://www.hakank.org/picat/school_problem_planner2.pi T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/school_problem_planner.pi :: - name (action) T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/robot_simple_planner.pi :: Simple robot planner in Picat. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/planning_letters.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/planning_letters.pi ::action(S1,S2,Action,Cost) => T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/pert.pi ::% Times for each action T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/pereira_v3.pi ::% how many Iterations of the Action and its Control to perform. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/peg_planner.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/peg_planner.pi ::action(Grid,New_Grid, Action, Action_Cost) ?=> T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/parsing_rpn_calculator_algorithm_v3.pi ::Token Action Stack T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/murder.pi :: % the actions T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/movement_puzzle.pi :: - puzzle3/2 planner approach T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/monkey_banana_gps.pi ::% import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/min_adjacent_coins.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/min_adjacent_coins.pi :: % println($action(from=From,To,Move,Cost)), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/mcsam.pi :: member([_Action|Args],Story), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/mceverywhere.pi :: planner for McEverywhere corporation, you have been asked to build restaurants T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/maze_gps.pi :: Compare with http :://www.hakank.org/picat/test_planner_maze.pi T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/M12.pi :: official planner module. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/lights_out_all.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/lighting_candles.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/lighting_candles.pi :: action(Action,S,S1), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/leap_frog_puzzle.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/knights_in_fen.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/gps_utils.pi :: Here are predicates for a GPS (General Problem Solver) like planner, T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/gps_utils.pi :: * action/4 :: for the planner module) T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/giant_cat_army_riddle.pi :: - go/0 :: Using planner. 178.4s T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/four_knights.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/fizzbuzz.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/farmer_cp.pi ::% actions T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/cookie_monster_problem_planner.pi :: This is a simple model usings the planner module. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/conways_game_of_life.pi :: glider in a larger universe, show the action of the blinker (three adjoining cells T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/coins_planning2.pi :: Note :: This problem don't generate all possible combinations, instead it use the planner module... T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/coins_planning.pi :: The three-coins problem formulated for the general planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/building_a_house_planner.pi :: House building problem as a planner problem in Picat. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/building_a_house_planner.pi :: - one using the planner module (action/4), go/0 and go/1 T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/bridge_and_torch_problem.pi :: This is a fairly general program using the planner module :: T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/bratko_planning.pi ::% ensure that drop is the last action T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/bplan.pi :: legal_move(S,Action,S1,ActionCost), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/bplan.pi :: General planner, inspired by "Thinking as computation" (plan.pl and bplan.pl), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/blocks_world_gps.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/block_length_planner.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/block_length_planner.pi :: % println($action([Sum1|From1],To,Move,Cost) ), T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/alphametic2.pi ::% actors+actors=planner = 10 T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/air_cargo_gps.pi ::% actions :: Load, unload and fly. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/8_puzzle_gps.pi :: planner program in T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/8_puzzle_gps.pi :: 1) The first approach (orignal action/4) have everything in the data structure, T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/8_puzzle.pi ::import planner. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/8_puzzle.pi ::% The valid actions, where 9 is the blank. T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/picat/10_one_liners.pi :: Words = ["picat", "bprolog", "constraints", "csp", "action rules"], T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/bprolog/pert.pl ::% Times for each action T:/opt/logicmoo_workspace/packs_usr/cTI/hakank/bprolog/1d_rubiks_cube.pl ::% General planners (inspired by "Thinking as computation", plan.pl and bplan.pl) T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/various/plan.pl ::transform(State1,State2,Visited,[Action|Actions]) ::- T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/SterlingShapiro/aop.pl ::% Program 14.11 :: A depth-first planner T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/SterlingShapiro/aop.pl :: Plan is a plan of actions to transform State1 into State2. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/strips_strips.pl ::% U0 is the bound on the number of actions going into achieve_all T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/strips_strips.pl ::% A SIMPLE STRIPS PLANNER USING STRIPS NOTATION (Figure 8.2) T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/regr_strips_sim.pl ::% A SIMPLE REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION (Figure 8.4) T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/regr_strips.pl ::% A REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/popsim.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/popsim.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/popold3.pl ::% PARTIAL ORDER PLANNER THAT USES STRIP REPRESENTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/popold3.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/popold2.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/popold1.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/pop_sics.pl ::% PARTIAL ORDER PLANNER THAT USES STRIP REPRESENTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/pop_sics.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/pop.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION (Figures 8.5 & 8.6) T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/pop.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/delrob_strips.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/delrob_sitc.pl ::% ACTION PRECONDITIONS T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/Blocks_world/strips_holds.pl ::% A SIMPLE STRIPS PLANNER FOR ACTIONS IN HOLDS NOTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/Blocks_world/regr_strips_sim.pl ::% A SIMPLE REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/Blocks_world/regr_strips.pl ::% A REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/Blocks_world/regr_holds.pl ::% A SIMPLE REGRESSION PLANNER FOR ACTIONS IN HOLDS NOTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/Blocks_world/pop.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch8/Blocks_world/blocks-strips.pl ::% FOR PARTIAL ORDER PLANNER T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch11/nnl_t1.pl ::% New case with unknown user action :: T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/ch11/dtlearn_t1.pl ::val(e1,user_action,skips). val(e1,author,known). val(e1,thread,new). T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop_t.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop3a.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop3a.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop3.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop3.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop2.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop2.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION (Section C.5) T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Poole/apc/pop.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/NLP-Covington/earleys.pl ::predictor(_). % then succeed with no further action. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/NLP-Covington/earley.pl ::predictor(_). % then succeed with no further action. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/NLP-Covington/dbquery.pl :: action(W,X^Q), T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/CovingtonNuteVellino/planner.pl ::/* PLANNER.PL */ T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig4_5.pl ::% Figure 4.5 A flight route planner and an example flight timetable. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig23_13.pl ::% Condition ---> Action until action `stop' is triggered T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_9.pl ::s( Goals -> NextAction, NewGoals -> Action, 1) ::- % All costs are 1 T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_8.pl ::% Figure 17.8 A planner based on goal regression. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_8.pl :: conc( PrePlan, [Action], Plan), % Divide plan achieving breadth-first effect T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_6.pl ::% Figure 17.6 A means-ends planner with goal protection. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_6.pl :: conc( PrePlan, [Action | PostPlan], Plan), % Divide plan T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_5.pl ::% Figure 17.5 A simple means-ends planner. T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_5.pl :: conc( PrePlan, [Action | PostPlan], Plan), % Divide plan T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/prologbook/Bratko/fig17_2.pl ::% Definition of action move( Block, From, To) in blocks world T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/medium/plan.pl ::transform(State1,State2,Visited,[Action|Actions]) ::- T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/large/lg_sys.pl ::earley_action(X) ::- '$top'(X). T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/large/gnuprolog2.pl ::bip(set_stream_eof_action,2). T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/large/aop.pl ::% Program 14.11 :: A depth-first planner T:/opt/logicmoo_workspace/packs_usr/cTI/benchterm/large/aop.pl :: Plan is a plan of actions to transform State1 into State2. T:/opt/logicmoo_workspace/packs_usr/aop/Chapter14/program-14.16.prolog :: member([Action|Args],Story), T:/opt/logicmoo_workspace/packs_usr/aop/Chapter14/program-14.12.prolog ::% Program 14.12 :: Testing the depth-first planner T:/opt/logicmoo_workspace/packs_usr/aop/Chapter14/program-14.11.prolog ::% Program 14.11 :: A depth-first planner T:/opt/logicmoo_workspace/packs_usr/aop/Chapter14/program-14.11.prolog :: Plan is a plan of actions to transform State1 into State2. T:/opt/logicmoo_workspace/packs_sys/wam_common_lisp/prolog/wam_cl/readers.pl ::[16 ::28] it would take an inform7 code, then cull the pscript db for matching rules/objects that maps to nouns & actions T:/opt/logicmoo_workspace/packs_sys/wam_common_lisp/prolog/wam_cl/init.pl ::Lisp Startup actions :: T:/opt/logicmoo_workspace/packs_sys/wam_common_lisp/prolog/wam_cl/compat/utils_writef.pl ::writefs([37,A|Rest], List) ::- % % T:/opt/logicmoo_workspace/packs_sys/wam_common_lisp/prolog/wam_cl/ci.pro ::struct_opv(claz_event_info,has_slot,slot(claz_t,"action")). T:/opt/logicmoo_workspace/packs_sys/swicli/prolog/swicli.pl ::% m(40,'ForEach'('System.Action'('String'))) T:/opt/logicmoo_workspace/packs_sys/standalone/t/sanity_tests.pl ::% dmsg :: stream_property((0x232b8a0),eof_action(eof_code)). T:/opt/logicmoo_workspace/prologmud_server/src_game_wumpus/objs_misc_monster.pfc.pl ::% # act_energy(Action,N) where N is any positive or negative integer (not 0) T:/opt/logicmoo_workspace/prologmud_server/src_game_startrek/mobs/federation.pl ::% Possible tAgent actions. T:/opt/logicmoo_workspace/prologmud_server/src_game_startrek/holodeck/objs_misc_monster.pfc.pl ::% # act_energy(Action,N) where N is any positive or negative integer (not 0) T:/opt/logicmoo_workspace/prologmud_server/run_mud_server.pl :: '--planner', % Load any planners T:/opt/logicmoo_workspace/prologmud_server/run_mud_server.pl :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/prologmud_server/init_mud_server.pl :: '--planner', % Load any planners T:/opt/logicmoo_workspace/prologmud_server/init_mud_server.pl :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/prologmud_server/compile_mud_server.pl :: '--planner', % Load any planners T:/opt/logicmoo_workspace/prologmud_server/compile_mud_server.pl :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/prologmud_server/circlemuddata/doall.py :: actionBitVectorArg, affectBitVectorArg, alignmentArg, typeArg = content[lineNum].split() T:/opt/logicmoo_workspace/prologmud_server/circlemuddata/convert_obj_files.py :: actionDescArg = content[lineNum+4][ ::-1] T:/opt/logicmoo_workspace/prologmud_server/circlemuddata/convert_mob_files.py :: actionBitVectorArg, affectBitVectorArg, alignmentArg, typeArg = content[lineNum].split() T:/opt/logicmoo_workspace/prologmud_server/btepisode/npc.pl :: [[ % actions in parallel T:/opt/logicmoo_workspace/prologmud_server/attic/test_release.pl ::% ::- user ::test_for_release(library(logicmoo_planner)). T:/opt/logicmoo_workspace/prologmud_server/attic/test_release.pl :: ::- enqueue_agent_action("rez crackers"). T:/opt/logicmoo_workspace/prologmud_server/.local/lib/python3.8/site-packages/butterfly/bin/cat.py ::parser.add_argument('-o', action="store_true", T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud_web/src_webui/mudconsole/mudconsole.pl :: [ form([id(Id), action(HREF)], []) T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/vworld/world_text.pfc.pl ::% Writer NPC_Interface for supporting inforation based actions T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/vworld/world_npc.pfc.pl ::do_agent_call_plan_command(A,C) ::- t_l ::agent_current_action(A,CC),dmsg(too_busy(CC,agent_call_plan_command(A,C))),!. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/vworld/world_effects.pfc.pl ::do_act_affect(Agent,Action,Obj) ::- T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/vworld/world_agent.pfc.pl ::% NPC_Interface for calling actions T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/vworld/world_2d.pfc.pl ::% ::-export decl_database_hook/2. action_info T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/vworld/world.pfc.pl :: % call_agent_action/2, T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/server/mud_testing.pl :: do_agent_action('tp self to Area1000'), T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/server/mud_telnet.pl :: call_u(start_agent_action_thread), T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/server/mud_irc.pl :: ::- multifile baseKB ::agent_action_queue/3. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/parsing/simple_decl_parser.pl :: type_action_info(tHumanControlled, T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/parsing/parser_imperative.pl :: ::-ain((==>type_action_info(tHumanControlled,actParse(tCol,ftListFn(ftString)),"Development test to parse some Text for a human. Usage :: parse 'item' the blue backpack"))). T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mud_loader.pl ::% NPC planners T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mud_loader.pl ::% ::-foc_current_agent(P),assertz_if_new(agent_action_queue(P,chat80)). T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mud_builtin.pfc.pl :: ::- multifile baseKB ::agent_action_queue/3. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/vacuum.pfc.pl ::% Possible agent actions. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/prey.pfc.pl ::% Possible agent actions. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/predator.pfc.pl ::% Possible agent actions. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/pddl_agent.pfc.pl ::% Possible agent actions. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/monster.pfc.pl ::% Possible agent actions. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/mobs_conf.pfc.pl ::% action_info_db T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/explorer.pfc.pl ::% Possible agent actions. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/affordance/simbots.pfc.pl ::defined_affordance([subjType= "Passable",actionVerb= "TravelThru"]). T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/mobs/affordance/improve.pfc.pl ::% That means :: remove its on the todo list and enqueue the action) T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/where.pfc.pl ::% This file defines the agents action of eating. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/use.pfc.pl ::meta_argtypes(action_verb_useable(vtVerb,tCol,ftTerm(tPred),ftTerm(tPred),ftTerm(tPred))). T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/take.pfc.pl :: \+ call_u(action_verb_useable(actTake,_,_,_,_)), T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/stats.pfc.pl ::% wasSuccess(Agent,_What,Suc) = checks success of last action (actually checks the cmdfailure predicate) T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/sit.pfc.pl ::% converts vtPosture ::"vSleep" to Action vtVerb ::"actSleep" T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/push.pfc.pl ::% This is meant to be used as a basic template for how the action T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/planner.pfc.pl ::% This file defines the agents action of planning and carries out plan. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/planner.pfc.pl ::% planner.pl T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/look.pfc.pl ::% This file defines the basic look action T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/help.pfc.pl :: ::- kb_global(baseKB ::type_action_info/3). T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/eat.pfc.pl ::% This file defines the agents action of eating. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/drink.pfc.pl ::% This file defines the agents action of drinking. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/create.pfc.pl ::% mudLastCmdSuccess(Agent,Action,Suc) = checks success of last action (actually checks the cmdfailure predicate) T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/climb.pfc.pl ::% This file defines the agents action of climbing. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/attack.pfc.pl ::% This file defines the agents action of attacking. T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/as_agent.pfc.pl ::agent_call_command(_Agent,'actAs'(OtherAgent,Command)) ::- do_agent_action(OtherAgent,Command). T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/any.pfc.pl ::% action_requires_states(Agent,StateRules,REQS), T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/actions_db.pfc.pl :: File :: actionDatabase.pl T:/opt/logicmoo_workspace/packs_sys/prologmud/prolog/prologmud/actions/actions_conf.pfc.pl ::% bugger ::action_verb_useable(actWearUnused,wearsClothing,tWearAble,mudPossess). T:/opt/logicmoo_workspace/packs_sys/predicate_streams/t/sanity_tests.pl ::% dmsg :: stream_property((0x232b8a0),eof_action(eof_code)). T:/opt/logicmoo_workspace/packs_sys/pfc/t/vlibs/pfc_3_0_full.pl ::% %% predicates for manipulating action traces. T:/opt/logicmoo_workspace/packs_sys/pfc/t/vlibs/pfc_2_2_full.pl ::%% predicates for manipulating action traces. T:/opt/logicmoo_workspace/packs_sys/pfc/t/vlibs/pfc_2_0_full.pl :: action_is_undoable/1, T:/opt/logicmoo_workspace/packs_sys/pfc/t/vlibs/pfc_1_8_full.pl ::%= predicates for manipulating action traces. T:/opt/logicmoo_workspace/packs_sys/pfc/t/vlibs/pfc_1_3_full.pl ::%= predicates for manipulating action traces. T:/opt/logicmoo_workspace/packs_sys/pfc/t/vlibs/pfc_1_2_full.pl ::%= predicates for manipulating action traces. T:/opt/logicmoo_workspace/packs_sys/pfc/t/unit_tests/na.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/unit_tests/lion.pl ::%% causes(action,state,new_state). T:/opt/logicmoo_workspace/packs_sys/pfc/t/unit_tests/lion.pfc ::%% causes(action,state,new_state). T:/opt/logicmoo_workspace/packs_sys/pfc/t/unit_tests/bulbs.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/unit_tests/bulb1.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/unit_tests/adder.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/tabling-tests/Bench/aspclp/block.pl ::%% Actions = [ [ Block, ToBlock], ... ] (a list of NTime pairs) T:/opt/logicmoo_workspace/packs_sys/pfc/t/pfc1.2/src/pfccore.pl ::%% predicates for manipulating action traces. T:/opt/logicmoo_workspace/packs_sys/pfc/t/pfc1.2/ex/na.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/pfc1.2/ex/lion.pl ::%% causes(action,state,new_state). T:/opt/logicmoo_workspace/packs_sys/pfc/t/pfc1.2/ex/lion.pfc ::%% causes(action,state,new_state). T:/opt/logicmoo_workspace/packs_sys/pfc/t/pfc1.2/ex/bulbs.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/pfc1.2/ex/bulb1.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/pfc1.2/ex/adder.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/pfc/t/feature_inherit_kb/microtheory.pl :: ::- consult(pack('free-life-planner/lib/util/util.pl')). T:/opt/logicmoo_workspace/packs_sys/pfc/t/feature_inherit_kb/contents2.pl :: ::- include(pack('free-life-planner/data-git/systems/planning/state-exporter')). T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/pfclib/system_base.pfc.pl ::rtArgsVerbatum(mpred_action). T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/pfclib/system_autoexec_3_0.pfc.pl ::rtArgsVerbatum(pfc_action). T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/pfc_iri_resource.pl ::%! pfc_iri_hook(+Action, +IRI, -Stream) is det. T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dra/meta.sav_k/tabling/dra_common.pl :: % The main action :: T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dra/meta.sav_k/internal/tabling/dra2_common.pl :: % The following administrative actions are needed only when we are here T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dra/meta.sav_k/internal/tabling/archive/eager_tabling.pl ::% the actions taken. T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dra/meta.sav_k/internal/Bench/aspclp/block.pl ::%% Actions = [ [ Block, ToBlock], ... ] (a list of NTime pairs) T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dra/dra.pl :: % The main action :: T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dialect/pfc_ext/mpred_loader.pl :: load_file_term_to_command_1(pfc(act),(H ::-(Chain,B)),(PFC==>PH)) ::-cwc, is_action_body(Chain),pl_to_mpred_syntax((Chain,B),PFC),pl_to_mpred_syntax_h(H,PH). T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dialect/pfc_ext/mpred_justify.pl :: (Trigger= nt(F,Condition,Action) -> T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dialect/pfc_ext/mpred_header.pro ::baseKB ::type_action_info/3, T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dialect/pfc_ext/mpred_expansion.pl ::exact_args_f(action_info). T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dialect/pfc_ext/mpred_database.pl ::%% is_mpred_action( ::TermP) is semidet. T:/opt/logicmoo_workspace/packs_sys/pfc/prolog/dialect/pfc_ext/mpred_core.pl :: action_is_undoable/1, T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/utils/states_explorer.pl :: ::- use_module('../engine/interpreter.P',[flat_sequence/2, action_/1, event_pred/1, abstract_numbers/2, user_prolog_clause/2]). T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysLate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysEarlyTricky.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseNoComplications.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerDefaults.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCuresRep.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/swish/lps_server_UI.pl.bak :: interpreter ::query_thread(LPS_ID, lps_server_UI ::provide_events_get_fluents_events_actions(InputEvents,Timeless,_Result), Cycle, Result), T:/opt/logicmoo_workspace/packs_sys/lps_corner.savHacked/lps_corner.savHacked/swish/lps_server_UI.pl :: interpreter ::query_thread(LPS_ID, lps_server_UI ::provide_events_get_fluents_events_actions(InputEvents,Timeless,_Result), Cycle, Result), T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/user_module_base.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/states_explorer.pl :: ::- use_module('../engine/interpreter.P',[flat_sequence/2, action_/1, event_pred/1, abstract_numbers/2, user_prolog_clause/2]). T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/redisclient.pl :: ::- multifile interpreter ::premature_system_action/1. % LPS engine hook T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysLate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysEarlyTricky.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseNoComplications.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerDefaults.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCuresRep.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/utils/explanator.pl ::action(X) ::- lps_program_module(M), catch(M ::action(X),_,fail). T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/swish/user_module_base.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/swish/lps_server_UI.pl :: interpreter ::query_thread(LPS_ID, lps_server_UI ::provide_events_get_fluents_events_actions(InputEvents,Timeless,_Result), Cycle, Result), T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/tictactoe.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/slamodel.pl ::% this is automatically achieved with condition-action rules T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/party_minimal.pl ::% the askMoney action is not firing because the timeless predicate parent's second solution is not being considered T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/oneprisoner.pl ::% There is some action better than A1 in the context of B1, B2, P and Q. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/goat.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/unserializedDice.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/two_initiate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/terminator.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/terminator.pl ::% Demo lps_terminate action, and Prolog system "output predicate" called as an action T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/switchingWithTimeExpression.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/sos.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/simulatedTimeCompositeEvent2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/simulatedTimeCompositeEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/simulatedTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/serializedDice.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/RockPaperScissors-3players.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/RockPaperScissors-3players.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/RockPaperScissors-3players-badFluent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/RockPaperScissors-3players-badFluent.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/realTimeObservations.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/real_time_constants.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/prospectiveGoat2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/paralellConjunctions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/neverEndingEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/negatedFluentShouldNotSucceed.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/negatedFluentShouldNotSucceed.pl ::then legal_action_against(lender) from T3. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/negatedFluentInConjunction.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/meta.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/intensFluentBindingTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/inLineTimeExpressions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/implicitTimeOrdering.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/if_then_else_with_writes.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/if_then_else_with_writes.pl :: % specified timewise, and the IF subgoal would NOT be assumed adjacent to the terminate action above T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/if_then_else.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/if_then.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/futuresContractFailing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/futuresContractCompliant.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/fluentInCompositeEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/fluentAfterEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/fluentAfterEvent.pl ::actions legal_action_against(_). T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/fariba_sam_bug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/failBetter.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/externalPrologEvents.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/externalPrologEvents.pl ::% no facts here please, otherwise they'll be taken as macro action clauses :: T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/external_stuff.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/editingActions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/compositeInitiateBug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/compositeEventsInPostConditions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/compositeEventInconsistency.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/compositeEventInconsistency.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/changingFluentInAntecedent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/BugEndingWithSimulatedRealTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bobObservationBug.pl_.P.lpst.bak :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bobObservationBug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bobObservationBug.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bankTransfer2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bankTransfer1.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bankDoubleTransfer.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bankDoubleTransfer.pl ::% following commented out :: all actions are serialised, producing cumulative effects IF using updates T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/bank_transferWithhappened.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/ballotTest.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/badlight2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/backtrackingAcrossCycles.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/forTesting/authoriseCard.pl ::?- go(Timeline,[more_actions]). T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/external_interfaces/myJavaHook.pl :: % interpreter ::option(cycle_hook(my_hook,Fluents,Actions)), % only one hook, but check name anyway T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/external_interfaces/myHook.pl :: go(YourProgram,[...,cycle_hook(my_hook,FluentTemplates,ActionTemplates),..]) T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/ethereumAntecedent.pl ::% Reactive rule antecedents cannot execute actions, they consume events. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/dining_philosophers_terse.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/use_insulin.pl ::% Events and actions take place between cycles, and fluents hold during cycles. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/turingTest.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_tricky_claim.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_normal_claim.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_noncompliant.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_irrelevant_events.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_foreclosing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_eternal.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_futures_failing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/SzaboLanguage_futures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/sos.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/sortWithTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/smartHomePrimitives.pl :: (actions = [ json([ (tag = 'ict.HueLight01.onoff'), T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/simulation/SimulationKit.pl ::% This postcondition must be used, rather than a simple update "anonymous action", for serializability, T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/simulation/cookingMachine.pl ::% "if true at T then ..." is a way to "observe" (e.g. request to perform) a composite event/action T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/simulateExternalEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/simulateExternalEvent.pl ::actions some_action. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissorsServer.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissorsServer-noProspectivePCs.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissorsEthereum.pl ::pay(Player,Prize) from T1 to T3 if % plan / macro action on the blockchain T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissorsBaseEN.pl ::the actions are :: T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissorsBase.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissors.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissors.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/RockPaperScissors-Minimal-en.pl ::the actions are :: T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/quicksort.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/prisoners.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/negatedEvents.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/negatedEvents-FS.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/loanAgreementPostConditionsRTbase.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/loanAgreementPostConditionsRT.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/loanAgreementPostConditionsRT.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/loanAgreementPostConditions.pl ::actions legal_action_against/1, terminate_correctly, cancel. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/loan_agreement.pl ::actions legal_action_against/1, potential_default_occurs/1, T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/goat.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/fireSimple.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/fireRecurrent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/diningPhilosophers.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/deliveryDelay.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/consolidatedLoan.pl ::fluents requested/3, advanced/2, legal_action_against/1, terminated. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/concurrentTowers.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/burning.pl ::fluents burning(_X,_Y). actions ignite(_X,_Y). T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/bubbleSort.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/bankTransfer.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/ballot.pl ::% by adding a ballot identifier as an extra parameter of all the events, fluents and actions. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/CLOUT_workshop/badlight.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/lps_corner.bitbucket.sav/examples/bank account_terse.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/xlisting/xlisting_web.pl :: [ action_menu_applied/3, T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/xlisting/xlisting_web.pfc.pl :: action_below=query, T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/xlisting/mpred_pldoc_util.pl :: ::- source_to_txt('../src_mud/actions/take.pl'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/logicmoo_lib.pl :: '--planner', % Load any planners T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/logicmoo/util_structs.pl ::datatype_to_init(actions,[]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/logicmoo/util_structs.pl :: problem_filename ::'/opt/PrologMUD/pack/logicmoo_base/prolog/logicmoo/planner/orig_pddl_parser/test/blocks/blocks-03-0.pddl', T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/logicmoo/predicate_inheritance.pl ::uses_predicate(_DEF,_,Module,Name,Arity,Action) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/logicmoo/filesystem.pl ::relative_from(D) ::- catch( (expand_file_search_path(library('ec_planner'),D)),_,fail),exists_directory(D). T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/INDEX.pl ::index((do_eof_actions), 2, file_scope, file_scope). T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/file_scope.pl.bak :: do_eof_actions/2, T:/opt/logicmoo_workspace/packs_sys/logicmoo_utils/prolog/file_scope.pl :: do_eof_actions/2, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/nomic_mu.pl ::% sudo -u prologmud_server gdb -x gdbinit -return-child-result -ex "set pagination off" -ex run -ex quit --args swipl -l run_mud_server.pl --all --world --repl --lisp --lispsock --sumo --planner --nonet --repl --noworld T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_percept.pl ::stripped_term(MAction,Action) ::- strip_module(MAction,_,Action),MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_lexicon.pl ::thetaRole(be, be_57, duration_of_tt, 1, subj_tt, action_tt, "", "", 0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_implies.pl ::% oper_db(_Self, Action, Preconds, Effects) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_examine.pl ::% action = try it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_eng2txt.pl :: action_doer(Context, Agent). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_eng2cmd_frame.pl :: by(Doer-men), with(MoreDoers, "and women"), own(Instr-"knife"), VrtuhValue, did(Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_edit.pl ::% do_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction,Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_abdemo_id.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_abdemo_id.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_abdemo.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv_abdemo.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav7/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_percept.pl ::stripped_term(MAction,Action) ::- strip_module(MAction,_,Action),MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_lexicon.pl ::thetaRole(be, be_57, duration_of_tt, 1, subj_tt, action_tt, "", "", 0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_implies.pl ::% oper_db(_Self, Action, Preconds, Effects) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_examine.pl ::% action = try it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_eng2txt.pl :: action_doer(Context, Agent). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_eng2cmd_frame.pl :: by(Doer-men), with(MoreDoers, "and women"), own(Instr-"knife"), VrtuhValue, did(Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_edit.pl ::% do_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction,Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_abdemo_id.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_abdemo_id.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_abdemo.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv_abdemo.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav6/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_percept.pl ::stripped_term(MAction,Action) ::- strip_module(MAction,_,Action),MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_lexicon.pl ::thetaRole(be, be_57, duration_of_tt, 1, subj_tt, action_tt, "", "", 0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_implies.pl ::% oper_db(_Self, Action, Preconds, Effects) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_examine.pl ::% action = try it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_eng2txt.pl :: action_doer(Context, Agent). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_eng2cmd_frame.pl :: by(Doer-men), with(MoreDoers, "and women"), own(Instr-"knife"), VrtuhValue, did(Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_edit.pl ::% do_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction,Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_abdemo_id.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_abdemo_id.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_abdemo.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv_abdemo.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav2/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_percept.pl ::stripped_term(MAction,Action) ::- strip_module(MAction,_,Action),MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_lexicon.pl ::thetaRole(be, be_57, duration_of_tt, 1, subj_tt, action_tt, "", "", 0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_implies.pl ::% oper_db(_Self, Action, Preconds, Effects) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_examine.pl ::% action = try it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_eng2txt.pl :: action_doer(Context, Agent). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_eng2cmd_frame.pl :: by(Doer-men), with(MoreDoers, "and women"), own(Instr-"knife"), VrtuhValue, did(Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_edit.pl ::% do_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction,Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_abdemo_id.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_abdemo_id.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_abdemo.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv_abdemo.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/marty_white.sav/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/parser_E2fC.pl :: ('prepReln-Action'/4), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/parser_CURT.pl ::type_action_info(human_player, curt80(list(term)), "Development test CURT Text for a human. Usage :: CURT80 Cant i see the blue backpack?"). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/parser_chat80_regress.pl :: ::-multifile(baseKB ::type_action_info/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/parser_chat80.pl ::==>type_action_info(tHumanControlled, actChat80(ftListFn(ftTerm)), "Development test CHAT-80 Text for a human. Usage :: CHAT80 Cant i see the blue backpack?"). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/parser_chart89.pl :: ::-multifile(baseKB ::type_action_info/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/nl_pipeline.pl :: ::- shared_parser_data(baseKB ::type_action_info/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/e2c/logicmoo_nl_sem_dcgRedress.pl :: (wordSemTrans ?WORD ?NUM RegularNounFrame (and (situationConstituents ::ACTION ::SUBJECT)(isa ::ACTION ?COL)) ?POS denotation True)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/e2c/logicmoo_cyc_nl_sem.pl ::%textCached('Lead-TheWord', [frame, 'Lead-TheWord', 'Verb', 'TransitiveNPFrame', and(isa(' ::ACTION', 'GuidingAMovingObject'), directingAgent(' ::ACTION', ' ::SUBJECT'), primaryObjectMoving(' ::ACTION', ' ::OBJECT')), verbSemTrans]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/e2c/e2c_verb_phrase.pl :: and(iza('ACTION', eventEmittingAnObject), objectEmitted('ACTION', 'OBLIQUE-OBJECT'), emitter('ACTION', 'SUBJECT')), 764838). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/e2c/e2c_parts_of_speech.pl ::type_wrd_sem((verb_like_want_to), [want, wants, wanted, wanted, wanting], [ type=verb_sem, sem=action( want_to)]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/logicmoo_nlu/e2c/e2c_fracas.pl :: a theory of action and causation, world knowledge, interaction between T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/config_nomicmu/plugins/example_area1.pl :: Action = goto_loc(Player, walk, pantry), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/config_nomicmu/plugins/adv_flp_api.pl ::% %% decide_action(Agent, Mem0, Mem1) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/prolog/config_nomicmu/example_bt/coronavirus_part_1.pl ::%%% Depending on the severity of the outbreak, public health officials may recommend community actions designed to help keep people healthy, reduce exposures to COVID-19, and slow the spread of the disease. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/trindikit4-0.1alpha/examples/godis-basic/TISdefs/is_def.pl :: Private = record( [ agenda :: stack(action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/trindikit4-0.1alpha/examples/godis-basic/resource_interfaces/domain.pl ::resource_relation( action, [Domain, A] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/trindikit4-0.1alpha/examples/godis-basic/modules/update_rules.pl ::% remove "findout" action when question has been answered T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/trindikit4-0.1alpha/examples/godis-basic/modules/selection_rules.pl ::rule_class( selectRespond, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/trindikit4-0.1alpha/examples/godis-basic/modules/select.pl ::selection_algorithm( [ if empty($/private/agenda) then (try select_action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/trindikit4-0.1alpha/examples/godis-basic/datatypes/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-iod/update_rules.pl ::rule_class( selectIcmUndIntAsk, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-iod/update.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-iod/selection_rules.pl ::rule_class( clarifyIssue, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-iod/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-iod/macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-iod/infostate.pl :: Private = record( [ agenda :: oqueue( action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-iod/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-grounding/update_rules.pl :: forall_do( in( $/private/agenda, A ) and not q_raising_action( A ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-grounding/selection_rules.pl ::rule_class( rejectIssue, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-grounding/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-grounding/infostate.pl :: Private = record( [ agenda :: oqueue( action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-grounding/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-basic/update_rules.pl ::% remove "findout" action when question has been answered T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-basic/selection_rules.pl ::rule_class( selectRespond, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-basic/select.pl ::selection_algorithm( [ if empty($/private/agenda) then (try select_action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-basic/infostate.pl :: Private = record( [ agenda :: stack(action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-basic/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/update_rules.pl ::- removed a hack rule for integrating requests for "up" and "top" actions T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/update.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/selection_rules.pl ::to current topmost action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/resource_interfaces.pl ::- Added a new predicate "hypernym" to the domain resource. In update-rules, revised integrateUsrRequest to allow intelligent interpretation of request htypernyms, i.e. requests that mean different things depending on the current topmost goal action. This required adding. Also, some changes were made to irrelevantFollowup and rejectAction to stop them from catching hypernym requests. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/infostate.pl :: actions :: stackset( action ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/godis_semantics.pl ::% Alt-question about actions, full answer; T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-aod/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/update-iod.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/update-aod.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/rule_libs/update_rules.pl ::load_rulelib( select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/rule_libs/selection_rules.pl ::rule_class( selectRespond, select_action ). % moved here fromefter clarifyAction 021120 SL T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/resource_interfaces.pl ::resource_relation( action, [Domain, A] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/infostate.pl :: actions :: stackset( action ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/godis-all/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/general/upnp_dev.pl ::resource_operation( dev_do, Dev, [ Action, set(PropList) ], Dev ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/general/lexicon_general_english.pl ::input_form( request(Action), Str ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/general/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/general/domain.pl ::resource_relation( action, [Domain, A] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis/general/device.pl ::resource_operation( dev_do, Dev, [ Action, set(PropList) ], Dev ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/VcrPhone/device_vcr.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/VcrPhone/device_phone.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/IMDiS/update_rulesT.pl :: [ push#rec( shared^actions, A ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/IMDiS/update_rules_text.pl :: [ push#rec( shared^actions, A ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/IMDiS/update_rules_dialogue.pl :: [ push#rec( shared^actions, A ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/IMDiS/update_rules.pl :: [ push#rec( shared^actions, A ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/IMDiS/infostate.pl :: actions :: stack( action ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/IMDiS/imdis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/OLD/lexicon_home_english.pl ::output_form( ask(X^(action(X))), "What do you want to do?" ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/OLD/domain_homeSL.pl :: findout([task(perform_specific_action), task(make_query), task(wake_up), task(leaving), task(main_menu) ]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/lexicon_home_englishNEW1218.pl ::output_form( task(perform_specific_action), "change the light in any of the rooms" ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/lexicon_home_english.pl ::output_form( ask(X^(action(X))), "What do you want to do?" ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/domain_homeNEW1218.pl :: if_then( device_type(D), inform(bad_action(D))) ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/domain_home011217.pl ::plan( perform_specific_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/domain_home.pl ::plan( perform_specific_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/device_telephone.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/Home/#domain_home.pl# ::plan( perform_specific_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/domain-tel/semsort_telephone.pl :: %actions T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/domain-tel/lexicon_telephone_english.pl ::output_form( ask(X^(action(X))), ['Please specify a function.'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/domain-tel/domain_telephone.pl ::%actions T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/ToUpgrade/domain-tel/device_telephone.pl :: action(Command,Vars), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-x10/x10-t4.pl :: push( /shared/actions, top ) ]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-x10/Resources/semsort_lamps.pl ::sem_sort( lamps_restart, action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-x10/Resources/domain_lamps.pl :: raise(X^action(X)), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-x10/Resources/device_lamps.pl :: action(Command,Vars), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-x10/godis-lamps-text.pl :: push( /shared/actions, top ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/Trash/device_vcr_fnuttar.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/start-vcr-text-t4.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/Resources/semsort_vcr.pl ::% action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/Resources/lexicon_vcr_english.pl ::output_form( ask(X^(action(X))), ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/Resources/lexicon_general_english.pl ::%output_form( action(Action), ['to '|Out] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/Resources/domain_vcr.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/Resources/device_vcr.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/godis-vcr-text.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/godis-vcr-nuance.pl :: push( /shared/actions, top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-vcr/godis-vcr-dme.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/start-tram-text-t4.pl :: actions :: stackset( action ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/semsort_vcr.pl ::% action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/semsort_tram.pl ::% action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/lexicon_vcr_english.pl ::output_form( ask(X^(action(X))), ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/lexicon_tram_english.pl ::output_form( ask(X^(action(X))), ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/lexicon_general_english.pl ::%output_form( action(Action), ['to '|Out] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/domain_vcr.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/domain_tram.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/Resources/device_vcr.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/modeprops.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/godis-vcr-text.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/godis-vcr-nuance.pl :: push( /shared/actions, top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tram/godis-vcr-dme.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/tvgodisnuance.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/tvgodis.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/stdtvgodis.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/semsort_telvcrlogin.pl ::% action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/semsort_telvcr.pl ::% action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/lexicon_telvcrlogin_english.pl ::output_form( ask(X^(action(X))), ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/lexicon_telvcr_english.pl ::output_form( ask(X^(action(X))), ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/domain_telvcrlogin.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/domain_telvcr.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/device_telvcrlogin.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-telvcr/device_telvcr.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tel/semsort_telephone.pl :: %actions T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tel/lexicon_telephone_english.pl ::output_form( ask(X^(action(X))), ['Please specify a function.'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tel/domain_telephone.pl ::%actions T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-tel/device_telephone.pl :: action(Command,Vars), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/Resources/semsort_player.pl ::%%% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/Resources/lexicon_player_english.pl ::output_form( action(top), ['top'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/Resources/domain_player.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/Resources/device_player.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/Resources/device_dbase.pl :: action(Command,Vars), %% Command = AddContact, Vars = [contactName,number] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player_unimodal.pl :: push( /shared/actions, top ) ]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/Resources/semsort_player.pl ::%%% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/Resources/lexicon_player_svenska.pl ::output_form( action(top), ['top'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/Resources/lexicon_player_english.pl ::output_form( action(top), ['top'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/Resources/domain_player.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/Resources/device_player.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/Resources/device_dbase.pl :: action(Command,Vars), %% Command = AddContact, Vars = [contactName,number] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/dme_agent.pl :: push( /shared/actions, top ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/player-old/all_agent.pl :: push( /shared/actions, top ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/generate_mm_simple.pl ::%%% ask(set([action(handle_player),action(handle_playlist),action(handle_stations)])) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/dme_agent.pl :: push( /shared/actions, top ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-player/all_agent.pl :: push( /shared/actions, top ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/semsort_medical.pl ::sem_sort( top, action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/lexicon_medical_english_V2.pl ::output_form( ask(X^(action(X))), ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/lexicon_medical_english.pl ::output_form( ask(X^(action(X))), ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/godis-medical-text.pl ::% push( /shared/actions, top ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/Experiments/domain_medical_TREE.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/Experiments/device_medicalSL.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/domain_medical_V2.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/domain_medical.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-medical/device_medical.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-legoturtle/semsort_legoturtle.pl ::% action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-legoturtle/lexicon_legoturtle_english.pl ::output_form( ask(X^(action(X) ) ), ['What shall I do?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-legoturtle/godis-legoturtle-nuance.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-legoturtle/godis-AOD-legoturtle.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-legoturtle/domain_legoturtle.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-legoturtle/device_legoturtle.pl ::% action( 'MOTOR_SET', [power, mode, index] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-icecream/Resources/domain_icecream.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-icecream/Resources/#domain_icecream.pl# :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-icecream/godis-icecream-text.pl :: push( /shared/actions, top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/start_agenda_t4.pl :: push( /shared/actions, top ) ]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Speech/agendatalk_nuance.pl :: push( /shared/actions, top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/semsort_agendatalk.pl ::% action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/olddevice.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/lexicon_general_svenska.pl ::%output_form( action(Action), ['to '|Out] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/lexicon_agenda_svenska.pl ::% reraise action explicitly (feedback on user reraise, or system-initiated) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/lexicon_agenda_spanish.pl ::% reraise action explicitly (feedback on user reraise, or system-initiated) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/lexicon_agenda_english.pl ::% reraise action explicitly (feedback on user reraise, or system-initiated) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/generate_spanish.pl ::output_form( ask(X^(action(X))), _, ['Como le puedo ayudar?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/generate_english.pl ::output_form( ask(X^(action(X))), _, ['What can I do for you?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/domain_agenda.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/device_agenda.pl :: Actions :: Add Event, Delete Event, Change Date, Change Time T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/Resources/database_agenda.pl :: description :: Converts actions/queries to SQL commands T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/agendatalk_text.pl :: push(/shared/actions, top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/domain-agendatalk/agendatalk_nuance.pl :: push( /shared/actions, top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/cellphone/semsort_cellphone.pl ::%%% Action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/cellphone/lexicon_cellphone_english.pl ::output_form( ask( X^(action(X)) ), ['What do you want to do?'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/cellphone/godis-cellphone-text.pl ::% push( /shared/actions, vcr_top ) ]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/cellphone/domain_cellphone.pl :: raise( X^action(X) ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/UGOT-D31/godis-apps/cellphone/device_cellphone.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/trindikit4/examples/godis-basic/TISdefs/is_def.pl :: Private = record( [ agenda :: stack(action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/trindikit4/examples/godis-basic/resource_interfaces/domain.pl ::resource_relation( action, [Domain, A] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/trindikit4/examples/godis-basic/modules/update_rules.pl ::% remove "findout" action when question has been answered T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/trindikit4/examples/godis-basic/modules/selection_rules.pl ::rule_class( selectRespond, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/trindikit4/examples/godis-basic/modules/select.pl ::selection_algorithm( [ if empty($/private/agenda) then (try select_action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/trindikit4/examples/godis-basic/datatypes/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-iod/update_rules.pl ::rule_class( selectIcmUndIntAsk, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-iod/update.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-iod/selection_rules.pl ::rule_class( clarifyIssue, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-iod/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-iod/macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-iod/infostate.pl :: Private = record( [ agenda :: oqueue( action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-iod/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-grounding/update_rules.pl :: forall_do( in( $/private/agenda, A ) and not q_raising_action( A ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-grounding/selection_rules.pl ::rule_class( rejectIssue, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-grounding/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-grounding/infostate.pl :: Private = record( [ agenda :: oqueue( action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-grounding/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-basic/update_rules.pl ::% remove "findout" action when question has been answered T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-basic/selection_rules.pl ::rule_class( selectRespond, select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-basic/select.pl ::selection_algorithm( [ if empty($/private/agenda) then (try select_action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-basic/infostate.pl :: Private = record( [ agenda :: stack(action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-basic/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/update_rules.pl ::- removed a hack rule for integrating requests for "up" and "top" actions T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/update.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/selection_rules.pl ::to current topmost action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/resource_interfaces.pl ::resource_relation( action, [Domain, A] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/infostate.pl :: actions :: stackset( action ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/godis_semantics.pl ::% Alt-question about actions, full answer; T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-aod/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/update-iod.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/update-aod.pl :: try select_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/select.pl :: if not ( in( $/private/agenda, A ) and q_raising_action( A ) ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/rule_libs/update_rules.pl ::load_rulelib( select_action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/rule_libs/selection_rules.pl ::rule_class( selectRespond, select_action ). % moved here fromefter clarifyAction 021120 SL T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/resource_interfaces.pl ::resource_relation( action, [Domain, A] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/infostate.pl :: actions :: stackset( action ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/godis_macros.pl ::macro_cond( q_raising_action(Move), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/godis-all/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/general/upnp_dev.pl ::resource_operation( dev_do, Dev, [ Action, set(PropList) ], Dev ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/general/lexicon_general_english.pl ::input_form( request(Action), Str ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/general/godis_datatypes.pl :: action T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/general/domain.pl ::resource_relation( action, [Domain, A] ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/godis/general/device.pl ::resource_operation( dev_do, Dev, [ Action, set(PropList) ], Dev ) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/djgodis/Resources/semsort_player.pl ::%%% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/djgodis/Resources/lexicon_player_english.pl ::output_form( action(top), ['top'] ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/djgodis/Resources/domain_player.pl :: plan( ?ActionOrIssue, ?Plan ) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/djgodis/Resources/device_player.pl ::%%% Actions (action(+Name,+Parameters)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/djgodis/Resources/device_dbase.pl :: action(Command,Vars), %% Command = AddContact, Vars = [contactName,number] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/djgodis/player_unimodal.pl :: push( /shared/actions, top ) ]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/delux/Resources/semsort_lamps.pl ::sem_sort( lamps_restart, action ). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/delux/Resources/domain_lamps.pl :: raise(X^action(X)), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/delux/Resources/device_lamps.pl :: action(Command,Vars), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/SIRIDUS/TALK_unimodal_grammar_lib/delux/lamps_unimodal.pl :: push( /shared/actions, top ) ]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/self_dialogue_corpus/get_data.py :: parser.add_argument("--exclude-topic", action='append', T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/RegulusLanguageServer/Prolog/test_client.pl ::client_message(revert, action(revert_discourse_context)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/RegulusLanguageServer/Prolog/server.pl :: handle_regulus_language_action_request(Request, Response), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/translate_acquire.pl :: [n_parses=1,source_representation=[[cause,aka_wain],[event,okoru],[postpos,causal],[symptom,zutsu],[tense,present],[utterance_type,sentence],[verb,koto_ga_aru]],source_discourse=[[utterance_type,sentence],[cause,aka_wain],[postpos,causal],[symptom,zutsu],[tense,present],[event,okoru],[tense,present],[verb,koto_ga_aru]],resolved_source_discourse=[[utterance_type,sentence],[cause,aka_wain],[postpos,causal],[symptom,zutsu],[tense,present],[event,okoru],[tense,present],[verb,koto_ga_aru]],resolution_processing=trivial,interlingua=[[sc,when],[clause,[[utterance_type,dcl],[pronoun,you],[tense,present],[voice,active],[action,drink],[cause,red_wine]]],[pronoun,you],[state,have_symptom],[symptom,headache],[tense,present],[voice,active],[utterance_type,ynq]],target_representation=[[clause,[[action,drink],[cause,red_wine],[pronoun,you],[tense,present],[utterance_type,dcl],[voice,active]]],[pronoun,you],[sc,when],[secondary_symptom,headache],[state,have_symptom],[tense,present],[utterance_type,ynq],[voice,active]],n_generations=1,other_translations=[]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/translate.pl :: [n_parses=1,parse_time=0.0,source_representation=[agent=[pronoun,i],null=[action,have],null=[modal,could],null=[politeness,please],null=[utterance_type,ynq],null=[voice,active],object=[drink,hot_chocolate]],transfer_to_source_discourse_time=0.0,source_discourse=[null=[utterance_type,ynq],null=[voice,active],null=[modal,could],agent=[pronoun,i],null=[action,have],object=[drink,hot_chocolate],null=[politeness,please]],resolved_source_discourse=[null=[utterance_type,ynq],null=[voice,active],null=[modal,could],agent=[pronoun,i],null=[action,have],object=[drink,hot_chocolate],null=[politeness,please]],resolution_processing=trivial,resolution_time=0.0,transfer_to_interlingua_time=0.0,interlingua=[arg2=[drink,hot_chocolate],null=[politeness,polite],null=[utterance_type,request]],interlingua_surface='POLITE ASK-FOR hot-chocolate',interlingua_checking_time=0.0,transfer_from_interlingua_time=0.0,target_representation=[_348818=[action,like],object=[drink,hot_chocolate],_348800=[modal,would],_348791=[pronoun,i],_348782=[utterance_type,dcl],_348809=[voice,active]],instantiated_target=[null=[action,like],object=[drink,hot_chocolate],null=[modal,would],agent=[pronoun,i],null=[utterance_type,dcl],null=[voice,active]],n_generations=2,generation_time=0.0,other_translations=[[i,would,like,a,hot,chocolate]],tagged_translations=[['*start*',i/np,would/v,like/v,[a,hot,chocolate]/np,'*end*'],['*start*',i/np,would/v,like/v,[a,hot,chocolate]/np,'*end*']]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/summarise_dialogue_server_logfile.pl ::summarise_dialogue_server_item(dialogue_event(TimeOut, received(Action)), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/regulus_generated_gsl_to_bnf.pl :: 'return( concat( ( ( utterance_type command ) ) concat( ( ( action dim ) ) $v_0 ) ) )')]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/recognition.pl :: restart_recognition_resources(_Action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/nl_tool_parse.pl ::{} T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/nbest.pl :: nl_value=[[utterance_type,command],[action,switch],[onoff,on],[device,light]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/help.pl :: member(abstract_action_and_out_state=[_Action, _State, Judgement], Items), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/dialogue_server_logs_to_corpus.pl :: Element = dialogue_event(_Timestamp, received(action(process_non_speech_input(Content)))), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/dialogue_server.pl :: Request :: action(xml_messages). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/dialogue.pl :: Record5 = [abstract_action_and_out_state=[AbstractAction, OutState] | Record6] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Prolog/check_dialogue_server_messages.pl ::client_action ::client_message/1, used to define well-formedness of messages sent from the client. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/toy1_app_multi_ling.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/toy1_app.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/output_manager_multi_ling.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/interlingua_to_fre.pl ::transfer_lexicon([action, switch_on], [action, allumer]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/interlingua_declarations.pl ::interlingua_constant([action, switch_on]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/input_manager_multi_ling.pl :: member([action, dim], LF), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/input_manager.pl :: member([action, dim], LF), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/eng_to_interlingua.pl ::transfer_rule([[action, switch], [prep, on]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/dialogue_manager_multi_ling.pl :: format('~N~nUnable to formulate abstract action.~n', []), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Specialised/Prolog/dialogue_manager.pl :: format('~N~nUnable to formulate abstract action.~n', []), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1RoleMarked/Regulus/recognition_lex_includes.pl ::include_lex(v ::[sem=[action, Value]], Tags) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1RoleMarked/Prolog/interlingua_to_fre.pl ::transfer_lexicon([action, switch_on], [action, allumer]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1RoleMarked/Prolog/interlingua_declarations.pl ::interlingua_constant([action, switch_on]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1RoleMarked/Prolog/eng_to_interlingua.pl ::transfer_rule([[action, switch], [prep, on]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1RoleMarked/Prolog/eng_to_fre.pl ::transfer_rule([[action, switch], [prep, on]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Course/Prolog/eng_to_fre.pl ::transfer_lexicon([action,list], [action,lister]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Alterf/Prolog/toy1_app.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Alterf/Prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Alterf/Prolog/input_manager.pl :: member([action, dim], LF), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Alterf/Prolog/dialogue_manager.pl :: format('~N~nUnable to formulate abstract action.~n', []), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1Alterf/Prolog/Alterf/patterns.pl ::alterf_pattern([action, switch], switch, 'switch on the light'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy_backend_socket_server.pl :: Request :: action(load_package(ConfigFile)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy_backend_slow_socket_server.pl :: ClientRequest = action(Request), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy1_app_with_socket_client.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy1_app_with_polling_socket_client.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy1_app_open_mic_self_contained.pl :: process_recognition_result(Result, Action, InState, OutState), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy1_app_open_mic.pl :: process_received_message(Message, Action, InState, OutState), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy1_app_corrections.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy1_app_asynchronous.pl :: process_received_message(Message, Action, InState, OutState), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/toy1_app.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/output_manager_corrections.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/interlingua_to_swe.pl ::transfer_lexicon([action, dim], [action, vrid_ner]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/interlingua_to_fre.pl ::transfer_lexicon([action, switch_on], [action, allumer]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/interlingua_declarations.pl ::interlingua_constant([action, switch_on]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/input_manager_ellipsis.pl :: member([action, dim], LF), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/input_manager_corrections.pl :: member([action, dim], LF), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/input_manager.pl :: member([action, dim], LF), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/eng_to_interlingua.pl ::transfer_rule([[action, switch], [onoff, on]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/eng_to_fre.pl ::transfer_rule([[action, switch], [onoff, on]], T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Prolog/dialogue_manager_ellipsis.pl :: format('~N~nUnable to formulate abstract action.~n', []), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/Generated/dialogue_judgements.pl ::judged_dialogue_processing([['(no words)'],[[utterance_type,command],[action,switch],[onoff,on],[device,fan]],[dev(light,kitchen,off,0),dev(light,living_room,off,0),dev(fan,kitchen,off,0)]],[[command,dev(fan,'$VAR'(0),on,100)]],im,good). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Toy1/corpora/dialogue_corpus1.pl ::sent('LF ::[[utterance_type,command],[action,switch],[onoff,on],[device,fan]]'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/SHRD2/Regulus/recognition_lex_includes.pl ::include_lex(v ::[sem=[action, Value]], Tags) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/SHRD2/Prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/GermanRobots/prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/GermanRobots/prolog/input_manager.pl :: get_action(LF, Action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/GermanRobots/prolog/dialogue_manager.pl ::%ACTIONS ---------------------------------------------------------------------- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Generic/Prolog/backend_server_client.pl ::send_request_to_backend_server(Action) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/EnglishRobots/prolog/robot_app_multi_ling.pl :: format('~N Abstract action :: ~w', [AbstractAction]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/EnglishRobots/prolog/output_manager_multi_ling.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/EnglishRobots/prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/EnglishRobots/prolog/input_manager.pl :: get_action(LF, Action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/EnglishRobots/prolog/dialogue_manager_multi_ling.pl ::%ACTIONS ---------------------------------------------------------------------- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/EnglishRobots/prolog/dialogue_manager.pl ::%ACTIONS ---------------------------------------------------------------------- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Doris/Regulus/recognition_lex_includes.pl ::include_lex(v ::[sem=[action, Value]], Tags) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Doris/Prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Calendar/Regulus/recognition_lex_includes.pl ::include_lex(v ::[sem=[action, Value]], Tags) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Calendar/Regulus/fre_recognition_lex_includes.pl ::include_lex(verb ::[sem=[action, Value]], Tags) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Calendar/Prolog/toy1_app_using_server.pl :: %send_request_to_server(action(execute_regulus_command("ECHO_ON")), _Response1), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Calendar/Prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Calendar/Prolog/japanese_output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Calendar/Prolog/japanese_calendar_nbest.pl :: member(action=tts(Response), Record). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Calendar/Prolog/calendar_nbest.pl :: member(action=tts(Response), Record). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Bridge/Prolog/output_manager.pl :: [abstract_action_to_action/2] T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/regulus/Examples/Bridge/Prolog/Bassinet/bassinet.pl :: ::- use_module('$REGULUS/PrologLib/utilities', [prettyprint/1]). play_hand(Hand) ::- format("O.K., changing this hand~n",[]), choose_hand(Hand). go(N) ::- deal(N, Hand), retractall(analysis(_, _)), play_hand(Hand, known(contract(3, notrumps, south), west, []), []). save_state(Hand, Known, Plan) ::- trace_lvl(P), P >= 2, number_of_actions(_,_,_,N), N > 0, !, name('save/trick',Name), name(N,N1), append(Name,N1,NName), name(File,NName), save_program(File, (spy(play_trick), play_hand(Hand, Known, Plan))). save_state(_, _, _). analyze_suit(Player, Contract, [card(Suit,_)|Cards], Suit, Learned) ::- !, next_play(Player, Player1), analyze_suit(Player1, Contract, Cards, Suit, Learned). analyze_suit(Player, contract(_,_,Dec), [card(_,_)|Cards], Suit, [Learnt|Learned]) ::- ( next_play(Player,Dec) ; next_play(Dec,Player) ), next_play(Player, Player1), Learnt =..[Suit, void, Player], not(clause(known(Learnt),_)), !, analyze_suit(Player1, contract(_,_,Dec), Cards, Suit, Learned). analyze_suit(Player, Contract, [_|Cards], Suit, Learned) ::- next_play(Player, Player1), analyze_suit(Player1, Contract, Cards, Suit, Learned). analyze_suit(_, _, _, _, []). find_new_plan(_, _, _, _) ::- retract_it(plan(_,_)), retract_it(other_plans(_)), retract_it(analysis(_,_)), update_actions. update_actions ::- retract(action(Action, 1, Suit, Player)), !, assert(action(Action, 2, Suit, Player)), update_actions. update_actions ::- retract(action(Action, -1, Suit, Player)), !, assert(action(Action, -2, Suit, Player)), update_actions. update_actions ::- !. update_actions(Suit) ::- retract(action(Action, 1, Suit, Player)), !, assert(action(Action, 2, Suit, Player)), update_actions(Suit). update_actions(Suit) ::- retract(action(Action, -1, Suit, Player)), !, assert(action(Action, -2, Suit, Player)), update_actions(Suit). update_actions(_) ::- !. /* The case that the hlp is still valid */ action_taken(WinSuit, Analysis, Tactic1, T1, Tactic2, T2) ::- plan((_,HLP),_), hi_lvl_tactic(HLP, WinSuit, HLT1), arg(1, HLT1, Tactic1), arg(3, HLT1, T1), get_tactic(Tactic1, Analysis, HLT2), !, functor(HLT2, Tactic2, _), get_potential(HLT2, T2). get_tactic(develop, Analysis, HLT1) ::- member(HLT1, Analysis), functor(HLT1, cash, _), !. % choose cash over finesse if they have the same potential get_tactic(Tactic1, Analysis, HLT1) ::- finesseable(Tactic1), member(HLT1, Analysis), functor(HLT1, cash, _), member(HLT2, Analysis), functor(HLT2, Tactic2, _), finesseable(Tactic2), HLT1 =.. [_|Pot], HLT2 =.. [_|Pot], !. % go from dbl1 to finnesse get_tactic(Tactic1, Analysis, HLT1) ::- finesseable(Tactic1), member(HLT1, Analysis), functor(HLT1, Tactic2, _), finesseable(Tactic2). get_tactic(Tactic, Analysis, HLT1) ::- member(HLT1, Analysis), functor(HLT1, Tactic, _), !. get_tactic(Tactic, Analysis, HLT1) ::- finesseable(Tactic), member(HLT1, Analysis), functor(HLT1, cash, _), !. get_potential(HLT, C/CD) ::- arg(1,HLT,C), arg(4,HLT,CD). /* Action result checks if something serendipitous has occurred action_result(+Action1, +WinSuit, +Potential1, +Action2, +Potential2, +WinningSide, -Update) */ % 1 action_result(Action1, WinSuit, T1, Action2, T2, Side, Delete, Update), action_result(cash, Suit, W1, _, W2/_, _, _) ::- number_of_actions(cash, 1, Suit, N), W2 + N > W1, !, format("Thank you !!!~n",[]), fail. % 2 action_result(cash, _, _, _, _, _, []) ::- !. % 3 action_result(develop, Suit, W1+W2-_, _, W3/(_-0), _, _) ::- number_of_actions(_, 1, Suit, N), N + W3 > W1 + W2, !, format("Thank you !!!~n",[]), fail. /* 4 go from develop to cash */ action_result(develop, Suit, W1+W2-W, _, W3/(_-0), _, [cash]) ::- number_of_actions(_, -1, Suit, W), number_of_actions(_, 1, Suit, N), W3 + N = ::= W1 + W2, !. %format("Thank you !!!~n",[]), fail. % 5 action_result(develop, _, _, _, _, _, []) ::- !. /* 6 go from finesse+develop to cash */ action_result(Fin, Suit, W1+W2-_, cash, W/(W-0), _, _) ::- finesseable(Fin), number_of_actions(_, 1, Suit, N), W1 + W2 = ::= W + N, !, format("Thank you !!!~n",[]), fail. /* 7 Win cheaply */ action_result(Fin, _, W, Fin, W/_, declarer, _) ::- finesseable(Fin), dev_name(Fin,_), format("Thank you!!!~n",[]), fail. /* 8 go from finesse to cash */ action_result(Fin, Suit, W1, cash, W/_, declarer, _) ::- finesseable(Fin), dev_name(Fin,_), number_of_actions(_, 1, Suit, N), W1 < W + N, !, format("Thank you!!!~n",[]), fail. /* 9 go from dbl1 to replan */ action_result(Fin1, _, _, cash, _, declarer, [cash]) ::- (Fin1 = dbl1_fin_dec; Fin1 = dbl1_fin_dum). %format("Thank you !!!~n",[]), fail. /* 10 go from finesse to cash */ action_result(Fin, Suit, W1, cash, W/_, declarer, [cash]) ::- ( Fin = sim_fin_dec ; Fin = sim_fin_dum ), number_of_actions(_, 1, Suit, N), last_action(1, Suit, _, Action), Action = cash, W1 = ::= W + N, !, format("Thank you !!!~n",[]). /* 11 go from finesse to cash */ action_result(Fin, Suit, W1, cash, W/_, declarer, [cash]) ::- ( Fin = sim_fin_dec ; Fin = sim_fin_dum ), number_of_actions(_, 1, Suit, N), W1 = ::= W + N. % 12 action_result(Fin, Suit, W1, cash, W/_, declarer, []) ::- ( Fin = sim_fin_dec ; Fin = sim_fin_dum), number_of_actions(_, 1, Suit, N), W1 > W + N, !, format("Current plan has failed~n",[]), fail. /* 13 repeat finesse */ action_result(Fin, Suit, W1, Fin, W/(W-0), _, []) ::- finesseable(Fin), dev_name(Fin,_), number_of_actions(_, 1, Suit, N), W1 = ::= W + N, !. /* 14 go from finesse + develop to develop */ action_result(Fin, Suit, W1+W2-L, cash, W3/(W4-L), declarer, []) ::- finesseable(Fin), dev_name(_,Fin), number_of_actions(_, 1, Suit, N), W1+W2 = ::= W3 + W4 + N, !. /* 15 go from dbl1 to new tactic */ action_result(Fin1, _, _, Tactic, W/(W-0), _, [Tactic]) ::- ( Fin1 = dbl1_fin_dec ; Fin1 = dbl1_fin_dum ; Fin1 = dbl2_fin_dec ; Fin1 = dbl2_fin_dum ). /* 16 go from finesse to replan */ action_result(Fin, _, _, cash, _, defender, _) ::- finesseable(Fin), !. %fail. last_action(Side, Suit, _, Action) ::- action(Action, Side, Suit, _), !. suits_played([card(Suit1,_),card(Suit2,_),card(Suit3,_),card(Suit4,_)], [Suit1,Suit2,Suit3,Suit4]). close_trick ::- format("Close Trick? ",[]), get0(_). play_trick(Hand, Played, Leader, Winners, Contract, Plan, [Card1, Card2, Card3, Card4], NHand, Played4, Plan1) ::- arg(3,Contract,Dec), ( Leader = Dec ; partner(Leader,Dec) ), order(Leader, Hand, [Player1,Hand1,Player2,Hand2,Player3,Hand3,Player4,Hand4]), ( var(Plan), evaluate_hand(Hand, Contract, Analysis), !, write_analysis(4, Analysis), strategy(Hand, Contract, Winners, Analysis, Leader, LeadSuit, Plans), hi_lvl_plans(Plans, Hi_lvl_plan), winners_losers(Hi_lvl_plan, Win, Lose), format("Hi Level Plan (Potential Winners/Losers = ~d/~d)~n",[Win,Lose]), write_plan(Hi_lvl_plan), arg(3,Contract,Dec), ( partner(Leader,Dec), !, decompose_and_splice(Hi_lvl_plan, Hand3, Hand1, Hand2, Hand4, Contract, Plan) ; decompose_and_splice(Hi_lvl_plan, Hand1, Hand3, Hand2, Hand4, Contract, Plan) ), format("Decomposed Plan after Splicing ::~n",[]), write_plan(Plan) ; true ), !, choose_tactic(Leader, Plan, Tactic, Plan1), functor(Tactic,TName,_), arg(2,Tactic,LeadSuit), retract_it(action(_,0,_,_)), asserta(action(TName, 0, LeadSuit,_)), get_suit(Hand1,LeadSuit,DecSuit1), get_suit(Hand2,LeadSuit,DefSuit1), get_suit(Hand3,LeadSuit,DecSuit2), get_suit(Hand4,LeadSuit,DefSuit2), merge(DefSuit1,DefSuit2,DefSuit), tactic_card(Tactic, Contract, Player1, [], DecSuit1, DecSuit2, DefSuit, Card1), print_out(Player1,Card1), replace(Hand1,Card1,Player1,Played,NHand1,Played1), defender_card(Hand2,Player2,LeadSuit,Contract,Card2), print_out(Player2,Card2), replace(Hand2,Card2,Player2,Played1,NHand2,Played2), ( tactic_card(Tactic, Contract, Player3, [Card2,Card1], DecSuit2, DecSuit1, DefSuit, Card3) ; defender_card(Hand3,Player3,LeadSuit,Contract,Card3) ), print_out(Player3,Card3), replace(Hand3,Card3,Player3,Played2,NHand3,Played3), defender_card(Hand4,Player4,LeadSuit,Contract,Card4), print_out(Player4,Card4), replace(Hand4,Card4,Player4,Played3,NHand4,Played4), close_trick, order(Leader, NHand, [Player1,NHand1,Player2,NHand2,Player3,NHand3,Player4,NHand4]), redraw([Card1, Card2, Card3, Card4], [Player1, NHand1, Player2, NHand2, Player3, NHand3, Player4, NHand4], Played1), redraw(NHand). play_trick(Hand, Played, Leader, Winners, Contract, Plan, [Card1, Card2, Card3, Card4], NHand, Played4, Plan1) ::- order(Leader, Hand, [Player1,Hand1,Player2,Hand2,Player3,Hand3,Player4,Hand4]), defender_card(Hand1,Player1,LeadSuit,Contract,Card1), print_out(Player1,Card1), replace(Hand1,Card1,Player1,Played,NHand1,Played1), ( var(Plan), evaluate_hand(Hand, Contract, Analysis), !, write_analysis(4, Analysis), strategy(Hand, Contract, Winners, Analysis, Leader, LeadSuit, Plans), hi_lvl_plans(Plans, Hi_lvl_plan), winners_losers(Hi_lvl_plan, Win, Lose), format("Hi Level Plan (Winners/Losers = ~d/~d)~n",[Win,Lose]), write_plan(Hi_lvl_plan), arg(3,Contract,Dec), ( next_play(Leader,Dec), !, decompose_and_splice(Hi_lvl_plan, Hand2, Hand4, Hand1, Hand3, Contract, Plan) ; decompose_and_splice(Hi_lvl_plan, Hand4, Hand2, Hand1, Hand3, Contract, Plan) ), format("Decomposed Plan after Splicing ::~n",[]), write_plan(Plan) ; true ), choose_tactic_suit(LeadSuit, Plan, Tactic, Plan1), functor(Tactic,TName,_), arg(2,Tactic,Suit), retract_it(action(_,0,_,_)), asserta(action(TName, 0, Suit,_)), get_suit(Hand1,LeadSuit,DefSuit1), get_suit(Hand2,LeadSuit,DecSuit1), get_suit(Hand3,LeadSuit,DefSuit2), get_suit(Hand4,LeadSuit,DecSuit2), merge(DefSuit1,DefSuit2,DefSuit), ( tactic_card(Tactic, Contract, Player2, [Card1], DecSuit1, DecSuit2, DefSuit, Card2) ; defender_card(Hand2,Player2,LeadSuit,Contract,Card2) ), print_out(Player2,Card2), replace(Hand2,Card2,Player2,Played1,NHand2,Played2), defender_card(Hand3,Player3,LeadSuit,Contract,Card3), print_out(Player3,Card3), replace(Hand3,Card3,Player3,Played2,NHand3,Played3), ( tactic_card(Tactic, Contract, Player4, [Card3,Card2,Card1], DecSuit2, DecSuit1, DefSuit, Card4) ; defender_card(Hand4,Player4,LeadSuit,Contract,Card4) ), print_out(Player4,Card4), replace(Hand4,Card4,Player4,Played3,NHand4,Played4), close_trick, redraw([Card1, Card2, Card3, Card4], [Player1, NHand1, Player2, NHand2, Player3, NHand3, Player4, NHand4], Played1), order(Leader, NHand, [Player1,NHand1,Player2,NHand2,Player3,NHand3,Player4,NHand4]), redraw(NHand). redraw([Card1|Cards],[Name,Hand|Hands],Played) ::- redraw(Card1,Hand,Name,Played,played), redraw(Cards,Hands,Played). redraw([],_,_). pick_suit([],LeadSuit,LeadSuit). pick_suit([],_,spades). pick_suit([],_,hearts). pick_suit([],_,diamonds). pick_suit([],_,clubs). pick_suit([C|_],_,SuitName) ::- name(Suit,[C]), atom(Suit), suit_initial(SuitName,Suit), !. pick_suit([_|Cs],LeadSuit,SuitName) ::- pick_suit(Cs,LeadSuit,SuitName). pick_card([],_) ::- !. pick_card([C|_],Value) ::- name(Card,[C]), value(Card,Value), !. pick_card([_|Cs],Value) ::- pick_card(Cs,Value). follow_suit(_,LeadSuit,_,LeadSuit) ::- !. follow_suit(Hand,_,_,LeadSuit) ::- not(belong(Hand,LeadSuit,_)), !. follow_suit(Hand,SuitName,_,LeadSuit) ::- SuitName \== LeadSuit, belong(Hand,LeadSuit,_), !, %format("You must follow suit~n",[]), fail. in_hand([suit(_,_,[])|Suits],Player,Suit1,Value) ::- var(Suit1), !, in_hand(Suits,Player,Suit1,Value). in_hand([suit(_,_,[])|Suits],Player,Suit1,Value) ::- var(Value), !, in_hand(Suits,Player,Suit1,Value). in_hand([suit(_,Suit,Cards)|_],_,Suit,Value) ::- var(Value), !, append(_,[Value],Cards). in_hand([suit(_,Suit,Cards)|_],_,Suit,Value) ::- member(Value,Cards),!. /* in_hand([suit(_,Suit,_)|_],Player,Suit,_) ::- format("That card does not exist in ~p's hand ~n",[Player]), !, fail. */ in_hand([_|Suits],Player,Suit,Value) ::- in_hand(Suits,Player,Suit,Value). belong([suit(_,Suit,[Card|Cards])|_],Suit,Value) ::- !, member(Value,[Card|Cards]). belong([_|Suits],Suit,Value) ::- belong(Suits,Suit,Value). find_winner(Player1,[Card1,Card2,Card3,Card4],Contract,WinSuit,Winner,Side) ::- next_play(Player1,Player2), winner(Player1,Card1,Player2,Card2,Contract, Winner2, WCard2), next_play(Player2,Player3), winner(Winner2,WCard2,Player3,Card3,Contract,Winner3,WCard3), next_play(Player3,Player4), winner(Winner3,WCard3,Player4,Card4,Contract,Winner,card(WinSuit,_)), arg(3,Contract,Dec), partnership(Winner,Dec,Side), curpos(48,16), format("~p won the trick ~n",Winner), curpos(1,24). partnership(Dec,Dec,declarer) ::- !. partnership(Winner,Dec,declarer) ::- partner(Winner, Dec), !. partnership(_,_,defender) ::- !. winner(P1,card(S1,V1),_, card(S1,V2),contract(_,S1,_),P1,card(S1,V1)) ::- V1 > V2,!. winner(_,card(S1,_),P2, card(S1,V2),contract(_,S1,_),P2,card(S1,V2)) ::- !. winner(P1,card(S1,V1),_, card(_,_),contract(_,S1,_),P1,card(S1,V1)) ::- !. winner(_,card(_,_),P2, card(S2,V2),contract(_,S2,_),P2,card(S2,V2)) ::- !. winner(P1,card(S1,V1),_, card(S1,V2),contract(_,_,_),P1,card(S1,V1)) ::- V1 > V2,!. winner(_,card(S1,_),P2, card(S1,V2),contract(_,_,_),P2,card(S1,V2)) ::- !. winner(P1,card(S1,V1),_, card(_,_),contract(_,_,_),P1,card(S1,V1)). replace(Hand,card(SuitName,Value),Player,Played,NewHand,Played1) ::- replace(Hand,card(SuitName,Value),NewHand), redraw(card(SuitName,Value),NewHand,Player,Played,playing), curpos(1,24), add(Played,card(SuitName,Value),Player,Played1). replace([suit(L,SuitName,Cards)|Rest],card(SuitName,Value), [suit(L1,SuitName,NewCards)|Rest]) ::- !, delete_card(card(SuitName,Value),Cards,NewCards), L1 is L-1. replace([Suit|Suits],Card,[Suit|Suits1]) ::- replace(Suits,Card,Suits1). add(hand(N,S,E,W),Card,north,hand(N1,S,E,W)) ::- add_card(N,Card,N1). add(hand(N,S,E,W),Card,south,hand(N,S1,E,W)) ::- add_card(S,Card,S1). add(hand(N,S,E,W),Card,east,hand(N,S,E1,W)) ::- add_card(E,Card,E1). add(hand(N,S,E,W),Card,west,hand(N,S,E,W1)) ::- add_card(W,Card,W1). add_card([suit(L,SuitName,Cards)|Rest],card(SuitName,Value), [suit(L1,SuitName,NewCards)|Rest]) ::- !, insert_card(Value,Cards,NewCards), L1 is L+1. add_card([Suit|Suits],Card,[Suit|Suits1]) ::- add_card(Suits,Card,Suits1). insert_card(Value,[],[Value]) ::- !. insert_card(Value,[X|Xs],[Value,X|Xs]) ::- Value >= X, !. insert_card(Value,[X|Xs],[X|Xs1]) ::- insert_card(Value,Xs,Xs1). delete_card(card(_,Card),[Card|Cards],Cards) ::- !. delete_card(card(_,Card),[Card1|Cards],[Card1|Cards1]) ::- delete_card(card(_,Card),Cards,Cards1). order(north,hand(N,S,E,W),[north,N,east,E,south,S,west,W]). order(south,hand(N,S,E,W),[south,S,west,W,north,N,east,E]). order(east,hand(N,S,E,W),[east,E,south,S,west,W,north,N]). order(west,hand(N,S,E,W),[west,W,north,N,east,E,south,S]). redraw(card(SuitName,Value),NewHand,Player,Played,Mode) ::- get_suit(NewHand,SuitName,Cards), get_hand(Played,Player,PlayedHand), get_suit(PlayedHand,SuitName,PlayedCards), redraw(Player,SuitName,Value,Cards,PlayedCards,Mode). cards_in_suit([],_,_,_). cards_in_suit([C|Cs],X,Y,Mode) ::- C > 28, !, C1 is C - 28, write_card_in_box(C1,underline,X,Y), X1 is X + 3, cards_in_suit(Cs,X1,Y,Mode). cards_in_suit([C|Cs],X,Y,playing) ::- C > 14, !, C1 is C - 14, write_card_in_box(C1,blink,X,Y), X1 is X + 3, cards_in_suit(Cs,X1,Y,_). cards_in_suit([C|Cs],X,Y,played) ::- C > 14, !, C1 is C - 14, write_card_in_box(C1,underline,X,Y), X1 is X + 3, cards_in_suit(Cs,X1,Y,_). cards_in_suit([C|Cs],X,Y,Mode) ::- write_card_in_box(C,normal,X,Y), X1 is X + 3, cards_in_suit(Cs,X1,Y,Mode). get_suit([suit(_,spades,Cards),_,_,_],spades,Cards) ::- !. get_suit([_,suit(_,hearts,Cards),_,_],hearts,Cards) ::- !. get_suit([_,_,suit(_,diamonds,Cards),_],diamonds,Cards) ::- !. get_suit([_,_,_,suit(_,clubs,Cards)],clubs,Cards) ::- !. get_suit([_,_,_,_],notrumps,[]). get_hand(hand(N,_,_,_),north,N). get_hand(hand(_,S,_,_),south,S). get_hand(hand(_,_,E,_),east,E). get_hand(hand(_,_,_,W),west,W). partner(Player,Player1) ::- next_play(Player,P), next_play(P,Player1). write_analysis(L, analysis(S,H,D,C)) ::- trace_lvl(T), ( T >= L, format("Spades :: ~p~nHearts :: ~p~nDiamonds :: ~p~nClubs :: ~p~n",[S,H,D,C]) ; true ). write_plans([]) ::- !. write_plans([Plan|Plans]) ::- write_plan(Plan), write_plans(Plans). write_plan([]) ::- !, format("~n",[]). write_plan([Plan|RPlan]) ::- format("~p ",[Plan]), write_plan(RPlan). retract_it(Head) ::- clause(Head,_), retract(Head), fail. retract_it(_Head). winners_losers([Tactic|Tactics],Winners,Losers) ::- arg(1,Tactic,Type), arg(3,Tactic,W), functor(Tactic1,Type,2), arg(2,Tactic1,W), ( (W = W1 + W2 - L, TW is W1 + W2, L1 = L) ; (TW = W, losers(Tactic1,L1)) ), winners_losers(Tactics,Winners1,Losers1), Winners is Winners1 + TW, Losers is Losers1 + L1. winners_losers([],0,0). % START DUPLICATED SECTION /* To evaluate hand, first evaluate each suit evaluate_hand(+Hand,+Contract,-Analysis). */ evaluate_hand(Hand, Contract, analysis(Spades, Hearts, Diamonds, Clubs)) ::- evaluate(spades, Hand, Contract, Spades), evaluate(hearts, Hand, Contract, Hearts), evaluate(diamonds, Hand, Contract, Diamonds), evaluate(clubs, Hand, Contract, Clubs). evaluate(Suit, _, _, analysis(Suit,Analysis)) ::- clause(analysis(Suit,Analysis),_), !. evaluate(Suit, Hand, Contract, Analysis) ::- evaluate_suit(Suit, Hand, Contract, Analysis, _, _), assert(analysis(Suit,Analysis)), !. %remove_2way_finesses(Analysis, LDec, LDum, SAnalysis). /* remove_2way_finesses(Analysis, LDec, LDum, SAnalysis) ::- member(sim_fin_dec(C,U,P,DC,DU,DP), Analysis), member(sim_fin_dum(C,U,P,DC,DU,DP), Analysis), ( LDec > LDum, delete(sim_fin_dum(C,U,P,DC,DU,DP), Analysis, SAnalysis); LDum > LDec, delete(sim_fin_dec(C,U,P,DC,DU,DP), Analysis, SAnalysis) ), !. remove_2way_finesses(Analysis, _, _, Analysis). */ evaluate_played_suits([],_,_,[]). evaluate_played_suits([Suit|Suits], Hand, Contract,[Tactic|Tactics]) ::- evaluate_suit(Suit, Hand, Contract, Tactic, _, _), evaluate_played_suits(Suits, Hand, Contract, Tactics). evaluate_suit(Suit, Hand, contract(_, Trumps, Declarer), Tactics, LDef, LDum) ::- partner(Declarer, Dummy), next_play(Declarer, Defender1), next_play(Dummy, Defender2), get_hand(Hand, Declarer, Dec), get_hand(Hand, Dummy, Dum), get_hand(Hand, Defender1, Def1), get_hand(Hand, Defender2, Def2), get_suit(Dec, Suit, DecCards), get_suit(Dum, Suit, DumCards), length(DecCards,LDef), length(DumCards, LDum), get_suit(Def1, Suit, Def1Cards), get_suit(Def2, Suit, Def2Cards), merge(Def1Cards, Def2Cards, DefCards), readln, top_winners(DecCards, DumCards, DefCards, CWinners, UWinners, PWinners), max_entries(DecCards, DumCards, DefCards, DumEntries), max_entries(DumCards,DecCards, DefCards, DecEntries), %format("Max. Entries Dec/Dum~d/~d~n",[DecEntries, DumEntries]), develop_tricks(DecCards, DumCards, DefCards, 1, CWinLose), develop_tricks(DecCards, DumCards, DefCards, 2, UWinLose), develop_tricks(DecCards, DumCards, DefCards, 3, PWinLose), cash_tactic(CWinLose,UWinLose,PWinLose,CDWinners-CL,UDWinners-UL,PDWinners-PL), finesse_winners(DecCards, DumCards, DefCards, Type1, CFWinners1, UFWinners1, PFWinners1, CDFWinners1, UDFWinners1, PDFWinners1), print_finesse_winners(dummy, Type1, CDWinners, UDWinners, PDWinners, CFWinners1, UFWinners1, PFWinners1, CDFWinners1, UDFWinners1, PDFWinners1, MCDFWinners1, MUDFWinners1, MPDFWinners1), add_tactic([cash(CWinners,UWinners,PWinners, CDWinners-CL,UDWinners-UL,PDWinners-PL), entries(DecEntries, DumEntries)], fin_dum(Type1, CFWinners1, UFWinners1, PFWinners1, MCDFWinners1, MUDFWinners1, MPDFWinners1),Tactic1), finesse_winners(DumCards, DecCards, DefCards, Type2, CFWinners2, UFWinners2, PFWinners2, CDFWinners2, UDFWinners2, PDFWinners2), print_finesse_winners(declarer,Type2, CDWinners, UDWinners, PDWinners, CFWinners2, UFWinners2, PFWinners2, CDFWinners2, UDFWinners2, PDFWinners2, MCDFWinners2, MUDFWinners2, MPDFWinners2), add_tactic(Tactic1, fin_dec(Type2, CFWinners2, UFWinners2, PFWinners2, MCDFWinners2, MUDFWinners2, MPDFWinners2), Tactic2), dfinesse_winners(DecCards, DumCards, DefCards, Certain_df1, Usual_df1, Possible_df1, Certain_df_dev1, Usual_df_dev1, Possible_df_dev1), print_dfinesse_winners(dummy, CDWinners, UDWinners, PDWinners, Certain_df1, Usual_df1, Possible_df1, Certain_df_dev1, Usual_df_dev1, Possible_df_dev1, Certaind_df_dev1, Usuald_df_dev1, Possibled_df_dev1), add_tactic(Tactic2, dbl2_fin_dum(Certain_df1, Usual_df1, Possible_df1, Certaind_df_dev1, Usuald_df_dev1, Possibled_df_dev1), Tactic3), dfinesse_winners(DumCards, DecCards, DefCards, Certain_df2, Usual_df2, Possible_df2, Certain_df_dev2, Usual_df_dev2, Possible_df_dev2), print_dfinesse_winners(declarer, CDWinners, UDWinners, PDWinners, Certain_df2, Usual_df2, Possible_df2, Certain_df_dev2, Usual_df_dev2, Possible_df_dev2, Certaind_df_dev2, Usuald_df_dev2, Possibled_df_dev2), add_tactic(Tactic3, dbl2_fin_dec(Certain_df2, Usual_df2, Possible_df2, Certaind_df_dev2, Usuald_df_dev2, Possibled_df_dev2), Tactics), get_suit(Dum, Trumps, DumTrumps), trump_winners(DecCards, DumCards, DefCards, DumTrumps, Suit, Trumps, Potential1, UTWinners1, PTWinners1), print_trump_winners(dummy, Potential1, UTWinners1, PTWinners1), get_suit(Dec, Trumps, DecTrumps), trump_winners(DumCards, DecCards, DefCards, DecTrumps, Suit, Trumps, Potential2, UTWinners2, PTWinners2), print_trump_winners(declarer, Potential2, UTWinners2, PTWinners2). cash_tactic(CWL, UWL, PWL, WL1, WL2, WL3) ::- win_lose(CWL,WL1), win_lose(UWL,WL2), win_lose(PWL,WL3). win_lose(Arg1, W, L) ::- win_lose(Arg1, W-L). win_lose([+,X|Rest],W-L) ::- win_lose(Rest,W1-L), W is W1 + X. win_lose([-,X|Rest],W-L) ::- member('+',Rest), win_lose(Rest,W-L1), L is L1 + X. win_lose([-,_|_], 0-0) ::- !. win_lose([], 0-0) ::- !. add_tactic(Tactic,dbl2_fin_dec(0,_,_,_,_,_), Tactic). add_tactic(Tactic,dbl2_fin_dum(0,_,_,_,_,_), Tactic). add_tactic(Tactic,fin_dec(_,0,_,_,_,_,_), Tactic) ::- !. add_tactic(Tactic,fin_dum(_,0,_,_,_,_,_), Tactic) ::- !. add_tactic(Tactic,fin_dec(0, C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), append(Tactic, [rev_fin_dec(C, U, P, CD-CL, UD-UL, PD-PL)],Tactic1). add_tactic(Tactic,fin_dum(0, C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), append(Tactic, [rev_fin_dum(C, U, P, CD-CL, UD-UL, PD-PL)],Tactic1). add_tactic(Tactic,fin_dec(1, C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), append(Tactic, [sim_fin_dec(C ,U ,P, CD-CL, UD-UL, PD-PL)],Tactic1). add_tactic(Tactic,fin_dum(1, C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), append(Tactic, [sim_fin_dum(C, U, P, CD-CL, UD-UL, PD-PL)],Tactic1). add_tactic(Tactic,fin_dec(2, C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), append(Tactic, [dbl1_fin_dec(C, U, P, CD-CL, UD-UL, PD-PL)],Tactic1). add_tactic(Tactic,fin_dum(2, C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), append(Tactic, [dbl1_fin_dum(C ,U, P, CD-CL, UD-UL, PD-PL)],Tactic1). add_tactic(Tactic,dbl2_fin_dec(C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), ( delete(dbl1_fin_dec(_,_,_,_,_,_), Tactic, NTactic) ; NTactic=Tactic ), append(NTactic, [dbl2_fin_dec(C, U, P, CD-CL, UD-UL, PD-PL)],Tactic1). add_tactic(Tactic,dbl2_fin_dum(C, U, P, CD, UD, PD), Tactic1) ::- find_losers(C,U,P,CD,UD,PD,CL,UL,PL), ( delete(dbl1_fin_dum(_,_,_,_,_,_), Tactic, NTactic) ; NTactic=Tactic ), append(NTactic, [dbl2_fin_dum(C, U, P, CD-CL, UD-UL, PD-PL)],Tactic1). find_losers(C,U,P,CD,UD,PD,CL,UL,PL) ::- (CD > C, CL = 1; CL = 0), (UD > U, UL = 1; UL = 0), (PD > P, PL = 1; PL = 0). print_trump_winners(_, 0, 0, 0) ::- !. print_trump_winners(_Player, _Potential, _UTWinners, _PTWinners) ::- !. print_finesse_winners(_, _, _, _, _, 0, 0, 0, _, _, _, 0, 0, 0) ::- !. print_finesse_winners(_, 0, CDWinners, UDWinners, PDWinners, _, _, _, CDFWinners,UDFWinners,PDFWinners,MCDFWinners,MUDFWinners,MPDFWinners) ::- max(CDFWinners, CDWinners, MCDFWinners), max(UDFWinners, UDWinners, MUDFWinners), max(PDFWinners, PDWinners, MPDFWinners). print_finesse_winners(_, 1, CDWinners, UDWinners, PDWinners, _, _, _, CDFWinners,UDFWinners,PDFWinners,MCDFWinners,MUDFWinners,MPDFWinners) ::- max(CDFWinners, CDWinners, MCDFWinners), max(UDFWinners, UDWinners, MUDFWinners), max(PDFWinners, PDWinners, MPDFWinners). print_finesse_winners(_, 2, CDWinners, UDWinners, PDWinners, _, _, _, CDFWinners,UDFWinners,PDFWinners,MCDFWinners,MUDFWinners,MPDFWinners) ::- Temp1 is CDWinners - 1, Temp2 is UDWinners - 1, Temp3 is PDWinners - 1, max(CDFWinners, Temp1, MCDFWinners), max(UDFWinners, Temp2, MUDFWinners), max(PDFWinners, Temp3, MPDFWinners). print_dfinesse_winners(_, _, _, _, 0, 0, 0, _, _, _,0, 0, 0) ::- !. print_dfinesse_winners(_, CDWinners, UDWinners, PDWinners, _, _, _, CDFWinners,UDFWinners,PDFWinners,MCDFWinners,MUDFWinners,MPDFWinners) ::- max(CDFWinners, CDWinners, MCDFWinners), max(UDFWinners, UDWinners, MUDFWinners), max(PDFWinners, PDWinners, MPDFWinners). /* Evaluates how many tricks can be made in a suit in a trump contract */ trump_winners(_, _, _, _, Suit, Suit, 0, 0, 0) ::- !. trump_winners(_, _, _, _, _, notrumps, 0, 0, 0) ::- !. trump_winners(DecCards, DumCards, DefCards, DumTrumps, _Suit, _Trumps, Potential, UTWinners, PTWinners) ::- length(DumCards, LDum), length(DecCards, LDec), LDec > LDum, highest(DefCards, Highest), tops(DecCards, Highest, Tops1), tops(DumCards, Highest, Tops2), Tops is Tops1 + Tops2, length(DumTrumps, TLength), TLength > 0, Small is LDec - Tops, Small > 0, length(DefCards, CDef), UDef is (CDef - 1)//2, PDef is CDef//2, PDef > LDum, !, Rounds1 is UDef - LDum, Delta is LDec - LDum, min(Delta, Small, SDelta), min(SDelta, TLength, Potential), min(Rounds1, Delta, URuffs), min(URuffs, Potential, UTWinners), Rounds2 is PDef - LDum, min(Rounds2, Delta, PRuffs), min(PRuffs, Potential, PTWinners). trump_winners(_, _, _, _, _, _, 0, 0, 0) ::- !. /* Calculates number of winners and developed tricks a finesse can generate finesse_winners(+DeclarerCards, +Dummy_Cards, +Defender_Cards, -Finesse_Type, -Certain_Finesse_Winners, -Usual_Finesse_Winners, -Pos_Finesse_Winners, -Certain_Developed_Finesse_Winners, -Usual_Developed_Finesse_Winners, -Pos_Developed_Finesse_Winners).*/ /* Evaluates simple i.e A,Q,x op. x,x and repeating finesse A,J,10, op. x,x */ finesse_winners(DecCards, DumCards, DefCards, Type, CFWinners, UFWinners, PFWinners, CDFWinners, UDFWinners, PDFWinners) ::- highest(DefCards, Highest), tops(DecCards, Highest, Tops1), tops(DumCards, Highest, Tops2), Tops2 > 0, length(DumCards, LDum), length(DecCards, LDec), highest_non_winners(DecCards, DumCards, DefCards, DefHigher, HnwDec, HnwDum, Type), reduce(HnwDec, HnwDec1), Hnw is HnwDum + HnwDec1, Hnw >= DefHigher, SmallDum is LDum - Tops2, SmallDec is LDec - Tops1, SmallDec >= DefHigher, SmallDum >= DefHigher, !, min(SmallDec, SmallDum, Small), DevWinners is Hnw + 1 - DefHigher, min(DevWinners, Small, FinWinners), Tops is Tops1 + Tops2 + FinWinners, evaluate_finesse(DefCards, LDec, LDum, Tops, Type, CFWinners, UFWinners, PFWinners, CDFWinners, UDFWinners, PDFWinners). /* Evaluates reverse finesse i.e A,x,x op. Q,x */ finesse_winners(DecCards, DumCards, DefCards, 0, CFWinners, UFWinners, PFWinners, CDFWinners, UDFWinners, PDFWinners) ::- highest(DefCards, Highest), tops(DecCards, Highest, Tops1), tops(DumCards, Highest, 0), length(DumCards, LDum), length(DecCards, LDec), highest_non_winners(DecCards, DumCards, DefCards, 1, HnwDec, HnwDum, _), SmallDum is LDum - HnwDum, SmallDum > 0, SmallDec is LDec - Tops1, SmallDec > HnwDec, min(HnwDum, SmallDec, DTops), DTops > 0, max(LDec, LDum, Length), Length > HnwDec + HnwDum, Tops is Tops1 + DTops, evaluate_finesse(DefCards, LDec, LDum, Tops, 2, CFWinners, UFWinners, PFWinners, CDFWinners, UDFWinners, PDFWinners). finesse_winners(_, _, _, _, 0, 0, 0, 0, 0, 0). /* Evaluates double finesse i.e A,K,10 op. x,x dfinesse_winners(+DeclarerCards, +Dummy_Cards, +Defender_Cards, -Certain_Finesse_Winners, -Usual_Finesse_Winners, -Pos_Finesse_Winners, -Certain_Developed_Finesse_Winners, -Usual_Developed_Finesse_Winners, -Pos_Developed_Finesse_Winners).*/ dfinesse_winners(DecCards, DumCards, DefCards, CFWinners, UFWinners, PFWinners, CDFWinners, UDFWinners, PDFWinners) ::- highest(DefCards, Highest), tops(DecCards, Highest, Tops1), tops(DumCards, Highest, Tops2), Tops2 >= 2, length(DumCards, LDum), length(DecCards, LDec), highest_non_winners(DecCards, DumCards, DefCards, 2, HnwDec, HnwDum, _), reduce(HnwDec, HnwDec1), Hnw is HnwDum + HnwDec1, SmallDum is LDum - Tops2, SmallDec is LDec - Tops1, SmallDec >= 2, SmallDum >= 1, !, SmallDec1 is SmallDec - 1, min(SmallDec1, SmallDum, Small), min(Hnw, Small, FinWinners), Tops is Tops1 + Tops2 + FinWinners, evaluate_finesse(DefCards, LDec, LDum, Tops, 1, CFWinners, UFWinners, PFWinners, CDFWinners, UDFWinners, PDFWinners). dfinesse_winners(_, _, _, 0, 0, 0, 0, 0, 0). /* Given the number of winners a finesse will generate, evaluate how many tricks can be won and developed in a suit with certain, usual, and possible probabilities evaluate_finesse(+DefCards, +LDec, +LDum, +Winners, +Type, -CFWinners,-UFWinners,-PFWinners,-CDFWinners,-UDFWinners,-PDFWinners) */ evaluate_finesse(DefCards, LDec, LDum, Tops, Type, CFWinners, UFWinners, PFWinners, CDFWinners, UDFWinners, PDFWinners) ::- length(DefCards, CDef), max(LDec, LDum, Length), min(Tops,Length,Tops1), winners(Tops1, CDef, Length, Type, CFWinners), UDef is (CDef)//2 + 1, winners(Tops1, UDef, Length, Type, UFWinners), PDef is (CDef + 1)//2, winners(Tops1, PDef, Length, Type, PFWinners), winners_with_finesse(Tops1, CDef, Length, Type, CDFWinners), winners_with_finesse(Tops1, UDef, Length, Type, UDFWinners), winners_with_finesse(Tops1, PDef, Length, Type, PDFWinners). /* Find the number of winners the finesse will win winners_with_finesse(+Tops, +Def_Length, +Dec_Length, +Type, -Winners). */ winners_with_finesse(Tops, Def, Length, 1, Length) ::- Tops >= Def, !. winners_with_finesse(Tops, Def, Length, _, Tops) ::- Length =< Def, !. winners_with_finesse(Tops, Def, Length, 1, Winners) ::- Winners is Tops + Length - Def. winners_with_finesse(Tops, Def, Length, 2, Length1) ::- Tops >= Def - 1, !, Length1 is Length - 1. winners_with_finesse(Tops, Def, Length, 2, Winners) ::- Winners is Tops + Length - Def, Winners < Length, !. winners_with_finesse(_, _, Length, 2, Length1) ::- Length1 is Length - 1. highest_non_winners(DecCards, DumCards, [H1,H2|_], 1, HnwDec, HnwDum, 1) ::- remove_winners(DecCards,H1, DecLow), remove_winners(DumCards,H1, DumLow), highest(DecLow, DumLow, Highest), Highest > H2, !, remove_losers(DecLow, H2, DecHnw), remove_losers(DumLow, H2, DumHnw), length(DecHnw, HnwDec), length(DumHnw, HnwDum). highest_non_winners(DecCards, DumCards, [H1,H2,H3|_], 2, HnwDec, HnwDum, 2) ::- remove_winners(DecCards, H1, DecLow), remove_winners(DumCards, H1, DumLow), highest(DecLow, DumLow, Highest), Highest < H2, Highest > H3, remove_losers(DecLow, H3, DecHnw), remove_losers(DumLow, H3, DumHnw), length(DecHnw, HnwDec), length(DumHnw, HnwDum). remove_winners([],_,[]) ::- !. remove_winners([C|Cs],H,[C|Cs]) ::- C < H, !. remove_winners([_|Cs],H, Low) ::- remove_winners(Cs, H, Low). remove_losers([],_,[]) ::- !. remove_losers([C|_],H, []) ::- C < H, !. remove_losers([C|Cs],H,[C|Hnw]) ::- remove_losers(Cs, H, Hnw). reduce(N, N1) ::- N > 0, !, N1 is N - 1. reduce(N, N). highest([],0) ::- !. highest([High|_], High) ::- !. highest([],[],0) ::- !. highest([],[C|_],C) ::- !. highest([C|_],[],C) ::- !. highest([C1|_],[C2|_],C1) ::- C1 > C2, !. highest([_|_],[C2|_],C2). tops([C|Cards],[D|_],Tops) ::- !, tops([C|Cards],D,Tops). tops([C|Cards], Highest, Tops) ::- C > Highest, !, tops(Cards, Highest, Tops1), Tops is Tops1 + 1. tops(_, _, 0). top_winners(DecCards, DumCards, DefCards, CWinners, UWinners, PWinners) ::- highest(DefCards,Highest), tops(DecCards, Highest, Tops1), tops(DumCards, Highest, Tops2), Tops is Tops1 + Tops2, length(DecCards, LDec), length(DumCards, LDum), max(LDec, LDum, Length), min(Tops,Length,Min), length(DefCards, CDef), winners(Min, CDef, Length, CWinners), UDef is (CDef)//2 + 1, winners(Min, UDef, Length, UWinners), PDef is (CDef + 1)//2, winners(Min, PDef, Length, PWinners). winners(Tops, LDef, Length, Length) ::- Tops >= LDef, !. winners(Tops, _, _, Tops). winners(Tops, LDef, Length, 1, Length1) ::- winners(Tops, LDef, Length, Length1). winners(Tops, LDef, Length, 2, Length1) ::- Tops >= LDef - 1, !, Length1 is Length - 1. winners(Tops, _, _, 2, Tops). /* Find number of entries max_entries(+Cards1, +Cards2, +DefCards, -Entries) */ max_entries(DecCards, DumCards, DefCards, DumEntries) ::- highest(DefCards, Highest), small_entries(DecCards, DumCards, Highest, RDecCards, RDumCards, SmallDumEntries), high_entries(RDecCards, RDumCards, Highest, BigDumEntries), DumEntries is SmallDumEntries + BigDumEntries. high_entries([DecCard|DecCards], [DumCard|DumCards], Highest, Entries) ::- DecCard > Highest, DecCard < DumCard, !, high_entries(DecCards, DumCards, Highest, Entries1), Entries is Entries1 + 1. high_entries(_, _, _, 0). small_entries([DecCard|DecCards], [DumCard|DumCards], Highest, ODec, ODum, Entries) ::- DumCard > Highest, delete_lowest_high([DumCard|DumCards], Highest, RDum), delete_lowest([DecCard|DecCards], RDec), !, small_entries(RDec, RDum, Highest, ODec, ODum, Entries1), Entries is Entries1 + 1. small_entries(Dec, Dum, _, Dec, Dum, 0). delete_lowest_high([C1,C2|Cs], Highest, [C2|Cs]) ::- C1 > Highest, C2 < Highest, !. delete_lowest_high([C1,C2|Cs], Highest,[C1|Result]) ::- C2 > Highest, !, delete_lowest_high([C2|Cs], Highest, Result). delete_lowest_high([_], _, []) ::- !. delete_lowest_and_high(1, DefCards, [Highest|_], DefCards1) ::- !, delete_lowest_high(DefCards, Highest, DefCards1). delete_lowest_and_high(2, [C1,C2], [Highest|_], [C1]) ::- C2 > Highest, !. delete_lowest_and_high(2, [_,C2], [_|_], [C2]) ::- !. delete_lowest_and_high(_, DefCards, [Highest|_], DefCards1) ::- delete_lowest_high(DefCards, Highest, DefCards2), delete_lowest(DefCards2, DefCards1). delete_Nlowest(1,L1,L2) ::- !, delete_lowest(L1, L2). delete_Nlowest(2,[X,_],[X]) ::- !. delete_Nlowest(_,L1,L2) ::- !, delete_2lowest(L1, L2). delete_highest([_|Cs],Cs). delete_lowest(List,List1) ::- append(List1,[_],List), !. delete_lowest(_,[]) ::- !. delete_2lowest(List,List1) ::- append(List1,[_,_],List), !. delete_2lowest(_,[]) ::- !. /* Find number of tricks that can be won through developent, i.e. cashing winners, and using heuristics such as playing highest non winners, etc. develop_tricks(+DecCards, +DumCards, +DefCards, +Probability, Winners) */ /* Use accumulator */ develop_tricks(DecCards, DumCards, DefCards, Num, Winners) ::- developed_winners(DecCards, DumCards, DefCards, Num, [], Winners). developed_winners([], [], _, _, Winners, Winners) ::- !. developed_winners(DecCards, DumCards, [], _, Winners, TWinners) ::- length(DecCards, LDec), length(DumCards, LDum), LDec >= LDum, !, append(Winners,[+,LDec],TWinners). developed_winners(_, DumCards, [], _, Winners, TWinners) ::- !, length(DumCards, LDum), append(Winners,[+,LDum],TWinners). /* If both hands have winners, Cash winner in longest hand */ developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- tops(DecCards, DefCards, Tops1), tops(DumCards, DefCards, Tops2), Tops2 > 0, Tops1 > 0, length(DecCards, LDec), length(DumCards, LDum), LDec >= LDum, !, delete_lowest(DecCards, DecCards1), delete_highest(DumCards, DumCards1), delete_Nlowest(Num, DefCards, DefCards1), append(Winners,[+,1],Winners1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- tops(DecCards, DefCards, Tops1), tops(DumCards, DefCards, Tops2), Tops2 > 0, Tops1 > 0, !, delete_highest(DecCards, DecCards1), delete_lowest(DumCards, DumCards1), append(Winners,[+,1],Winners1), delete_Nlowest(Num, DefCards, DefCards1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). /* If one hand has winners, cash it */ developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- tops(DecCards, DefCards, Tops1), Tops1 > 0, !, delete_highest(DecCards, DecCards1), delete_lowest(DumCards, DumCards1), delete_Nlowest(Num, DefCards, DefCards1), append(Winners,[+,1],Winners1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- tops(DumCards, DefCards, Tops2), Tops2 > 0, !, delete_lowest(DecCards, DecCards1), delete_highest(DumCards, DumCards1), delete_Nlowest(Num, DefCards, DefCards1), append(Winners,[+,1],Winners1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). /* If no hand has a winner, and only one hand has highest non winner - play it*/ developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- number_higher(DecCards, DefCards, Higher_Dec), number_higher(DumCards, DefCards, Higher_Dum), Higher_Dec < Higher_Dum, !, delete_highest(DecCards, DecCards1), delete_lowest(DumCards, DumCards1), delete_lowest_and_high(Num, DefCards, DecCards, DefCards1), append(Winners,[-,1],Winners1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- number_higher(DecCards, DefCards, Higher_Dec), number_higher(DumCards, DefCards, Higher_Dum), Higher_Dec > Higher_Dum, !, delete_lowest(DecCards, DecCards1), delete_highest(DumCards, DumCards1), delete_lowest_and_high(Num, DefCards, DumCards, DefCards1), append(Winners,[-,1],Winners1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). /* If no hand has a winner, and both have highest non winner play the highest non winner from the shorter hand */ developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- length(DecCards, LDec), length(DumCards, LDum), LDec >= LDum, !, delete_lowest(DecCards, DecCards1), delete_highest(DumCards, DumCards1), delete_lowest_and_high(Num, DefCards, DumCards, DefCards1), append(Winners,[-,1],Winners1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). developed_winners(DecCards, DumCards, DefCards, Num, Winners, TWinners) ::- !, delete_highest(DecCards, DecCards1), delete_lowest(DumCards, DumCards1), delete_lowest_and_high(Num, DefCards, DecCards, DefCards1), append(Winners,[-,1],Winners1), developed_winners(DecCards1, DumCards1, DefCards1, Num, Winners1, TWinners). number_higher([], _, 13) ::- !. number_higher([C|_], [D|DefCards], Higher) ::- C < D, !, number_higher([C|_], DefCards, Higher1), Higher is Higher1 + 1. number_higher(_, _, 0). % END DUPLICATED SECTION % ================================================================== % draw.pl % % A file for nice output of hands, etc. % % Author - Yossi Nygate . % Last Modified - October 28, 1988. % ================================================================== /* Predicates list :: predicate name number of arguments -------------- ------------------- write_deal 1 write_full_hand 2 write_titled_suits 3 cards_in_box 3 write_card_in_box 4 initial_string 2 card_to_string 3 */ write_deal(hand(N,S,E,W)) ::- format(" West North ",[]), format(" East South~n",[]), write_full_hand(W,N,E,S). write_full_hand([],[],[],[]). write_full_hand([suit(WL,Suit,WCards)|WSuits], [suit(NL,_,NCards)|NSuits], [suit(EL,_,ECards)|ESuits], [suit(SL,_,SCards)|SSuits]) ::- suit_initial(Suit,I), format("~p :: ",[I]), write_suit(WCards), fillin(WL), format("~p :: ",[I]), write_suit(NCards), fillin(NL), format("~p :: ",[I]), write_suit(ECards), fillin(EL), format("~p :: ",[I]), write_suit(SCards), fillin(SL), format("~n",[]), write_full_hand(WSuits, NSuits, ESuits, SSuits). fillin(L) ::- Spaces is 17 - L*2, tab(Spaces). tab(I) ::- I =< 0, !. tab(I) ::- I > 0, format(" ", []), I1 is I - 1, !, tab(I1). write_suit([]). write_suit([C|Cs]) ::- format("~p ",[C]), write_suit(Cs). find_contract(contract(Level,SuitName,Declarer),Lead) ::- format("What is the contract? ",[]), read_line(Line), [C1, C2 | _ ] = Line, name(Level,[C1]), name(Suit,[C2]), suit_initial(SuitName,Suit), !, format("Who is declarer? ",[]), read_line([C3|_]), name(Dec,[C3]), player_initial(Declarer,Dec), format("Contract :: ~d ~p by ~p, ",[Level,SuitName,Declarer]), next_play(Declarer,Lead), format("~p on lead.~n",[Lead]). update_winners(winners(Dec,Def),Player,contract(_,_,Player), winners(Dec1,Def)) ::- !, Dec1 is Dec + 1, format("Tricks - Declarer ~d, Defender ~d~n",[Dec1, Def]). update_winners(winners(Dec,Def),Player1,contract(_,_,Player), winners(Dec1,Def)) ::- partner(Player,Player1), !, Dec1 is Dec + 1, format("Tricks - Declarer ~d, Defender ~d~n",[Dec1, Def]). update_winners(winners(Dec,Def),_,_,winners(Dec,Def1)) ::- !, Def1 is Def + 1, format("Tricks - Declarer ~d, Defender ~d~n",[Dec, Def1]). redraw(_,_,_,_,_,_). readln. curpos(_,_). co_ordinates(_,_,_,_,_). update_x(_,_). update_y(_,_,_). cards_in_box(_,_,_,_). print_out(Player,card(Suit,Value)) ::- format("~p - Playing the ~p of ~p~n",[Player,Value,Suit]). redraw(Deal) ::- write_deal(Deal). deal(1, hand([suit(1,spades,[2]),suit(3,hearts,[9,7,3]), suit(5,diamonds,[14,13,8,3,2]),suit(4,clubs,[14,12,9,5])], [suit(5,spades,[14,12,11,10,3]),suit(5,hearts,[14,13,12,8,5]), suit(2,diamonds,[6,5]),suit(1,clubs,[10])], [suit(4,spades,[13,7,6,5]),suit(2,hearts,[10,4]), suit(2,diamonds,[9,7]),suit(5,clubs,[8,7,6,3,2])], [suit(3,spades,[9,8,4]),suit(3,hearts,[11,6,2]), suit(4,diamonds,[12,11,10,4]),suit(3,clubs,[13,11,4])]) ). deal('1a', hand([suit(1,spades,[2]),suit(3,hearts,[9,7,3]), suit(5,diamonds,[14,13,8,3,2]),suit(4,clubs,[14,9,5,2])], [suit(5,spades,[14,13,12,11,10]),suit(5,hearts,[14,13,12,11,10]), suit(2,diamonds,[6,5]),suit(1,clubs,[10])], [suit(4,spades,[7,6,5,3]),suit(2,hearts,[8,4]), suit(2,diamonds,[9,7]),suit(5,clubs,[12,8,7,6,3])], [suit(3,spades,[9,8,4]),suit(3,hearts,[6,5,2]), suit(4,diamonds,[12,11,10,4]),suit(3,clubs,[13,11,4])]) ). deal(2, hand([suit(2,spades,[4,3]),suit(4,hearts,[9,7,4,3]), suit(3,diamonds,[14,12,5]),suit(4,clubs,[13,10,8,7])], [suit(3,spades,[14,13,6]),suit(3,hearts,[14,10,8]), suit(3,diamonds,[13,9,3]),suit(4,clubs,[12,11,9,6])], [suit(4,spades,[12,7,5,2]),suit(4,hearts,[13,11,5,2]), suit(3,diamonds,[10,8,2]),suit(2,clubs,[5,3])], [suit(4,spades,[11,10,9,8]),suit(2,hearts,[12,6]), suit(4,diamonds,[11,7,6,4]),suit(3,clubs,[14,4,2])]) ). deal(3, hand([suit(2,spades,[3,2]),suit(3,hearts,[13,12,2]), suit(5,diamonds,[14,5,4,3,2]),suit(3,clubs,[4,3,2])], [suit(3,spades,[14,13,4]),suit(3,hearts,[11,10,3]), suit(3,diamonds,[8,7,6]),suit(4,clubs,[14,13,6,5])], [suit(4,spades,[12,11,10,9]),suit(3,hearts,[6,5,4]), suit(3,diamonds,[11,9,8]),suit(4,clubs,[9,8,7])], [suit(4,spades,[8,7,6,5]),suit(4,hearts,[14,9,8,7]), suit(2,diamonds,[13,12]),suit(3,clubs,[12,11,10])]) ). b0 ::- play_hand(hand( [suit(1,spades,[12]),suit(1,hearts,[3]), suit(1,diamonds,[14]),suit(0,clubs,[])], [suit(1,spades,[3]),suit(2,hearts,[14,11]), suit(0,diamonds,[]),suit(0,clubs,[])], [suit(1,spades,[14]),suit(2,hearts,[13,12]), suit(0,diamonds,[]),suit(0,clubs,[])], [suit(1,spades,[2]),suit(1,hearts,[5]), suit(1,diamonds,[5]),suit(0,clubs,[])])). b1 ::- play_hand(hand([suit(1,spades,[2]),suit(3,hearts,[9,7,3]), suit(5,diamonds,[14,13,8,3,2]),suit(4,clubs,[14,12,9,5])], [suit(5,spades,[14,12,11,10,3]),suit(5,hearts,[14,13,12,8,5]), suit(2,diamonds,[6,5]),suit(1,clubs,[10])], [suit(4,spades,[13,7,6,5]),suit(2,hearts,[10,4]), suit(2,diamonds,[9,7]),suit(5,clubs,[8,7,6,3,2])], [suit(3,spades,[9,8,4]),suit(3,hearts,[11,6,2]), suit(4,diamonds,[12,11,10,4]),suit(3,clubs,[13,11,4])])). b2 ::- play_hand(hand( [suit(4,spades,[12,10,8,4]),suit(2,hearts,[11,3]), suit(3,diamonds,[14,12,10]),suit(4,clubs,[14,10,8,7])], [suit(4,spades,[11,9,7,3]),suit(3,hearts,[14,10,4]), suit(2,diamonds,[11,8]),suit(4,clubs,[6,5,4,2])], [suit(2,spades,[14,5]),suit(2,hearts,[13,12]), suit(6,diamonds,[13,9,7,6,3,2]),suit(3,clubs,[11,9,3])], [suit(3,spades,[13,6,2]),suit(6,hearts,[9,8,7,6,5,2]), suit(2,diamonds,[5,4]),suit(2,clubs,[13,12])])). b3 ::- play_hand(hand( [suit(1,spades,[2]),suit(3,hearts,[9,7,3]), suit(5,diamonds,[14,13,8,3,2]),suit(4,clubs,[14,10,9,5])], [suit(5,spades,[14,13,12,11,10]),suit(5,hearts,[14,13,8,5,2]), suit(2,diamonds,[6,5]),suit(1,clubs,[12])], [suit(4,spades,[7,6,5,3]),suit(2,hearts,[10,4]), suit(2,diamonds,[9,7]),suit(5,clubs,[8,7,6,3,2])], [suit(3,spades,[9,8,4]),suit(3,hearts,[12,11,6]), suit(4,diamonds,[12,11,10,4]),suit(3,clubs,[13,11,4])])). b4 ::- play_hand(hand( [suit(4,spades,[13,9,6,3]),suit(2,hearts,[14,10]), suit(2,diamonds,[14,5]),suit(5,clubs,[14,6,5,3,2])], [suit(7,spades,[14,12,8,7,5,4,2]),suit(2,hearts,[9,5]), suit(1,diamonds,[11]),suit(3,clubs,[10,8,4])], [suit(1,spades,[10]),suit(6,hearts,[13,11,7,6,4,2]), suit(6,diamonds,[13,12,9,7,6,3]),suit(0,clubs,[])], [suit(1,spades,[11]),suit(3,hearts,[12,8,3]), suit(4,diamonds,[10,8,4,2]),suit(5,clubs,[13,12,11,9,7])])). b5 ::- play_hand(hand( [suit(1,spades,[2]),suit(3,hearts,[9,7,3]), suit(5,diamonds,[14,13,8,3,2]),suit(4,clubs,[14,12,9,5])], [suit(5,spades,[14,12,11,10,3]),suit(5,hearts,[14,13,8,5,2]), suit(2,diamonds,[6,5]),suit(1,clubs,[10])], [suit(4,spades,[13,7,6,5]),suit(2,hearts,[10,4]), suit(2,diamonds,[9,7]),suit(5,clubs,[8,7,6,3,2])], [suit(3,spades,[9,8,4]),suit(3,hearts,[12,11,6]), suit(4,diamonds,[12,11,10,4]),suit(3,clubs,[13,11,4])])). b6 ::- play_hand(hand( [suit(3,spades,[8,7,6]),suit(2,hearts,[8,7]), suit(4,diamonds,[14,13,8,7]),suit(4,clubs,[14,12,7,6])], [suit(4,spades,[14,13,12,2]),suit(5,hearts,[14,13,12,11,9]), suit(2,diamonds,[3,2]),suit(2,clubs,[13,2])], [suit(3,spades,[11,10,9]),suit(3,hearts,[6,5,2]), suit(3,diamonds,[6,5,4]),suit(4,clubs,[11,10,9,8])], [suit(3,spades,[5,4,3]),suit(3,hearts,[10,4,3]), suit(4,diamonds,[12,11,10,9]),suit(3,clubs,[5,4,3])])). b7 ::- play_hand(hand( [suit(1,spades,[2]),suit(3,hearts,[9,7,3]), suit(5,diamonds,[14,13,8,3,2]),suit(4,clubs,[14,11,9,5])], [suit(5,spades,[14,13,12,11,10]),suit(5,hearts,[14,13,8,5,2]), suit(2,diamonds,[6,5]),suit(1,clubs,[12])], [suit(4,spades,[7,6,5,3]),suit(2,hearts,[10,4]), suit(2,diamonds,[9,7]),suit(5,clubs,[8,7,6,3,2])], [suit(3,spades,[9,8,4]),suit(3,hearts,[12,11,6]), suit(4,diamonds,[12,11,10,4]),suit(3,clubs,[13,10,4])])). b8 ::- play_hand(hand( [suit(2,spades,[13,11]),suit(3,hearts,[10,9,3]), suit(4,diamonds,[14,12,11,3]),suit(4,clubs,[14,13,11,10])], [suit(4,spades,[14,10,9,2]),suit(4,hearts,[14,12,11,2]), suit(2,diamonds,[10,9]),suit(3,clubs,[5,4,3])], [suit(3,spades,[5,4,3]),suit(3,hearts,[13,8,7]), suit(3,diamonds,[13,8,7]),suit(4,clubs,[8,7,6,2])], [suit(4,spades,[12,8,7,6]),suit(3,hearts,[6,5,4]), suit(4,diamonds,[6,5,4,2]),suit(2,clubs,[12,9])])). b9 ::- play_hand(hand( [suit(2,spades,[13,11]),suit(2,hearts,[11,4]), suit(3,diamonds,[14,11,3]),suit(6,clubs,[14,11,10,8,7,5])], [suit(2,spades,[14,2]),suit(4,hearts,[14,12,3,2]), suit(4,diamonds,[13,10,9,2]),suit(3,clubs,[13,3,2])], [suit(3,spades,[5,4,3]),suit(3,hearts,[10,9,8]), suit(4,diamonds,[8,7,6,5]),suit(3,clubs,[12,9,6])], [suit(6,spades,[12,10,9,8,7,6]),suit(4,hearts,[13,7,6,5]), suit(2,diamonds,[12,4]),suit(1,clubs,[4])])). b10 ::- play_hand(hand( [suit(5,spades,[14,11,10,4,3]),suit(4,hearts,[14,13,11,10]), suit(4,diamonds,[14,13,11,9]),suit(0,clubs,[])], [suit(2,spades,[13,2]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[4,3,2]),suit(5,clubs,[14,13,12,10,9])], [suit(2,spades,[6,5]),suit(3,hearts,[12,9,8]), suit(3,diamonds,[12,10,8]),suit(5,clubs,[6,5,4,3,2])], [suit(4,spades,[12,9,8,7]),suit(3,hearts,[7,6,5]), suit(3,diamonds,[7,6,5]),suit(3,clubs,[11,8,7])])). b11 ::- play_hand(hand( [suit(5,spades,[14,11,9,4,3]),suit(4,hearts,[14,11,10,8]), suit(4,diamonds,[14,11,10,9]),suit(0,clubs,[])], [suit(2,spades,[13,2]),suit(3,hearts,[13,3,2]), suit(3,diamonds,[13,3,2]),suit(5,clubs,[14,13,12,11,9])], [suit(2,spades,[6,5]),suit(3,hearts,[12,9,4]), suit(3,diamonds,[12,8,4]),suit(5,clubs,[6,5,4,3,2])], [suit(4,spades,[12,10,8,7]),suit(3,hearts,[7,6,5]), suit(3,diamonds,[7,6,5]),suit(3,clubs,[10,8,7])])). b12 ::- play_hand(hand( [suit(5,spades,[14,11,10,4,3]),suit(4,hearts,[13,12,11,2]), suit(4,diamonds,[14,11,10,9]),suit(0,clubs,[])], [suit(2,spades,[13,2]),suit(3,hearts,[5,4,3]), suit(3,diamonds,[13,3,2]),suit(5,clubs,[14,13,12,11,9])], [suit(2,spades,[6,5]),suit(3,hearts,[10,9,8]), suit(3,diamonds,[12,8,4]),suit(5,clubs,[6,5,4,3,2])], [suit(4,spades,[12,9,8,7]),suit(3,hearts,[14,7,6]), suit(3,diamonds,[7,6,5]),suit(3,clubs,[10,8,7])])). b13 ::- play_hand(hand( [suit(4,spades,[14,11,10,5]),suit(2,hearts,[3,2]), suit(4,diamonds,[5,4,3,2]),suit(3,clubs,[14,3,2])], [suit(3,spades,[4,3,2]),suit(4,hearts,[14,13,10,9]), suit(3,diamonds,[14,12,10]),suit(3,clubs,[11,10,9])], [suit(3,spades,[13,9,8]),suit(3,hearts,[12,11,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,8,7])], [suit(3,spades,[12,7,6]),suit(4,hearts,[7,6,5,4]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b13a ::- play_hand(hand( [suit(3,spades,[14,11,10]),suit(3,hearts,[4,3,2]), suit(4,diamonds,[5,4,3,2]),suit(3,clubs,[14,3,2])], [suit(3,spades,[4,3,2]),suit(4,hearts,[14,13,10,9]), suit(3,diamonds,[14,12,10]),suit(3,clubs,[11,10,9])], [suit(3,spades,[13,12,8]),suit(3,hearts,[12,11,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,8,7])], [suit(4,spades,[9,7,6,5]),suit(3,hearts,[7,6,5]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b13b ::- play_hand(hand( [suit(4,spades,[14,11,10,9]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[5,4,3]),suit(3,clubs,[14,3,2])], [suit(3,spades,[4,3,2]),suit(4,hearts,[14,13,10,9]), suit(3,diamonds,[14,12,10]),suit(3,clubs,[11,10,9])], [suit(3,spades,[12,8,7]),suit(3,hearts,[12,11,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,8,7])], [suit(3,spades,[13,6,5]),suit(3,hearts,[7,6,5]), suit(4,diamonds,[8,7,6,5]),suit(3,clubs,[6,5,4])])). b13c ::- play_hand(hand( [suit(4,spades,[14,11,10,9]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[4,3,2]),suit(3,clubs,[14,3,2])], [suit(3,spades,[4,3,2]),suit(4,hearts,[14,13,10,9]), suit(3,diamonds,[14,12,10]),suit(3,clubs,[11,10,9])], [suit(3,spades,[12,8,7]),suit(3,hearts,[12,11,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,8,7])], [suit(3,spades,[13,6,5]),suit(3,hearts,[7,6,5]), suit(4,diamonds,[8,7,6,5]),suit(3,clubs,[6,5,4])])). b13d ::- play_hand(hand( [suit(4,spades,[14,11,10,9]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[4,3,2]),suit(3,clubs,[14,3,2])], [suit(3,spades,[4,3,2]),suit(4,hearts,[14,13,10,9]), suit(3,diamonds,[14,12,10]),suit(3,clubs,[11,10,9])], [suit(3,spades,[12,8,7]),suit(3,hearts,[11,8,7]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,8,7])], [suit(3,spades,[13,6,5]),suit(3,hearts,[12,6,5]), suit(4,diamonds,[8,7,6,5]),suit(3,clubs,[6,5,4])])). b13e ::- play_hand(hand( [suit(3,spades,[14,11,10]),suit(3,hearts,[4,3,2]), suit(4,diamonds,[5,4,3,2]),suit(3,clubs,[14,3,2])], [suit(3,spades,[4,3,2]),suit(4,hearts,[14,13,10,9]), suit(3,diamonds,[12,11,10]),suit(3,clubs,[11,10,9])], [suit(3,spades,[13,12,8]),suit(3,hearts,[12,11,8]), suit(3,diamonds,[14,9,8]),suit(4,clubs,[13,12,8,7])], [suit(4,spades,[9,7,6,5]),suit(3,hearts,[7,6,5]), suit(3,diamonds,[13,7,6]),suit(3,clubs,[6,5,4])])). b14 ::- play_hand(hand( [suit(3,spades,[14,11,10]),suit(4,hearts,[5,4,3,2]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,3])], [suit(3,spades,[4,3,2]),suit(3,hearts,[14,13,10]), suit(3,diamonds,[14,12,10]),suit(4,clubs,[11,10,9,2])], [suit(3,spades,[13,9,8]),suit(3,hearts,[12,11,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,8,7])], [suit(4,spades,[12,7,6,5]),suit(3,hearts,[9,7,6]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b15 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,3])], [suit(1,spades,[4]),suit(5,hearts,[14,13,10,3,2]), suit(3,diamonds,[14,12,10]),suit(4,clubs,[11,10,9,2])], [suit(3,spades,[13,9,8]),suit(3,hearts,[12,11,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,8,7])], [suit(4,spades,[12,7,6,5]),suit(3,hearts,[9,7,6]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b16 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,8])], [suit(2,spades,[5,4]),suit(4,hearts,[14,13,11,10]), suit(3,diamonds,[14,12,10]),suit(4,clubs,[11,10,9,7])], [suit(4,spades,[13,9,8,6]),suit(2,hearts,[12,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,3,2])], [suit(2,spades,[12,7]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b17 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,8])], [suit(3,spades,[6,5,4]),suit(3,hearts,[14,13,11]), suit(3,diamonds,[14,12,10]),suit(4,clubs,[11,10,9,7])], [suit(3,spades,[13,9,8]),suit(3,hearts,[12,10,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,12,3,2])], [suit(2,spades,[12,7]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b18 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,8])], [suit(3,spades,[6,5,4]),suit(3,hearts,[14,13,11]), suit(3,diamonds,[14,12,11]),suit(4,clubs,[11,10,9,7])], [suit(3,spades,[13,9,8]),suit(3,hearts,[12,10,8]), suit(3,diamonds,[13,10,9]),suit(4,clubs,[13,12,3,2])], [suit(2,spades,[12,7]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b19 ::- play_hand(hand( [suit(5,spades,[14,11,9,4,3]),suit(4,hearts,[14,11,10,8]), suit(4,diamonds,[14,11,10,9]),suit(0,clubs,[])], [suit(2,spades,[13,2]),suit(3,hearts,[13,3,2]), suit(3,diamonds,[13,3,2]),suit(5,clubs,[14,13,12,11,9])], [suit(2,spades,[6,5]),suit(3,hearts,[12,9,4]), suit(3,diamonds,[12,8,4]),suit(5,clubs,[10,6,5,4,3])], [suit(4,spades,[12,10,8,7]),suit(3,hearts,[7,6,5]), suit(3,diamonds,[7,6,5]),suit(3,clubs,[8,7,2])])). b20 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,8])], [suit(1,spades,[4]),suit(4,hearts,[14,11,10,2]), suit(3,diamonds,[14,12,11]),suit(5,clubs,[12,10,9,7,2])], [suit(5,spades,[13,9,8,6,5]),suit(2,hearts,[12,8]), suit(3,diamonds,[13,10,9]),suit(3,clubs,[13,11,3])], [suit(2,spades,[12,7]),suit(5,hearts,[13,9,7,6,3]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b21 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(1,hearts,[5]), suit(4,diamonds,[5,4,3,2]),suit(3,clubs,[14,8,3])], [suit(1,spades,[4]),suit(4,hearts,[14,13,11,10]), suit(3,diamonds,[14,12,10]),suit(5,clubs,[12,10,6,5,4])], [suit(5,spades,[13,9,8,6,5]),suit(3,hearts,[12,8,4]), suit(3,diamonds,[13,11,9]),suit(2,clubs,[13,11])], [suit(2,spades,[12,7]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[9,7,2])])). b22 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[9,4,3,2]),suit(2,clubs,[14,8])], [suit(1,spades,[4]),suit(4,hearts,[14,13,10,9]), suit(3,diamonds,[14,12,10]),suit(5,clubs,[12,10,9,7,2])], [suit(5,spades,[13,9,8,6,5]),suit(2,hearts,[12,8]), suit(3,diamonds,[13,11,5]),suit(3,clubs,[13,11,3])], [suit(2,spades,[12,7]),suit(5,hearts,[11,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b23 ::- play_hand(hand( [suit(5,spades,[14,11,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,8])], [suit(2,spades,[5,4]),suit(4,hearts,[14,13,11,10]), suit(3,diamonds,[14,12,10]),suit(4,clubs,[12,11,9,7])], [suit(4,spades,[13,9,8,6]),suit(2,hearts,[12,8]), suit(3,diamonds,[13,11,9]),suit(4,clubs,[13,10,3,2])], [suit(2,spades,[12,7]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(3,clubs,[6,5,4])])). b24 ::- play_hand(hand( [suit(5,spades,[12,10,6,4,3]),suit(1,hearts,[11]), suit(3,diamonds,[14,12,10]),suit(4,clubs,[14,10,8,7])], [suit(3,spades,[11,7,5]),suit(4,hearts,[14,10,4,3]), suit(2,diamonds,[11,8]),suit(4,clubs,[6,5,4,2])], [suit(2,spades,[14,9]),suit(2,hearts,[13,12]), suit(6,diamonds,[13,9,7,6,3,2]),suit(3,clubs,[11,9,3])], [suit(3,spades,[13,8,2]),suit(6,hearts,[9,8,7,6,5,2]), suit(2,diamonds,[5,4]),suit(2,clubs,[13,12])])). b25 ::- play_hand(hand( [suit(3,spades,[14,13,2]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[14,13,11]),suit(4,clubs,[14,7,6,5])], [suit(5,spades,[12,10,9,8,7]),suit(4,hearts,[14,13,11,10]), suit(2,diamonds,[4,3]),suit(2,clubs,[13,3])], [suit(4,spades,[11,5,4,3]),suit(4,hearts,[12,9,8,7]), suit(4,diamonds,[12,9,8,7]),suit(1,clubs,[2])], [suit(1,spades,[6]),suit(2,hearts,[6,5]), suit(4,diamonds,[10,6,5,2]),suit(6,clubs,[12,11,10,9,8,4])])). b26 ::- play_hand(hand( [suit(3,spades,[14,13,2]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[14,13,10]),suit(4,clubs,[14,7,6,5])], [suit(5,spades,[12,10,9,8,7]),suit(4,hearts,[14,13,11,10]), suit(2,diamonds,[4,3]),suit(2,clubs,[4,3])], [suit(4,spades,[11,5,4,3]),suit(4,hearts,[12,9,8,7]), suit(4,diamonds,[12,9,8,7]),suit(1,clubs,[2])], [suit(1,spades,[6]),suit(2,hearts,[6,5]), suit(4,diamonds,[11,6,5,2]),suit(6,clubs,[13,12,11,10,9,8])])). b27 ::- play_hand(hand( [suit(2,spades,[13,11]),suit(2,hearts,[11,4]), suit(3,diamonds,[14,11,3]),suit(6,clubs,[14,11,10,8,7,5])], [suit(2,spades,[14,2]),suit(4,hearts,[14,12,3,2]), suit(4,diamonds,[13,10,9,2]),suit(3,clubs,[13,3,2])], [suit(3,spades,[5,4,3]),suit(3,hearts,[10,9,8]), suit(4,diamonds,[8,7,6,5]),suit(3,clubs,[9,6,4])], [suit(6,spades,[12,10,9,8,7,6]),suit(4,hearts,[13,7,6,5]), suit(2,diamonds,[12,4]),suit(1,clubs,[12])])). b27a ::- play_hand(hand( [suit(2,spades,[13,11]),suit(2,hearts,[11,4]), suit(3,diamonds,[14,11,3]),suit(6,clubs,[14,11,10,8,7,5])], [suit(2,spades,[14,2]),suit(4,hearts,[14,12,3,2]), suit(4,diamonds,[13,10,9,2]),suit(3,clubs,[13,3,2])], [suit(3,spades,[5,4,3]),suit(3,hearts,[10,9,8]), suit(4,diamonds,[8,7,6,5]),suit(3,clubs,[12,6,4])], [suit(6,spades,[12,10,9,8,7,6]),suit(4,hearts,[13,7,6,5]), suit(2,diamonds,[12,4]),suit(1,clubs,[9])])). b28 ::- play_hand(hand( [suit(3,spades,[14,13,2]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[14,13,11]),suit(4,clubs,[14,7,6,5])], [suit(5,spades,[12,10,9,8,7]),suit(4,hearts,[14,13,11,10]), suit(2,diamonds,[4,3]),suit(2,clubs,[13,3])], [suit(1,spades,[6]),suit(2,hearts,[6,5]), suit(4,diamonds,[10,6,5,2]),suit(6,clubs,[12,11,10,9,8,4])], [suit(4,spades,[11,5,4,3]),suit(4,hearts,[12,9,8,7]), suit(4,diamonds,[12,9,8,7]),suit(1,clubs,[2])])). b29 ::- play_hand(hand( [suit(3,spades,[14,13,2]),suit(3,hearts,[4,3,2]), suit(3,diamonds,[14,13,11]),suit(4,clubs,[14,11,6,5])], [suit(5,spades,[12,7,5,4,3]),suit(4,hearts,[14,13,11,10]), suit(2,diamonds,[4,3]),suit(2,clubs,[13,3])], [suit(1,spades,[6]),suit(0,hearts,[]), suit(5,diamonds,[10,7,6,5,2]),suit(7,clubs,[12,10,9,8,7,4,2])], [suit(4,spades,[11,10,9,8]),suit(6,hearts,[12,9,8,7,6,5]), suit(3,diamonds,[12,9,8]),suit(0,clubs,[])])). b30 ::- play_hand(hand( [suit(2,spades,[13,11]),suit(3,hearts,[10,9,3]), suit(4,diamonds,[14,12,11,3]),suit(4,clubs,[14,13,11,10])], [suit(4,spades,[14,10,9,2]),suit(4,hearts,[14,12,11,2]), suit(2,diamonds,[10,9]),suit(3,clubs,[5,4,3])], [suit(3,spades,[5,4,3]),suit(3,hearts,[13,8,7]), suit(3,diamonds,[13,8,7]),suit(4,clubs,[12,8,7,6])], [suit(4,spades,[12,8,7,6]),suit(3,hearts,[6,5,4]), suit(4,diamonds,[6,5,4,2]),suit(2,clubs,[9,2])])). b31 ::- play_hand(hand( [suit(3,spades,[8,7,6]),suit(3,hearts,[10,9,8]), suit(3,diamonds,[8,7,6]),suit(4,clubs,[10,9,8,7])], [suit(4,spades,[12,11,10,9]),suit(5,hearts,[13,12,11,7,6]), suit(3,diamonds,[13,10,9]),suit(1,clubs,[12])], [suit(3,spades,[14,13,2]),suit(2,hearts,[14,2]), suit(4,diamonds,[5,4,3,2]),suit(4,clubs,[13,6,5,4])], [suit(3,spades,[5,4,3]),suit(3,hearts,[5,4,3]), suit(3,diamonds,[14,12,11]),suit(4,clubs,[14,11,3,2])])). b32 ::- play_hand(hand( [suit(3,spades,[8,7,6]),suit(3,hearts,[10,9,8]), suit(3,diamonds,[8,7,6]),suit(4,clubs,[9,8,7,3])], [suit(4,spades,[12,11,10,9]),suit(5,hearts,[13,12,11,7,6]), suit(3,diamonds,[13,10,9]),suit(1,clubs,[12])], [suit(3,spades,[14,13,2]),suit(2,hearts,[14,2]), suit(4,diamonds,[5,4,3,2]),suit(4,clubs,[13,6,5,4])], [suit(3,spades,[5,4,3]),suit(3,hearts,[5,4,3]), suit(3,diamonds,[14,12,11]),suit(4,clubs,[14,11,10,2])])). b33a ::- play_hand(hand( [suit(5,spades,[13,12,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,8])], [suit(4,spades,[14,9,5,4]),suit(3,hearts,[14,13,10]), suit(2,diamonds,[14,12]),suit(4,clubs,[11,10,9,7])], [suit(4,spades,[11,8,7,6]),suit(3,hearts,[12,11,8]), suit(4,diamonds,[13,11,10,9]),suit(2,clubs,[12,2])], [suit(0,spades,[]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(5,clubs,[13,6,5,4,3])])). b33b ::- play_hand(hand( [suit(5,spades,[13,12,10,3,2]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(2,clubs,[14,8])], [suit(4,spades,[14,9,5,4]),suit(3,hearts,[14,13,10]), suit(2,diamonds,[14,12]),suit(4,clubs,[11,10,9,7])], [suit(0,spades,[]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(5,clubs,[13,6,5,4,3])], [suit(4,spades,[11,8,7,6]),suit(3,hearts,[12,11,8]), suit(4,diamonds,[13,11,10,9]),suit(2,clubs,[12,2])])). b33c ::- play_hand(hand( [suit(4,spades,[13,12,9,8]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(3,clubs,[14,8,7])], [suit(5,spades,[14,6,5,4,2]),suit(3,hearts,[14,13,10]), suit(2,diamonds,[14,12]),suit(3,clubs,[11,10,9])], [suit(0,spades,[]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(5,clubs,[13,6,5,4,3])], [suit(4,spades,[11,10,7,3]),suit(3,hearts,[12,11,8]), suit(4,diamonds,[13,11,10,9]),suit(2,clubs,[12,2])])). b33d ::- play_hand(hand( [suit(4,spades,[13,12,9,8]),suit(2,hearts,[5,4]), suit(4,diamonds,[5,4,3,2]),suit(3,clubs,[14,8,7])], [suit(5,spades,[14,6,5,4,2]),suit(3,hearts,[14,13,10]), suit(2,diamonds,[14,12]),suit(3,clubs,[11,10,9])], [suit(4,spades,[11,10,7,3]),suit(3,hearts,[12,11,8]), suit(4,diamonds,[13,11,10,9]),suit(2,clubs,[12,2])], [suit(0,spades,[]),suit(5,hearts,[9,7,6,3,2]), suit(3,diamonds,[8,7,6]),suit(5,clubs,[13,6,5,4,3])])). % ::- Assert(Trace_Lvl(2)), [Newhand, Eg, Gdraw, Facts, Bridge, Analysis, Synthesis, Planning, Exec_Mon]. % ::- assert(trace_lvl(2)), [newhand, eg, gdraw, facts, bridge, analysis, synthesis, planning, exec_mon]. /* File - bridge.pl */ /* Main loop of program */ /* play_hand(+Hands, +Known, +Plan) */ play_hand(Hands, Known, Plan) ::- play_trick(Hands, Known, Plan, Hands1, Known1, Plan1), play_hand(Hands1, Known1, Plan1). play_hand(hand([suit(0,_,_),suit(0,_,_),suit(0,_,_),suit(0,_,_)],_,_,_),_,_) ::- !, format("Congratulations, hand is over~n",[]). /* Play one trick play_trick(+Hands, +Known, +Plan, -Hands1, -Known1, -Plan1) */ play_trick(Hands, known(Contract,Leader,Winners), Plan, Hands1, known(Contract,Winner,Winners1), NPlan) ::- ( /* If a plan does not exist either as this is the beginning of play or that a plan that was being executed failed we need to find one */ Plan = [], /* ---THE ABSTRACTION STAGE---*/ evaluate_hand(Hands, Contract, Analysis), format('~NHand ::~n~n', []), write_deal(Hands), format('~N~n~n', []), format('~NSuit analysis ::~n~n', []), prettyprint(Analysis), format('~N~n', []), !, /* ---THE SYNTHESIS STAGE---*/ strategy(Contract, Winners, Analysis, Leader, LeadSuit, Plans), /* ---THE PLANNING STAGE---*/ planning(Hands, Contract, Plans, BestPlan) ; true ), /* ---THE EXECUTION STAGE---*/ play_trick(Hands, Leader, Contract, BestPlan, PlayedCards, Hands1, Tactic, Plan1), /* Find who wins the trick */ find_winner(Leader, PlayedCards, Contract, WinSuit, Winner, Side), /* Update the number of winners */ update_winners(Winners, Winner, Contract, Winners1), ( /* ---THE MONITORING STAGE---*/ /* evaluate played suit */ evaluate_suit(WinSuit, Hands1, Contract, Analysis), /* Check whether any defender did not follow suit */ defender_showed_out(Leader, Contract, PlayedCards,Learned), /* Update what has been learnt about the opponents cards */ update_learnt(Contract, WinSuit, Hands1, Side, Winner, Learned), /* take result of analysis and see if plan requirement has failed */ check_plan(Contract, WinSuit, Side, Winner, Tactic), /* Find the current potential of the same tactic after trick */ find_tactic(Tactic, Analysis, Tactic1), arg(3, Tactic, Potential), arg(3, Tactic1, Potential1), /* See if anything serendipitious has occurred */ action_result(Tactic, WinSuit, Potential, Tactic1, Potential1, Side, Update), /* If all went as planned, update the plan to reflect this trick */ update_llp(Plan1, Hands1, WinSuit, Analysis, Update, Contract, NPlan) ; /* Else, if plan failed then set NPlan to be empty */ NPlan = [] ). /* Executing one trick play_trick(+Hands, +Leader, +Winners, +Contract, +Plan, -PlayedCards, -Hands1, -Tactic, -Plan1) */ /* The case that declarer or dummy is on lead */ play_trick(Hands, Leader, Contract, Plan, [Card1, Card2, Card3, Card4], NHands, Tactic, Plan1) ::- arg(3,Contract,Dec), ( Leader = Dec ; partner(Leader,Dec) ), !, /* Choose the first tactic from plan */ choose_tactic(Leader,_, Plan, Tactic, Plan1), /* Find the suit of that tactic */ arg(2,Tactic,LeadSuit), /* Find declarer, dummy and combined defendered holding in the suit*/ get_players_suit(Hands, Leader, DecSuit1, DecSuit2, DefSuit), /* Execution stage chooses the appropriate card from declarer's holding */ tactic_card(Tactic, Contract, Leader, [], DecSuit1, DecSuit2, DefSuit, Card1), /* Choose first defenders card */ next_play(Leader, Def1), defender_card(Hands, Def1, LeadSuit, Contract, Card2), /* Execution stage chooses the appropriate card from dummy's holding */ partner(Leader,Partner), tactic_card(Tactic, Contract, Partner, [Card2, Card1], DecSuit2, DecSuit1, DefSuit, Card3), /* Choose second defenders card */ next_play(Def2, Leader), defender_card(Hands, Def2, LeadSuit, Contract, Card4), close_trick, update_hand(Hands, Card1, Card2, Card3, Card4, NHands), display(NHands). /* The code for play trick is similar if a defender is on lead except choose_tactic changes to select the first tactic in the led suit */ /* Action result checks if something serendipitous has occurred action_result(+Action1, +WinSuit, +Potential1, +Action2, +Potential2, +WinningSide, -Update) */ /* File - abstraction.pl */ /* Variables that start with C,U,P stand for Certain, Usual, and Possible */ /* Evaluates the potential of each tactic for one suit evaluate_suit(+Suit, +Hand, +Contract, -Tactics) */ evaluate_suit(Suit, Hand, contract(_, _Trumps, Declarer), Tactics) ::- partner(Declarer, Dummy), next_play(Declarer, Defender1), next_play(Dummy, Defender2), get_hand(Hand, Declarer, DecHand), get_hand(Hand, Dummy, DumHand), get_hand(Hand, Defender1, DefHand1), get_hand(Hand, Defender2, DefHand2), get_suit(DecHand, Suit, DecCards), get_suit(DumHand, Suit, DumCards), get_suit(DefHand1, Suit, Def1Cards), get_suit(DefHand2, Suit, Def2Cards), merge(Def1Cards, Def2Cards, DefCards), top_winners(DecCards, DumCards, DefCards, CWinners, UWinners, PWinners), max_entries(DecCards, DumCards, DefCards, DumEntries), max_entries(DumCards, DecCards, DefCards, DecEntries), develop_tricks(DecCards, DumCards, DefCards, certain, CWinLose), develop_tricks(DecCards, DumCards, DefCards, usual, UWinLose), develop_tricks(DecCards, DumCards, DefCards, possible, PWinLose), cash_tactic(CWinLose,UWinLose,PWinLose, CDWinners-CL,UDWinners-UL,PDWinners-PL), finesse_winners(DecCards, DumCards, DefCards, Type1, CFWinners1, UFWinners1, PFWinners1, CDFWinners1, UDFWinners1, PDFWinners1), add_tactic([cash(CWinners,UWinners,PWinners, CDWinners-CL,UDWinners-UL,PDWinners-PL), entries(DecEntries, DumEntries)], fin_dum(Type1, CFWinners1, UFWinners1, PFWinners1, CDFWinners1, UDFWinners1, PDFWinners1),Tactic1), finesse_winners(DumCards, DecCards, DefCards, Type2, CFWinners2, UFWinners2, PFWinners2, CDFWinners2, UDFWinners2, PDFWinners2), add_tactic(Tactic1, fin_dec(Type2, CFWinners2, UFWinners2, PFWinners2, CDFWinners2, UDFWinners2, PDFWinners2),Tactic2), dfinesse_winners(DecCards, DumCards, DefCards, Certain_df1, Usual_df1, Possible_df1, Certain_df_dev1, Usual_df_dev1, Possible_df_dev1), add_tactic(Tactic2, dbl2_fin_dum(Certain_df1, Usual_df1, Possible_df1, Certain_df_dev1, Usual_df_dev1, Possible_df_dev1), Tactic3), dfinesse_winners(DumCards, DecCards, DefCards, Certain_df2, Usual_df2, Possible_df2, Certain_df_dev2, Usual_df_dev2, Possible_df_dev2), add_tactic(Tactic3, dbl2_fin_dec(Certain_df2, Usual_df2, Possible_df2, Certain_df_dev2, Usual_df_dev2, Possible_df_dev2), Tactics). /* just to show where the trump analysis would fit get_suit(Dum, Trumps, DumTrumps), trump_winners(DecCards, DumCards, DefCards, DumTrumps, Suit, Trumps, Potential1, UTWinners1, PTWinners1), trump_winners(DumCards, DecCards, DefCards, DecTrumps, Suit, Trumps, Potential2, UTWinners2, PTWinners2). */ /* File - synthesis.pl */ /* Find the best strategy to fulfill the contract For each Suit the following analysis is generated by the abstraction stage - tricks([Tactic(CT, UT, PT, CD, UD, PD)|Other_Tactics]) tactic = cash|entries|sim_fin_dec|sim_fin_dum|rev_fin_dec|rev_fin_dum| dbl1_fin_dec|dbl1_fin_dum|dbl2_fin_dec|dbl2_fin_dum C/U/P = certain/usual/possible; T/D = Top/Developed; - cash and entries tactic is always included, others tactics are included only if applicable - entries(Dec, Dum), strategy(+Contract, +Winners, +Analysis, +Leader, +LeadSuit, -Plans) */ strategy(Contract, Winners, Analysis, Leader, LeadSuit, [BestPlan|Others]) ::- /* Simplify removes repeating occurences of a tactic with same potential with different probabilities, Only need to keep the most likely one */ simplify(Analysis, S_Analysis, H_Analysis, D_Analysis, C_Analysis), /* Find all feasible strategies */ setof(Plan,strategies(Contract, Winners, S_Analysis, H_Analysis, D_Analysis, C_Analysis, Plan), Plans), /* Order them by probability of success */ order_plans(Plans, Contract, Leader, LeadSuit, [Plan1|Plans1]), !, /* Find enhancements to the plan */ enhance_plan(Plan1, Plans1, BestPlan, Others). /* If no strategy found, find one that generates the most number of tricks */ strategy(_, _, Analysis, _, _, [(999, [spades(S_Tactic, S_Prob, S_Win), hearts(H_Tactic, H_Prob, H_Win), diamonds(D_Tactic, D_Prob, D_Win), clubs(C_Tactic, C_Prob, C_Win)])]) ::- simplify(Analysis, S_Analysis, H_Analysis, D_Analysis, C_Analysis), format("No good plan found!!! - going with this~n",[]), maximize(S_Analysis, S_Tactic, S_Prob, S_Win), maximize(H_Analysis, H_Tactic, H_Prob, H_Win), maximize(D_Analysis, D_Tactic, D_Prob, D_Win), maximize(C_Analysis, C_Tactic, C_Prob, C_Win). /* strategies(+Contract, +Winners, +SpadeAnalysis, +HeartAnalysis, +DiamondAnalysis, +ClubAnalysis, +Leader, +LeadSuit, -Strategies) */ strategies(contract(Level, _, _), winners(Won, Lost), S, H, D, C, [spades(S1, S_Prob, S_Winners), hearts(H1, H_Prob, H_Winners), diamonds(D1, D_Prob, D_Winners), clubs(C1, C_Prob, C_Winners)]) ::- num_tricks(S, S1, T1, S_Prob, S_Winners, S_Losers), num_tricks(H, H1, T2, H_Prob, H_Winners, H_Losers), num_tricks(D, D1, T3, D_Prob, D_Winners, D_Losers), num_tricks(C, C1, T4, C_Prob, C_Winners, C_Losers), /* Check that enough tricks are won*/ S_Winners + H_Winners + D_Winners + C_Winners >= Level + 6 - Won, /* Make sure that there are enough entries for tactic to be executable */ check_entries(S, H, D, C, T1, T2, T3, T4), /* Number of actions calculates number of tricks played */ number_of_actions(_,_,_,N), /* Make sure there are not too many winners */ 13 >= S_Winners + H_Winners + D_Winners + C_Winners + S_Losers + H_Losers + D_Losers + C_Losers + N, /* Make sure there are not too many losers */ S_Losers + H_Losers + D_Losers + C_Losers =< Lost + 13 - Level - 6. /* Number of tricks won and lost by a tactic num_tricks(+Tactics, +Suit, -TacticName, -Tactic_Prob, -Tactic_Winners, -Tactic_Losers */ num_tricks([Tactic|_], Name, Tactic, Prob, Win+Dev, Losers) ::- functor(Tactic,Name,_), arg(1,Tactic,Prob), arg(2,Tactic,Win+Dev-_), losers(Tactic, Losers), !. num_tricks([_|Tactics], Name, Tactic, Prob, Tricks, Winners) ::- num_tricks(Tactics, Name, Tactic, Prob, Tricks, Winners). /* Number of losers accrued executing a tactic losers(+Tactic, -Losers) /* For example cash, simple finesse, and double2 finesse have any no losers */ losers(cash(_,_),0) ::- !. losers(sim_fin_dec(_,_),0) ::- !. losers(sim_fin_dum(_,_),0) ::- !. losers(dbl2_fin_dec(_,_),0) ::- !. losers(dbl2_fin_dum(_,_),0) ::- !. /* double1 finesse has one loser */ losers(dbl1_fin_dec(_,_),1) ::- !. losers(dbl1_fin_dum(_,_),1) ::- !. /* Losers using development is already done */ losers(develop(_,_+_-L),L) ::- !. /* Use quicksort to sort the plans by the relative probabilites order_plans(+Plans, +Contract, +Leader, +LeadSuit, -OPlans). */ order_plans([], _, _, _, []). order_plans([Plan|Plans], Contract, Leader, LeadSuit, OPlans) ::- plan_prob(Plan, Contract, Leader, LeadSuit, V1), !, partition(Plans, Contract, Leader, LeadSuit, V1, Littles, Bigs), order_plans(Littles, Contract, Leader, LeadSuit, Ls), order_plans(Bigs, Contract, Leader, LeadSuit, Bs), append(Ls,[(V1,Plan)|Bs],OPlans). order_plans([_|Plans], Contract, Leader, LeadSuit, OPlans) ::- order_plans(Plans, Contract, Leader, LeadSuit, OPlans). /* Probability of a plan is the combined probabities of each suit tactic */ plan_prob([Tactic|Tactics], Contract, Leader, LeadSuit, PV) ::- suit_prob(Tactic, Contract, Leader, LeadSuit, SV), plan_prob(Tactics, Contract, Leader, LeadSuit, PVs), PV is SV * PVs. /* Probability of a tactic is the probability of the tactic succeeding e.g. p(finesse) = 0.5, multiplied by the required suit division, e.g. prob(usual) = 0.66 suit_prob(+Tactic, +Contract, +Leader, +LeadSuit, Suit_Probability) */ suit_prob(Tactic, Contract, Leader, LeadSuit, Suit_Probability) ::- tactic_prob(Tactic, Contract, Leader, LeadSuit, Tactic_Prob), !, distribution_prob(Tactic, Distribution_Prob), Suit_Probability is Tactic_Prob * Distribution_Prob. /* tactic_prob(+Tactic, +Contract, +Leader, +LeadSuit, -Tactic_Prob) In order to avoid division, we use inverse probabilities, thus the higher the value, the less likely the tactics will succeed */ /* Probability of cash and develop = 1 i.e. a certainty */ tactic_prob(Tactic, _, _, _, 1) ::- ( arg(1, Tactic, develop) ; arg(1, Tactic, cash) ), !. /* Probability of finesse = 1 if the right defender is know to be void */ tactic_prob(Tactic, contract(_,_,Dec), _, _, 1) ::- ( arg(1,Tactic,sim_fin_dec) ; arg(1,Tactic,dbl1_fin_dec); arg(1,Tactic,dbl2_fin_dec) ), functor(Tactic, Suit,_), next_play(Dec,Next), Known =.. [Suit, void, Next], clause(known(Known),_), !. /* Probability of finesse = 0 if the wrong defender is know to be void */ tactic_prob(Tactic, contract(_,_,Dec), _, _, 999) ::- ( arg(1,Tactic,sim_fin_dec) ; arg(1,Tactic,dbl1_fin_dec) ; arg(1,Tactic,dbl2_fin_dec) ), functor(Tactic, Suit,_), next_play(Next,Dec), Known =.. [Suit,void,Next], clause(known(Known),_), !, fail. /* Probability of finesse = 2 (inverse of 0.5) */ tactic_prob(Tactic, _, _, _, 2) ::- arg(1, Tactic, sim_dfin_dec) ; arg(1, Tactic, sim_dfin_dum) ; arg(1, Tactic, rev_fin_dec) ; arg(1, Tactic, rev_fin_dum) ; arg(1, Tactic, rev_dfin_dec) ; arg(1, Tactic, rev_dfin_dum). /* Probability of double_finesse = is usually 4 but can be 2 if left hand opponent leads into the finesse suit */ tactic_prob(Tactic, contract(_,_,Dec), Leader, LeadSuit, V) ::- ( ( arg(1, Tactic, dbl2_fin_dec) ; arg(1, Tactic, dbl2_dfin_dec) ), !, ( functor(Tactic,LeadSuit,_), next_play(Dec, Leader), V = 2 ; V = 4) ) ; ( ( arg(1, Tactic, dbl2_fin_dum) ; arg(1, Tactic, dbl2_dfin_dum) ), !, ( functor(Tactic,LeadSuit,_), next_play(Leader, Dec), V = 2 ; V = 4) ). /* distribution_Prob(+Tactic,-Distribution_Prob) In order to avoid division, we use inverse probabilities, thus the higher the value, the less likely the tactics will succeed */ /* Certain distribuition = 1, Possible is 3/2 (i.e. inverse of .66) and possible = 3 (i.e. inverse of .33) */ distribution_prob(Tactic, 1) ::- arg(2,Tactic,cert), !. distribution_prob(Tactic, 3/2) ::- arg(2,Tactic,usual), !. distribution_prob(Tactic, 3) ::- arg(2,Tactic,pos), !. /* Enhance a plan by enhancing each tactic enhance_plan(+Plan, +Plans, -BestPlan, -OtherPlans). */ enhance_plan(Plan, [], Plan, []) ::- !. enhance_plan((V, Plan), [(V1, Plan1)|Plans], BestPlan, [(V,Plan)|OtherPlans]) ::- better_tactics(Plan1, Plan), !, enhance_plan((V1,Plan1), Plans, BestPlan, OtherPlans). enhance_plan(Plan, [Plan1|Plans], BestPlan, [Plan1|OtherPlans]) ::- enhance_plan(Plan, Plans, BestPlan, OtherPlans). /* Compare which of the two plans are betters. Check each suit, if one tactic generates more tricks than another then choose the plan with the tactic that generates more tricks. better_tactics(+Plan1, +Plan) */ better_tactics([Tactic1|Tactics1],[Tactic|Tactics]) ::- arg(1, Tactic, Type), arg(1, Tactic1, Type), arg(3, Tactic, W), arg(3, Tactic1, W1), better(W1, W), !, better_tactics(Tactics1, Tactics). better_tactics([Tactic1|Tactics1],[Tactic|Tactics]) ::- (arg(1, Tactic, cash); arg(1, Tactic, develop)), arg(1, Tactic1, Fin), /* Is the tactic a type of finesse such as sim_fin_dec or dbl_dfin_dum */ finesseable(Fin), arg(3, Tactic, W), arg(3, Tactic1, W1), better(W1, W), !, better_tactics(Tactics1, Tactics). /* better(+Potential_Tactic1, +Potential_Tactic2) */ /* Does the first tactic wins more tricks */ better(W1+W2-_,W3+W4-_) ::- W1 + W2 > W3 + W4. better(W1,W2+W3-_) ::- W1 > W2 + W3. better(W1+W2-_,W) ::- W1 + W2 > W. better(N2,N1) ::- N2 > N1. /* Does the first tactic wins the same number of tricks but has more winners */ better(W1+W2-_,W3+W4-_) ::- W1 + W2 = ::= W3 + W4, W1 > W3. /* File - planning.pl */ /* planning(+Hands, +Contract, +Plans, -BestPlan) */ planning(Hands, Contract, Plans, Spliced) ::- delete((Prob, Plan), Plans, OtherPlans), get_hands(Hands, DecHand, DumHand, DefHand), linearize_plan(Plan, Linearized), decompose_and_splice(Linearized, DecHand, DumHand,DefHand,Contract,Spliced), /* assert requirements needed for plan to succeed */ requirements(Prob, Plan), assert_other_plans(OtherPlans). linearize_plan(Plan, Linearized) ::- change_format_of_plan(Plan, Linearized). change_format_of_plan([], []). change_format_of_plan([F | R], [F1 | R1]) ::- change_format_of_plan_element(F, F1), !, change_format_of_plan(R, R1). /* Change spades(cash, cert, 5) into tactic(cash, spades, 5) */ change_format_of_plan_element(CashElement, CashElement1) ::- compound(CashElement), functor(CashElement, Suit, 3), arg(1, CashElement, cash), arg(3, CashElement, N), CashElement1 = tactic(cash, Suit, N), !. change_format_of_plan_element(CashElement, CashElement). get_hands(Hands, DecHand, DumHand, DefHand) ::- Hands = hand(North, South, East, _West), DecHand = South, DumHand = North, DefHand = East. /* Decompose and splice checks whether entry problems can be resolved if not then we back track to find next plan in Plans decompose_and_splice(+Linearized, +DecHand, +DumHand, +DefHand, -Spliced) */ decompose_and_splice(Tactics, Dec, Dum, Def, contract(_,_,Declarer), Lo_lvl) ::- /* decompose tactics recursively decompose each tactic into a set of tricks, using heuristics and safety plays */ decompose_tactics(Tactics, Declarer, Dec, Dum, Def, Lo_lvl), /*Find number of entries needed to execute plan */ splice(Lo_lvl, Declarer, Dec_Entries_Needed, Dum_Entries_Needed), /* Find number of entries available */ number_of_entries(Dec_Entries_Avail,Dum_Entries_Avail), /* Make sure that there are enough entries */ Dec_Entries_Avail >= Dec_Entries_Needed, Dum_Entries_Avail >= Dum_Entries_Needed. decompose_tactics([], _, _, _, _, _, []) ::- !. decompose_tactics([Tactic|Tactics], Declarer,Dec,Dum,Def,[Lo_lvl|Lo_lvls]) ::- arg(1,Tactic,Name), arg(2,Tactic,Suit), arg(3, Tactic,NumofTricks), decompose_tactic(Name, NumofTricks, Suit, Declarer, Dec, Dum, Def, Lo_lvl), decompose_tactics(Tactics, Declarer, Dec, Dum, Def, Lo_lvls). /* Decompose each tactic into low level actions decompose_tactic(+Tactic, +Tricks, +Suit, +Declarer, +Dec, +Dum, +Def, -Lo_lvl) */ /* some examples of decompose tactic */ /* Can we use a safety play */ decompose_tactic(Tactic,_, Suit,Declarer,DecCards,DumCards,DefCards,Lo_lvl) ::- length(DecCards, L1), length(DumCards, L2), length(DefCards, L3), 13 is L1 + L2 + L3, safety_play(Tactic, Suit, Declarer, DecCards, DumCards, Lo_lvl). /* If tactic is cash and either only declarer has the winner or both hands have winners but declarer has fewer cards so use heuristic of cashing winner in shorter hand first */ decompose_tactic(cash, Win, Suit, Declarer, [Dec1|DecCards],[Dum1|DumCards], [DefHighest|DefCards], [cash(1,Suit,Declarer)|Tactics]) ::- ( ( Dec1 > DefHighest, Dum1 > DefHighest, length(DecCards,L1), length(DumCards,L2), L1 < L2 ) ; ( Dec1 > DefHighest, Dum1 < DefHighest ) ; ( Dec1 < DefHighest, Dum1 < DefHighest, Dec1 > Dum1 ) ), !, delete_highest([Dec1|DecCards], DecCards1), delete_lowest([Dum1|DumCards], DumCards1), Win1 is Win - 1, decompose_tactic(cash, Win1, Suit, Declarer, DecCards1, DumCards1, [DefHighest|DefCards], Tactics). /* decompose a finesse */ decompose_tactic(finesse, Tricks, Suit, Declarer, DecCards, DumCards, DefCards, Lo_lvl) ::- tops(DecCards, DefHighest, Tops_Dec), tops(DumCards, DefHighest, Tops_Dum), length(DumCards,LDum), length(DecCards,LDec), partner(Declarer,Dummy), /* Cash dummy's winner if declarer has more or the same number of cards */ ( LDec >= LDum, decompose_tactic(cash, Tops_Dum, Suit, Dummy, Tactic1), decompose_tactic(cash, Tops_Dec, Suit, Declarer, Tactic3), Tactic4 = []; decompose_tactic(cash, Tops_Dec, Suit, Declarer, Tactic3), decompose_tactic(cash, Tops_Dum, Suit, Dummy, Tactic4), Tactic1 = [] ), length(Tactic1, Cashed1), length(Tactic3, Cashed3), length(Tactic4, Cashed4), Cashed is Cashed1 + Cashed3 + Cashed4, %Finesse the cards Fin is Tricks - Tops_Dec - Tops_Dum, Low_Dum is LDum - Tops_Dum, min(Fin, Low_Dum, Fin1), decompose(finesse, Fin1, Suit, Declarer, Tactic2), Remainder is Tricks - Fin1 - Cashed, Rest_Dec is LDec - Fin1 - Cashed, Rest_Dum is LDum - Fin1 - Cashed, decompose_tactic(cash, Remainder, Declarer, Rest_Dec, Rest_Dum, DefCards, Tactic5), append(Tactic1, Tactic2, Temp1), append(Tactic3, Tactic4, Temp2), append(Temp1, Temp2, Temp), append(Temp,Tactic5, Lo_lvl). /* some safety plays safety_play(Tactic, Suit, Declarer, DecCards, DumCards, Lo_lvl) */ /* If you are going to cash a suit with 9 cards with 2 winners in one hand and 1 in the other and you can finesse both hands, cash the winner in the hand with two winners */ safety_play(cash, Suit, Declarer, DecCards, [_|DumCards], DecCards1, DumCards, [cash(1, Suit, Dummy)]) ::- length(DecCards, L1), length([_|DumCards], L2), 9 is L1 + L2, analysis(Suit, Analysis), member(sim_fin_dum(_,_,_,_,_,_),Analysis), member(sim_fin_dec(_,_,_,_,_,_),Analysis), member(entries(1,2),Analysis), !, partner(Declarer,Dummy), delete_lowest(DecCards,DecCards1). /* If you are going to cash a suit with 9 cards, with 2 winners in one hand and 1 in the other and you can double finesse the first hand, cash the winner in hand with one winner */ safety_play(cash, Suit, DecCards, [_|DumCards], Declarer, DecCards1, DumCards, [cash(1, Suit, Dummy)]) ::- length(DecCards, L1), length([_|DumCards], L2), 9 is L1 + L2, analysis(Suit, Analysis), member(dbl2_fin_dec(_,_,_,_,_,_),Analysis), member(entries(1,2),Analysis), !, partner(Declarer,Dummy), delete_lowest(DecCards,DecCards1). /* Generalized Safety Play for something like A,10,x,x vs K,Q,x,x If you are going to cash a suit with a finesse in one hand, cash the winners in the other hand first */ safety_play(cash, Suit, DecCards, [_|DumCards], Declarer, DecCards1, DumCards, [cash(1, Suit, Dummy)]) ::- analysis(Suit, Analysis), member(sim_fin_dec(_,_,_,_,_,_),Analysis), member(entries(_,N),Analysis), !, N > 0, partner(Declarer,Dummy), delete_lowest(DecCards,DecCards1). /* One example of splice plan splice(+Lo_lvl, +Declarer, -Dec_Entries, -Dum_Entries) */ /* A cash followed by a finesse in the same hand cannot be done without finding an entry back to the other hand first */ splice([cash(_,_,Declarer),finesse(_,_,Declarer)|Actions], Declarer, DecEnts, DumEnts1) ::- splice([finesse(_,_,Declarer)|Actions], Declarer, DecEnts, DumEnts), DumEnts1 is DumEnts + 1. /* File - exec_mon.pl */ /* Choose tactic from plan to execute choose_tactic(+Leader, +LeadSuit, +Plan, -Tactic, -RemainingPlan) */ /* if declarer is on lead then choose first legal tactic we must be in the other hand for a finesse or duck with void opposite */ choose_tactic(Leader, LeadSuit, Plan, Tactic, Plan1) ::- var(LeadSuit), delete(Tactic, Plan, Plan1), ( functor(Tactic, duck, Leader) ; functor(Tactic,finesse,_), arg(3,Tactic,Player), partner(Leader,Player) ). /* For all other tactics we can be in any hand */ choose_tactic(_Leader, LeadSuit, Plan, Tactic, Plan1) ::- var(LeadSuit), delete(Tactic, Plan, Plan1). /* if defender is on lead then choose first tactic in their suit*/ choose_tactic(_Leader, LeadSuit, Plan, Tactic, Plan1) ::- delete(Tactic, Plan, Plan1), arg(2, Tactic, LeadSuit). /* Depending on the tactic, choose the card to play tactic_card(+Tactic, +Contract, +Player, +Cards, +DecSuit1, +DecSuit2, +DefSuit, -Card) Player is who is playing, and Cards are cards that have been played DecSuit1 is the hand to play, DecSuit2 is partner's hand */ /* Some examples of the cash tactic */ /* Only 1 player has winner */ tactic_card(cash(_, Suit, anyone), _, _, _, [Card|_], [Card1|_], DefSuit, card(Suit,Card)) ::- defenders_highest(DefSuit,H), Card > H, Card1 < H. /* If both player have winners, play winner from shorter hand */ tactic_card(cash(_,Suit,anyone), _, _, _, [Card|DecSuit1], [Card1|DecSuit2], DefSuit, card(Suit,Card)) ::- defenders_highest(DefSuit,H), Card > H, Card1 > H, length(DecSuit1, L1), length(DecSuit2, L2), L1 < L2. /* else play small */ tactic_card(cash(_,Suit,anyone), _, _, _, DecSuit1, _, _, card(Suit,Card)) ::- append(_,[Card],DecSuit1). /* If winner has been chosen */ tactic_card(cash(_,Suit,Player), _, Player, [C1,_,C3], DecSuit1, _, _,card(Suit,Card)) ::- defenders_highest(Suit, C1, C3, C), win_cheaply(DecSuit1,C,Card). /* Example of the duck tactic */ tactic_card(duck(_,Suit,_), _, _, _, DecSuit1, _, _,card(Suit,Card)) ::- append(_,[Card],DecSuit1). /* Some examples of the develop tactic */ /* In fourth seat play small if Defenders win trick */ tactic_card(develop(_,Suit,_), _, _, [C1,C2,C3], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- ( ( higher(Suit, C1, card(Suit,Card1)), higher(Suit, C1, C2) ) ; ( higher(Suit, C3, card(Suit,Card1)), higher(Suit, C3, C2) ) ), !, append(_,[Card],[Card1|DecSuit1]). /* In third seat play highest if Defender and Partner play small */ tactic_card(develop(_,Suit,_), _, _, [card(Suit,C1),_], [Card1|_], _, Def, card(Suit,Card1)) ::- number_higher([Card1], Def, NH1), number_higher([C1], Def, NH2), NH1 < NH2, !. /* finesse 1st Seat - play hnw if finesse card only in this hand */ tactic_card(finesse(_, Suit, Player), _, Partner, [], DecSuit1, DecSuit2, [Highest|DefSuit], card(Suit,HNW1)) ::- partner(Player, Partner), highest_non_winner(DecSuit1,Highest,HNW1), highest_non_winner(DecSuit2,Highest,HNW2), number_higher([HNW1],[Highest|DefSuit], N1), number_higher([HNW2],[Highest|DefSuit], N2), N1 < N2, !. /* play high if defender played finesse card */ tactic_card(finesse(_, Suit,Player), _, Player, [card(Suit,Card)|_], [Card1|DecSuit1], DecSuit2, [Highest|_], card(Suit,Card1)) ::- highest_non_winner([Card1|DecSuit1], Highest, HNW1), highest_non_winner(DecSuit2, Highest, HNW2), HNW1 < Card, HNW2 < Card, Card1 > Card, !. /* finesse 2st Seat - play hnw if finesse card only in this hand and led low*/ tactic_card(finesse(_,Suit,_), _, _, [card(Suit,Card)], DecSuit1, DecSuit2, [Highest|DefSuit], card(Suit,HNW1)) ::- highest_non_winner(DecSuit1,Highest,HNW1), highest_non_winner(DecSuit2,Highest,HNW2), number_higher([HNW1],[Highest|DefSuit], N1), number_higher([HNW2],[Highest|DefSuit], N2), HNW1 > Card, N1 < N2. /* 3rd Seat - play hnw if finesse card in this hand and defender follows low */ tactic_card(finesse(_,Suit,Player), _, Player, [_, card(Suit,Card)], DecSuit, _, [Highest|DefSuit], card(Suit,HNW1)) ::- highest_non_winner(DecSuit,Highest,HNW1), number_higher([HNW1],[Highest|DefSuit], N1), number_higher([Card],[Highest|DefSuit], N2), N1 < N2. /* Check to see whtehr the plan has failed check_plan(+Contract, +WinSuit, +Side, +Winner, +Tactic) */ /* For example, a required finesse has failed */ check_plan(_, Suit, defender, _, Action) ::- finesseable(Action), plan(_, Reqs), Req =.. [Suit, finesse], member(Req, Reqs), !, fail. /* INPUTS 1) Declarer, Dummy and Outstanding Cards 2) contract(level, suit) 3) won(number_of_tricks) 4) in_hand(Hand), 5) For each Suit the following analysis - tricks([Tactic(CT, UT, PT, CD, UD, PD)|Other_Tactics]) tactic = cash|entries|sim_fin_dec|sim_fin_dum|rev_fin_dec|rev_fin_dum| dbl1_fin_dec|dbl1_fin_dum|dbl2_fin_dec|dbl2_fin_dum C/U/P = certain/usual/possible; T/D = Top/Developed; cash and entries tactic is always included, others will be included only if applicable - PUP Trump Winners - how many tricks can be made by trumping (PUP-TW) - entries(Dec, Dum), 6) Accumulated Defender's data Three levels of making a plan 1) first use heuristics to find a "good" selection of tactics in each suit 2) organize which suits to play in which order by a set of rules 3) break down how many tricks to cash in each suit i.e many problem of communications 1) Done!! 2) List of Rules - partial list for NT follows - In NT trick is to count number of winners - Develop longest suit first - If 2 suits equal length develop one with most outside loosers 3) Is the hardest. Take care of the following 1) Do we need to get to a different hand to cash a winner 2) Do we need to get to a different hand in order to trump 3) Do we need to get to a diffent hand to finesse (maybe finesse needs to be repeated - A,Q,J op. x,x versus A,Q,x op x,x, etc.) For each tactic keep eye out for good and bad unexpected list of things that happen. If so - backtrack. */ strategy(_, Contract, Winners, Analysis, Leader, LeadSuit, [BestPlan|OtherPlans]) ::- simplify(Analysis,S,H,D,C), rm_inferior(S, S1), member(cash(_,W1), S1), ( not(clause(winners(spades,_),_)), assert(winners(spades,W1)) ; true ), rm_inferior(H, H1), member(cash(_,W2), H1), ( not(clause(winners(hearts,_),_)), assert(winners(hearts,W2)) ; true ), rm_inferior(D, D1), member(cash(_,W3), D1), ( not(clause(winners(diamonds,_),_)), assert(winners(diamonds,W3)) ; true ), rm_inferior(C, C1), member(cash(_,W4), C1), ( not(clause(winners(clubs,_),_)), assert(winners(clubs,W4)) ; true ), setof(Plan,strategy1(_, Contract, Winners, S1, H1, D1, C1, Plan), Plans), order_plans(Plans, Contract, Leader, LeadSuit, [Plan1|Plans1]), !, enhance_plan(Plan1, Plans1, BestPlan, OtherPlans). strategy(_, _, _, Analysis, _, _, [(999, [spades(T1, P1, W1), hearts(T2, P2, W2), diamonds(T3, P3, W3), clubs(T4, P4, W4)])]) ::- format("No good plan found!!! - going with this~n",[]), simplify(Analysis,S,H,D,C), maximize(S, T1, P1, W1), maximize(H, T2, P2, W2), maximize(D, T3, P3, W3), maximize(C, T4, P4, W4). strategy1(_Hand,contract(Level, _, _), winners(Won, Lost), S, H, D, C, [spades(S1, Prob1, W1), hearts(H1, Prob2, W2), diamonds(D1, Prob3, W3), clubs(C1, Prob4, W4)]) ::- num_tricks(S, S1, T1, Prob1, W1, Win1), num_tricks(H, H1, T2, Prob2, W2, Win2), num_tricks(D, D1, T3, Prob3, W3, Win3), num_tricks(C, C1, T4, Prob4, W4, Win4), Win1 + Win2 + Win3 + Win4 >= Level + 6 - Won, number_of_actions(_,_,_,N), losers(T1, L1), losers(T2, L2), losers(T3, L3), losers(T4, L4), %format("Check ~p ~p ~p ~p~n" , [T1, T2, T3, T4]), 13 >= Win1 + Win2 + Win3 + Win4 + L1 + L2 + L3 + L4 + N, L1 + L2 + L3 + L4 =< Lost + 13 - Level - 6. %format("Found ~p ~p ~p ~p~n" , [T1, T2, T3, T4]). %format("Too many losers ~p ~p ~p ~p~n" , [T1, T2, T3, T4]), fail). requirements(Prob,Plan) ::- suit_reqs(Plan,Reqs), format("Required Plan (~p) ~p Reqs ~p~n",[Prob,Plan,Reqs]), assert(plan((Prob,Plan),Reqs)). suit_reqs([],[]). /* suit_reqs([HLT|HLTs],[Req|Reqs]) ::- arg(1,HLT,Tactic), (Tactic = dbl1_fin_dec, Fin = dbl1_dec; Tactic = dbl1_fin_dum, Fin = dbl1_dum), !, functor(HLT, Suit, _), functor(Req, Suit, 1), arg(1, Req, Fin), !, suit_reqs(HLTs,Reqs). */ suit_reqs([HLT|HLTs],[Req1,Req2|Reqs]) ::- arg(1,HLT,Tactic), finesseable(Tactic), dev_name(_,Tactic), arg(2,HLT,Prob), Prob \== cert, functor(HLT,Suit,_), functor(Req1,Suit,1), arg(1,Req1,finesse), functor(Req2,Suit,1), arg(1,Req2,Prob), !, suit_reqs(HLTs,Reqs). suit_reqs([HLT|HLTs],[Req1|Reqs]) ::- arg(1,HLT,Tactic), finesseable(Tactic), functor(HLT,Suit,_), functor(Req1,Suit,1), arg(1,Req1,finesse), !, suit_reqs(HLTs,Reqs). suit_reqs([HLT|HLTs],[Req1|Reqs]) ::- functor(HLT,Suit,_), arg(2,HLT,Prob), Prob \== cert, functor(Req1,Suit,1), arg(1,Req1,Prob), !, suit_reqs(HLTs,Reqs). suit_reqs([_|HLTs],Reqs) ::- suit_reqs(HLTs,Reqs). maximize([Tactic],T, P, W) ::- functor(Tactic,T,_), arg(1,Tactic,P), arg(2,Tactic,W). maximize([Tactic|Tactics],T,P,W) ::- maximize(Tactics, _, _,W1), arg(2,Tactic,W), W > W1, !, arg(1,Tactic,P), functor(Tactic,T,_). maximize([_|Tactics],T,P,W) ::- maximize(Tactics,T,P,W). rm_inferior(Suit,Suit1) ::- rm_inferior(Suit,[],Suit1). rm_inferior([],Suit,Suit). rm_inferior([rev_fin_dec(_,_)|Tactics],SoFar,BTactics) ::- ( member(sim_fin_dum(_,_),Tactics) ; member(sim_fin_dum(_,_),SoFar) ), !, rm_inferior(Tactics,SoFar,BTactics). rm_inferior([rev_fin_dum(_,_)|Tactics],SoFar,BTactics) ::- ( member(sim_fin_dec(_,_),Tactics) ; member(sim_fin_dec(_,_),SoFar) ), !, rm_inferior(Tactics,SoFar,BTactics). rm_inferior([sim_fin_dec(Prob,Tricks)|Tactics],SoFar,BTactics) ::- ( member(sim_fin_dum(Prob,T1),Tactics), T1 > Tricks ; member(sim_fin_dum(Prob,T2),SoFar), T2 > Tricks ), !, rm_inferior(Tactics,SoFar,BTactics). rm_inferior([sim_dfin_dec(Prob,Tricks)|Tactics],SoFar,BTactics) ::- ( member(sim_fin_dum(Prob,T1),Tactics), T1 > Tricks ; member(sim_fin_dum(Prob,T2),SoFar), T2 > Tricks ), !, rm_inferior(Tactics,SoFar,BTactics). rm_inferior([sim_fin_dum(Prob,Tricks)|Tactics],SoFar,BTactics) ::- ( member(sim_fin_dec(Prob,T1),Tactics), T1 > Tricks ; member(sim_fin_dec(Prob,T2),SoFar), T2 > Tricks ), !, rm_inferior(Tactics,SoFar,BTactics). rm_inferior([sim_dfin_dum(Prob,Tricks)|Tactics],SoFar,BTactics) ::- ( member(sim_fin_dec(Prob,T1),Tactics), T1 > Tricks ; member(sim_fin_dec(Prob,T2),SoFar), T2 > Tricks ), !, rm_inferior(Tactics,SoFar,BTactics). rm_inferior([Tactic|Tactics], SoFar, BTactics) ::- rm_inferior(Tactics,[Tactic|SoFar],BTactics). num_tricks([Tactic|_], Name, Tactic, Prob, Win+Dev-Losers, Win+Dev) ::- functor(Tactic,Name,_), arg(1,Tactic,Prob), arg(2,Tactic,Win+Dev-Losers). num_tricks([Tactic|_], Name, Tactic, Prob, Tricks, Tricks) ::- functor(Tactic,Name,_), arg(1,Tactic,Prob), arg(2,Tactic,Tricks), integer(Tricks). num_tricks([_|Tactics], Name, Tactic, Prob, Tricks, Winners) ::- num_tricks(Tactics, Name, Tactic, Prob, Tricks, Winners). losers(cash(_,_),0) ::- !. losers(sim_fin_dec(_,_),0) ::- !. losers(sim_fin_dum(_,_),0) ::- !. losers(sim_dfin_dec(_,_+_-L),L) ::- !. losers(sim_dfin_dum(_,_+_-L),L) ::- !. losers(dbl2_fin_dec(_,W),L) ::- L is 2 - W, L > 0, !. losers(dbl2_fin_dum(_,W),L) ::- L is 2 - W, L > 0, !. losers(dbl2_fin_dec(_,_),0) ::- !. losers(dbl2_fin_dum(_,_),0) ::- !. losers(dbl1_fin_dec(_,_),1) ::- !. losers(dbl1_fin_dum(_,_),1) ::- !. losers(dbl1_dfin_dec(_,_),2) ::- !. losers(dbl1_dfin_dum(_,_),2) ::- !. losers(develop(_,_+_-L),L) ::- !. simplify(analysis(S,H,D,C),SSimp,HSimp,DSimp,CSimp) ::- simplify_suit(S,SSimp), simplify_suit(H,HSimp), simplify_suit(D,DSimp), simplify_suit(C,CSimp). simplify_suit(analysis(_Suit, Tactics), Tactics1) ::- simplify_tactics(Tactics, Tactics1), !. simplify_suit(Tactics, Tactics1) ::- simplify_tactics(Tactics, Tactics1). simplify_tactics([Tactic|Tactics],STactics1) ::- simplify_tactic(Tactic,STactic), simplify_tactics(Tactics,STactics), append(STactic,STactics,STactics1). simplify_tactics([],[]). order_plans([], _, _, _, []). order_plans([Plan|Plans], Contract, Leader, LeadSuit, OPlans) ::- plan_value(Plan, Contract, Leader, LeadSuit, V1), !, %format("Plan = ~p/~p ~n", [Plan, V1]), partition(Plans, Contract, Leader, LeadSuit, V1, Littles, Bigs), order_plans(Littles, Contract, Leader, LeadSuit, Ls), order_plans(Bigs, Contract, Leader, LeadSuit, Bs), append(Ls,[(V1,Plan)|Bs],OPlans). order_plans([_|Plans], Contract, Leader, LeadSuit, OPlans) ::- order_plans(Plans, Contract, Leader, LeadSuit, OPlans). partition([Plan|Plans], Contract, Leader, LeadSuit, V1, [Plan|Ls], Bs) ::- plan_value(Plan, Contract, Leader, LeadSuit, V), %format("Plan = ~p/~p ~n", [Plan, V]), V < V1, !, partition(Plans, Contract, Leader, LeadSuit, V1, Ls, Bs). partition([Plan|Plans], Contract, Leader, LeadSuit, V1, Ls, [Plan|Bs]) ::- %plan_value(Plan, Contract, Leader, LeadSuit, V), %format("Plan = ~p/~p ~n", [Plan, V]), partition(Plans, Contract, Leader, LeadSuit, V1, Ls, Bs). partition([], _, _, _, _, [], []). plan_value([], _, _, _, 1). plan_value([Tactic|Tactics], Contract, Leader, LeadSuit, PV) ::- suit_value(Tactic, Contract, Leader, LeadSuit, SV), plan_value(Tactics, Contract, Leader, LeadSuit, PVs), PV is SV * PVs. suit_value(Tactic, Contract, Leader, LeadSuit, TV) ::- tactic_value(Tactic, Contract, Leader, LeadSuit, V1), !, prob_value(Tactic, V2), TV is V1 * V2. enhance_plan(Plan, [], Plan, []) ::- !. enhance_plan((V, Plan), [(V1, Plan1)|Plans], BestPlan, [(V,Plan)|OtherPlans]) ::- better_tactics(Plan1, Plan), !, %format("Plan = ~p, BPlan = ~p~n",[Plan, Plan1]), enhance_plan((V1,Plan1), Plans, BestPlan, OtherPlans). enhance_plan(Plan, [Plan1|Plans], BestPlan, [Plan1|OtherPlans]) ::- enhance_plan(Plan, Plans, BestPlan, OtherPlans). better_tactics([],[]) ::- !. better_tactics([Tactic|Tactics1],[Tactic|Tactics]) ::- !, better_tactics(Tactics1, Tactics). better_tactics([Tactic1|Tactics1],[Tactic|Tactics]) ::- arg(1, Tactic, Type), arg(1, Tactic1, Type), arg(3, Tactic, W), arg(3, Tactic1, W1), better(W1, W), !, better_tactics(Tactics1, Tactics). better_tactics([Tactic1|Tactics1],[Tactic|Tactics]) ::- arg(1, Tactic, cash), arg(1, Tactic1, develop), arg(3, Tactic, W), arg(3, Tactic1, W1), better(W1, W), !, better_tactics(Tactics1, Tactics). better_tactics([Tactic1|Tactics1],[Tactic|Tactics]) ::- arg(1, Tactic, develop), arg(1, Tactic1, cash), arg(3, Tactic, W), arg(3, Tactic1, W1), better(W1, W), !, better_tactics(Tactics1, Tactics). better_tactics([Tactic1|Tactics1],[Tactic|Tactics]) ::- ( arg(1, Tactic, cash) ; arg(1, Tactic, develop) ), arg(1, Tactic1, Fin), finesseable(Fin), arg(3, Tactic, W), arg(3, Tactic1, W1), better(W1, W), !, better_tactics(Tactics1, Tactics). better(W1+W2-_,W3+W4-_) ::- W1 + W2 > W3 + W4. better(W1+W2-_,W3+W4-_) ::- W1 + W2 = ::= W3 + W4, W1 > W3. better(W1,W2+W3-_) ::- W1 > W2 + W3. better(W1+W2-_,W) ::- W1 + W2 > W. better(N2,N1) ::- N2 > N1. %tactic_value(Tactic, Contract, Leader, LeadSuit, V1), !, tactic_value(Tactic, _,_, _, 1) ::- %(arg(1, Tactic, develop); arg(1, Tactic, cash)), !. tactic_value(Tactic, contract(_,_,Dec), _, _, 1) ::- ( arg(1,Tactic,sim_fin_dec) ; arg(1,Tactic,dbl1_fin_dec) ; arg(1,Tactic,dbl2_fin_dec) ), functor(Tactic, Suit,_), next_play(Dec,Next), Known =.. [Suit,void,Next], clause(known(Known),_), !. tactic_value(Tactic, contract(_,_,Dec), _, _, 1) ::- ( arg(1,Tactic,sim_fin_dum) ; arg(1,Tactic,dbl1_fin_dum) ; arg(1,Tactic,dbl2_fin_dum) ), functor(Tactic, Suit, _), next_play(Next,Dec), Known =.. [Suit,void,Next], clause(known(Known),_), !. tactic_value(Tactic, contract(_,_,Dec), _, _, 999) ::- ( arg(1,Tactic,sim_fin_dec) ; arg(1,Tactic,dbl1_fin_dec) ; arg(1,Tactic,dbl2_fin_dec) ), functor(Tactic, Suit,_), next_play(Next,Dec), Known =.. [Suit,void,Next], clause(known(Known),_), !, fail. tactic_value(Tactic, contract(_,_,Dec), _, _, 999) ::- ( arg(1,Tactic,sim_fin_dum) ; arg(1,Tactic,dbl1_fin_dum) ; arg(1,Tactic,dbl2_fin_dum) ), functor(Tactic, Suit, _), next_play(Dec,Next), Known =.. [Suit,void,Next], clause(known(Known),_), !, fail. tactic_value(Tactic, contract(_,_,Dec), Leader, LeadSuit, V) ::- ( arg(1, Tactic, sim_fin_dec), !, ( functor(Tactic,LeadSuit,_), next_play(Dec, Leader), functor(Tactic, Suit,_), winners(Suit, W1), arg(3,Tactic,W2), W2 is W1 + 1, V = 1 ; V = 2 ) ) ; ( arg(1, Tactic, sim_fin_dum), !, ( functor(Tactic,LeadSuit,_), next_play(Leader, Dec), functor(Tactic, Suit,_), winners(Suit, W1), arg(3, Tactic, W2), W2 is W1 + 1, V = 1 ; V = 2 ) ). tactic_value(Tactic, _, _, _, 2) ::- arg(1, Tactic, sim_dfin_dec) ; arg(1, Tactic, sim_dfin_dum) ; arg(1, Tactic, rev_fin_dec) ; arg(1, Tactic, rev_fin_dum) ; arg(1, Tactic, rev_dfin_dec) ; arg(1, Tactic, rev_dfin_dum). tactic_value(Tactic, contract(_,_,Dec), Leader, LeadSuit, V) ::- ( ( arg(1, Tactic, dbl1_fin_dec) ; arg(1, Tactic, dbl1_dfin_dec) ), !, ( functor(Tactic,LeadSuit,_), next_play(Dec, Leader), V = 1 ; V = 4/3) ) ; ( ( arg(1, Tactic, dbl1_fin_dum) ; arg(1, Tactic, dbl1_dfin_dum) ), !, ( functor(Tactic,LeadSuit,_), next_play(Leader, Dec), V = 1 ; V = 4/3 ) ). tactic_value(Tactic, contract(_,_,Dec), Leader, LeadSuit, V) ::- ( ( arg(1, Tactic, dbl2_fin_dec) ; arg(1, Tactic, dbl2_dfin_dec) ), !, ( functor(Tactic,LeadSuit,_), next_play(Dec, Leader), V = 2 ; V = 4 ) ) ; ( ( arg(1, Tactic, dbl2_fin_dum) ; arg(1, Tactic, dbl2_dfin_dum) ), !, ( functor(Tactic,LeadSuit,_), next_play(Leader, Dec), V = 2 ; V = 4 ) ). %prob_value(Tactic, V2), prob_value(Tactic, 999) ::- functor(Tactic,Suit,_), arg(2,Tactic,Prob), Failed =.. [Suit,Prob], clause(failed(Failed),_), !, fail. prob_value(Tactic, 1) ::- arg(2,Tactic,cert), !. prob_value(Tactic, 3/2) ::- arg(2,Tactic,usual), !. prob_value(Tactic, 3) ::- arg(2,Tactic,pos), !. simplify_tactic(entries(_,_),[]) ::- !. simplify_tactic(Tactic,STactic) ::- arg(1,Tactic,C), arg(2,Tactic,U), arg(3,Tactic,P), arg(4,Tactic,CD), arg(5,Tactic,UD), arg(6,Tactic,PD), remove_multiples([cert,C,usual,U,pos,P],Cash), functor(Tactic,Name,_), new_tactic(Name,Cash,Cash1), dev_name(Name,DevName), simplify_dev([C,U,P],[CD,UD,PD],Dev), remove_multiples(Dev,Dev1), new_tactic(DevName,Dev1,NDev1), append(Cash1,NDev1,STactic). remove_multiples([],[]) ::- !. remove_multiples([Prob1,Pot1],[Prob1,Pot1]) ::- !. remove_multiples([Prob1,Pot1,_,Pot1],[Prob1,Pot1]) ::- !. remove_multiples([Prob1,Pot1,Prob2,Pot2],[Prob1,Pot1,Prob2,Pot2]) ::- !. remove_multiples([Prob1,Pot1,_,Pot1,_,Pot1],[Prob1,Pot1]) ::- !. remove_multiples([Prob1,Pot1,Prob2,Pot2,_,Pot2],[Prob1,Pot1,Prob2,Pot2]) ::-!. remove_multiples([Prob1,Pot1,_,Pot1,Prob3,Pot3],[Prob1,Pot1,Prob3,Pot3]) ::-!. remove_multiples(Tricks,Tricks). new_tactic(_,[],[]). new_tactic(Name,[Prob,Pot|Tricks], [New_Tactic|Tricks1]) ::- functor(New_Tactic,Name,2), arg(1,New_Tactic,Prob), arg(2,New_Tactic,Pot), new_tactic(Name,Tricks,Tricks1). simplify_dev([C,U,P],[CD,UD,PD],[cert,CD1|Dev]) ::- win_lose(CD,W,L), W > C, !, W1 is W - C, win_lose(CD1,C+W1,L), simplify_dev([U,P],[UD,PD],Dev). simplify_dev([U,P],[UD,PD],[usual,UD1|Dev]) ::- win_lose(UD,W,L), W > U, !, W1 is W - U, win_lose(UD1,U+W1,L), simplify_dev([P],[PD],Dev). simplify_dev([P],[PD],[pos,PD1]) ::- win_lose(PD,W,L), W > P, !, W1 is W - P, win_lose(PD1,P+W1,L). simplify_dev([_|W],[_|D],Dev) ::- simplify_dev(W, D, Dev). simplify_dev([],[],[]). %win_lose(W-L,W1+W2,L) ::- var(W), W is W1 + W2, !. win_lose(W-L,W,L) ::- !. %win_lose(W,W1+W2,0) ::- var(W), W is W1 + W2, !. win_lose(W,W,0) ::- !. dev_name(cash,develop). dev_name(sim_fin_dec,sim_dfin_dec). dev_name(sim_fin_dum,sim_dfin_dum). dev_name(rev_fin_dec,rev_dfin_dec). dev_name(rev_fin_dum,rev_dfin_dum). dev_name(dbl1_fin_dec,dbl1_dfin_dec). dev_name(dbl1_fin_dum,dbl1_dfin_dum). dev_name(dbl2_fin_dec,dbl2_dfin_dec). dev_name(dbl2_fin_dum,dbl2_dfin_dum). finesseable(sim_fin_dec) ::- !. finesseable(sim_fin_dum) ::- !. finesseable(rev_fin_dec) ::- !. finesseable(rev_fin_dum) ::- !. finesseable(dbl1_fin_dec) ::- !. finesseable(dbl1_fin_dum) ::- !. finesseable(dbl2_fin_dec) ::- !. finesseable(dbl2_fin_dum) ::- !. finesseable(sim_dfin_dec) ::- !. finesseable(sim_dfin_dum) ::- !. finesseable(rev_dfin_dec) ::- !. finesseable(rev_dfin_dum) ::- !. finesseable(dbl1_dfin_dec) ::- !. finesseable(dbl1_dfin_dum) ::- !. finesseable(dbl2_dfin_dec) ::- !. finesseable(dbl2_dfin_dum) ::- !. better_to_develop(N1,N1,N1,N1,_,N2-_,_) ::- N2 > N1, !. better_to_develop(N1,N1,_,_,N2-_,_,_) ::- N2 > N1, !. better_to_develop(N1,_,N1,_,_,N2-_,_) ::- N2 > N1, !. better_to_develop(N1,_,_,N1,_,_,N2-_) ::- N2 > N1, !. create_hand(Hand) ::- write_deal(Hand), curpos(1,24), choose_hand(Hand). choose_hand(Hand) ::- format("Choose player :: ",[]), read_line([P|_]), name(Initial, [P]), make_hand(Initial, Hand). make_hand(q,Hand) ::- !, write_hand(Hand). make_hand(r,Hand) ::- !, create_hand(Hand). make_hand(Initial,Hand) ::- player_initial(Player,Initial), !, choose_suit(Player,Hand, s). make_hand(_,Hand) ::- format("Type in player [n,s,e,w] or [q] to write hand or [r] to redraw~n",[]), !, choose_hand(Hand). choose_suit(Player,Hand, Init) ::- suit_initial(SName, Init), format("Choose suit (~p) :: ",[SName]), read_line(Suit), get_initial(Init, Suit, Initial), !, make_suit(Initial,Player,Hand). make_suit(p,_,Hand) ::- !, choose_hand(Hand). make_suit(q,_,Hand) ::- !, choose_hand(Hand). make_suit(Initial, Player, Hand) ::- suit_initial(Suit, Initial), !, format("Type in cards :: ",[]), get_cards(Cards,Initial,Player,Hand), update(Hand,Cards,Suit,Player,Hand1), co_ordinates(Player,X,Y,_,_), update_x(X,X1), update_y(Y,Suit,Y1), cards_in_box(Cards,X1,Y1,Suit), curpos(1,24), next_suit(Suit, NSuit), suit_initial(NSuit, NInitial), choose_suit(Player,Hand1, NInitial). make_suit(_,Player,Hand) ::- format("Type in a suit [s,h,d,c] or [p/q] to choose new player~n",[]), !, choose_suit(Player,Hand, s). write_hand(hand(N,S,E,W)) ::- check_hand(hand(N,S,E,W)), !, format("Give hand I.D. number :: ",[]), read_line(Cs), name(ID,Cs), format("This hand is recorded as ~p~n",[ID]), open('eg.pl',append,Stream), format(Stream,"~p ::- play_hand(hand(~n",[ID]), write_suits(N,S,E,W,Stream), flush_output(Stream), close(Stream). write_hand(Hand) ::- choose_hand(Hand). write_suits([N1,N2,N3,N4],[S1,S2,S3,S4],[E1,E2,E3,E4],[W1,W2,W3,W4],Stream) ::- format(Stream,"[~p,~p,~n~p,~p],~n",[N1,N2,N3,N4]), format(Stream,"[~p,~p,~n~p,~p],~n",[S1,S2,S3,S4]), format(Stream,"[~p,~p,~n~p,~p],~n",[E1,E2,E3,E4]), format(Stream,"[~p,~p,~n~p,~p])).~n~n",[W1,W2,W3,W4]). get_initial(Init, [], Init). get_initial(_,[S|_], Initial) ::- name(Initial,[S]). get_cards(Cards,_,_,_) ::- read_line(L), cards(Unsorted,L), !, sort(Unsorted,Sorted), reverse(Sorted,Cards). get_cards(_,Initial,Player,Hand) ::- format("Illegal card selection~n",[]), make_suit(Initial,Player,Hand). cards([],[]) ::- !. cards(Cards,[32|Ls]) ::- !, cards(Cards,Ls). cards([VCard|VCards],[L|Ls]) ::- name(Card,[L]), value(Card,VCard), cards(VCards,Ls). update(Hands,Cards,Suit,Player,Hands1) ::- components(Hands,Player,Hand,Others), replace_suit(Hand,Suit,Cards,Hand1), components(Hands1,Player,Hand1,Others). replace_suit([suit(_,Suit,_)|Rest],Suit,Cards,[suit(L,Suit,Cards)|Rest]) ::- !, length(Cards,L). replace_suit([Suit|Suits],SuitName,Cards,[Suit|Suits1]) ::- replace_suit(Suits,SuitName,Cards,Suits1). components(hand(N,S,E,W),north,N,[S,E,W]). components(hand(N,S,E,W),south,S,[N,E,W]). components(hand(N,S,E,W),west,W,[N,E,S]). components(hand(N,S,E,W),east,E,[N,W,S]). add_cards(Hand,[Card|Cards],Suit,Hand1) ::- add_card(Hand,card(Suit,Card),NewHand), add_cards(NewHand,Cards,Suit,Hand1). add_cards(Hand1,[],_,Hand1). check_hand(hand(N,S,E,W)) ::- merge(N,S,E,W,_). merge([suit(_,Suit,Cards1)|Rest1],[suit(_,_,Cards2)|Rest2], [suit(_,_,Cards3)|Rest3],[suit(_,_,Cards4)|Rest4], [suit(L,Suit,Cards)|Rest]) ::- merge_suit(Suit,Cards1,Cards2,Cards3,Cards4,Cards), length(Cards,L), merge(Rest1,Rest2,Rest3,Rest4,Rest). merge([],[],[],[],[]). merge_suit(Suit,C1,C2,C3,C4,C) ::- merge(Suit,C1,C2,C12), merge(Suit,C3,C4,C34), merge(Suit,C12,C34,C). merge(Suit,[X|_],[X|_],_) ::- !, format("Illegal Hand. The ~p of ~p appears twice~n",[X,Suit]), fail. merge(Suit,[X|Xs],[Y|Ys],[X|Zs]) ::- X > Y, !, merge(Suit,Xs,[Y|Ys],Zs). merge(Suit,[X|Xs],[Y|Ys],[Y|Zs]) ::- Y > X, !, merge(Suit,[X|Xs],Ys,Zs). merge(_,Xs,[],Xs) ::- !. merge(_,[],Ys,Ys). /* ================================================================== */ /* facts.pl */ /* */ /* Miscellaneous Bridge Facts */ /* */ /* Author - Yossi Nygate */ /* Last Modified - October 30, 1988. */ /* ================================================================== */ /* Predicates list :: predicate name number of arguments -------------- ------------------- suits 1 suit_initial 2 player_initial 2 next_play 2 pack 1 */ suits([spades,hearts,diamonds,clubs]). suit_initial(spades,s). suit_initial(diamonds,d). suit_initial(hearts,h). suit_initial(clubs,c). suit_initial(notrumps,n). player_initial(north,n). player_initial(south,s). player_initial(east,e). player_initial(west,w). next_play(south,west). next_play(west,north). next_play(north,east). next_play(east,south). next_suit(spades, hearts). next_suit(hearts, diamonds). next_suit(diamonds, clubs). next_suit(clubs, spades). pack([suit(13,spades,[14,13,12,11,10,9,8,7,6,5,4,3,2]), suit(13,hearts,[14,13,12,11,10,9,8,7,6,5,4,3,2]), suit(13,diamonds,[14,13,12,11,10,9,8,7,6,5,4,3,2]), suit(13,clubs,[14,13,12,11,10,9,8,7,6,5,4,3,2])]). value('A',14) ::- !. value('K',13) ::- !. value('Q',12) ::- !. value('J',11) ::- !. value('T',10) ::- !. value('a',14) ::- !. value('k',13) ::- !. value('q',12) ::- !. value('j',11) ::- !. value('t',10) ::- !. value(Value,Value) ::- integer(Value), Value >=2. portray(north) ::- !,write('North'). portray(south) ::- !,write('South'). portray(west) ::- !,write('West'). portray(east) ::- !,write('East'). portray(spades) ::- !, write('Spades'). portray(hearts) ::- !, write('Hearts'). portray(diamonds) ::- !, write('Diamonds'). portray(clubs) ::- !, write('Clubs'). portray(14) ::- write('A'). portray(13) ::- write('K'). portray(12) ::- write('Q'). portray(11) ::- write('J'). portray(10) ::- write('T'). portray(N) ::- integer(N), N < 10, write(N). portray(N) ::- not(integer(N)), write(N). ux ::- unix(shell). ns ::- nospyall. db ::- debug. ndb ::- nodebug. br ::- reconsult(bridge). an ::- reconsult(analysis). sy ::- reconsult(synthesis). pl ::- reconsult(planning). ex ::- reconsult(exec_mon). tr ::- reconsult(trick). rp(N) ::- ndb, name('save/trick',Name), name(N,N1), append(Name,N1,NName), name(File,NName), [File]. sp ::- save_program(aspen). sp(N) ::- save_program(N). tl(N) ::- retract_it(trace_lvl(_)), assert(trace_lvl(N)). not(X) ::- X,!,fail. not(_). %member(X,[X|_]). %member(X,[_|Ys]) ::- member(X,Ys). delete(X,[X|Xs],Xs). delete(X,[X1|Xs],[X1|Xs1]) ::- delete(X,Xs,Xs1). recursive_delete(Elem, [List|Lists], [NList|Lists]) ::- delete(Elem, List, NList). recursive_delete(Elem, [List|Lists], [List|NLists]) ::- recursive_delete(Elem, Lists, NLists). recursive_delete(Elem, List, NList) ::- delete(Elem, List, NList). flatten([],[]). flatten([X|Xs],Flattened) ::- !, flatten(X,FlattenX), flatten(Xs,FlattenXs), append(FlattenX,FlattenXs,Flattened). flatten(X,[X]). reverse(Xs,Ys) ::- reverse(Xs,[],Ys). reverse([X|Xs],Revs,Ys) ::- reverse(Xs,[X|Revs],Ys). reverse([],Ys,Ys). %append([],Ys,Ys). %append([X|Xs],Ys,[X|Zs]) ::- append(Xs,Ys,Zs). merge([],Xs,Xs) ::- !. merge(Xs,[],Xs) ::- !. merge([X|Xs],[Y|Ys],[X|Zs]) ::- X > Y, !, merge(Xs,[Y|Ys],Zs). merge([X|Xs],[Y|Ys],[Y|Zs]) ::- merge([X|Xs],Ys,Zs). max(A, B, A) ::- A >= B, !. max(_, B, B). min(A, B, B) ::- A >= B, !. min(A, _, A). abs(X,X) ::- X > 0, !. abs(X,Y) ::- Y is X * -1. read_atom(Atom) ::- read_line(Line), name(Atom, Line). % Now a built-in in Sicstus 4 %read_line(Line) ::- %get0(C), %read_line(C, Line). % %read_line(10, []) ::- !. % %read_line(C, [C|Cs]) ::- %get0(C2), %read_line(C2, Cs). /* order plan to play in right sequence for now suit with most tricks first */ hi_lvl_plans([],[]) ::- !. hi_lvl_plans([(Prob,Plan)|Plans],HLP) ::- hi_lvl_plan(Plan,HLP), requirements(Prob,HLP), assert_other_plans(Plans). /* hi_lvl_plans([_|Plans],HLP) ::- hi_lvl_plans(Plans,HLP). */ assert_other_plans([Plan|Plans]) ::- assert(other_plans(Plan)), assert_other_plans(Plans). assert_other_plans([]). hi_lvl_plan([Suit],[Suit]) ::- !. hi_lvl_plan(Plan,[Suit|Suits]) ::- best_suit(Plan, Suit, RPlan), hi_lvl_plan(RPlan, Suits). best_suit([Suit], Suit, []) ::- !. best_suit([Suit|Suits], Suit, Suits) ::- best_suit(Suits, Suit1, _), arg(3, Suit, Tricks), functor(Suit,S,_), functor(Suit1,S1,_), number_of_actions(_, _, S, N), number_of_actions(_, _, S1,N1), arg(3, Suit1, Tricks1), num_tricks(Tricks,Val), num_tricks(Tricks1,Val1), Val + N > Val1 + N1, !. best_suit([Suit|Suits], BestSuit, [Suit|RSuits]) ::- best_suit(Suits, BestSuit, RSuits). num_tricks(W1+W2-W3, W) ::- W is W1+W2+W3, !. num_tricks(W, W) ::- !. decompose_and_splice(Tactics, Dec, Dum, Def1, Def2, contract(_, _, Declarer), Lo_lvl) ::- decompose_plan(Tactics, Declarer, Dec, Dum, Def1, Def2, Lo_lvl), (trace_lvl(P), P >= 3, format("Before Splicing ~p~n",[Lo_lvl]); true), flatten(Lo_lvl, Flattened), splice(Flattened, Declarer, DecEnts, DumEnts), format("Entries needed are Dec = ~d Dum = ~d~n",[DecEnts, DumEnts]). %splice_plan(Lo_lvl,Lo_lvl1). decompose_and_splice(_, Dec, Dum, Def1, Def2, contract(_, _, Declarer), Lo_lvl) ::- retract_it(plan(_,_)), other_plans((Prob,Plan)), decompose_plan(Plan, Declarer, Dec, Dum, Def1, Def2, Lo_lvl), (trace_lvl(P), P >= 3, format("Before Splicing ~p~n",[Lo_lvl]); true), flatten(Lo_lvl, Flattened), splice(Flattened, Declarer, DecEnts, DumEnts), format("Entries needed are Dec = ~d Dum = ~d~n",[DecEnts, DumEnts]), requirements(Prob,Plan). %splice_plan(Lo_lvl,Lo_lvl1). splice([_], _, 0, 0). /* two finesses might not need any more entries */ splice([finesse(_,_,_),finesse(_,_,P)|Acts], Declarer, DecEnts, DumEnts) ::- splice([finesse(_,_,P)|Acts], Declarer, DecEnts, DumEnts). splice([cash(_,_,P1),finesse(_,_,P2)|Acts], Declarer, DecEnts, DumEnts) ::- partner(P1,P2), splice([finesse(_,_,P2)|Acts], Declarer, DecEnts, DumEnts). splice([cash(_,_,Declarer),finesse(_,_,Declarer)|Acts], Declarer, DecEnts, DumEnts1) ::- splice([finesse(_,_,Declarer)|Acts], Declarer, DecEnts, DumEnts), DumEnts1 is DumEnts + 1. splice([cash(_,_,Dummy), finesse(_,_,Dummy)|Acts], Declarer, DecEnts1, DumEnts) ::- partner(Declarer, Dummy), splice([finesse(_,_,Dummy)|Acts], Declarer, DecEnts, DumEnts), DecEnts1 is DecEnts + 1. splice([Act1,Act2|Acts], Declarer, DecEnts1, DumEnts) ::- functor(Act1, Func1,_), Func1 \== cash, arg(3,Act2,Declarer), splice([Act2|Acts], Declarer, DecEnts, DumEnts), DecEnts1 is DecEnts + 1. splice([Act1,Act2|Acts], Declarer, DecEnts, DumEnts1) ::- functor(Act1, Func1,_), Func1 \== cash, arg(3,Act2,Dummy), partner(Declarer, Dummy), splice([Act2|Acts], Declarer, DecEnts, DumEnts), DumEnts1 is DumEnts + 1. splice([_,Act|Acts], Declarer, DecEnts, DumEnts) ::- splice([Act|Acts], Declarer, DecEnts, DumEnts). splice_plan(Lo_lvl,Lo_lvl) ::- !. splice_plan(Lo_lvl,RLo_lvl) ::- /* format("Decomposed Plan before Splicing ::~n",[]), write_plan(Lo_lvl), */ fail, splice_plan(Lo_lvl, [], Lo_lvl1), reverse(Lo_lvl1,RLo_lvl). splice_plan(Lo_lvl, _) ::- !, format("Unable to Splice Plan - not enough entries ::~n",[]), write_plan(Lo_lvl), fail. splice_plan([], Sofar, Sofar). splice_plan([Tactic,finesse(Num,Suit,Player)|Lo_lvl], Sofar, Lo_lvl1) ::- arg(3,Tactic,Player), delete(Tactic1,Lo_lvl,Lo_lvls), arg(2,Tactic1, Suit1), arg(3,Tactic1, Player1), Player \== Player1, Suit1 \== Suit, !, splice_plan(Lo_lvls, [finesse(Num,Suit,Player),Tactic1,Tactic|Sofar],Lo_lvl1). splice_plan([Tactic|Lo_lvl], Sofar, Lo_lvl1) ::- splice_plan(Lo_lvl, [Tactic|Sofar], Lo_lvl1). decompose_plan([], _, _, _, _, _, []) ::- !. decompose_plan([STactic|STactics], Declarer, Dec, Dum, Def1, Def2, Decomposed) ::- functor(STactic,Suit,_), get_suit(Dec, Suit, DecCards), get_suit(Dum, Suit, DumCards), get_suit(Def1, Suit, Def1Cards), get_suit(Def2, Suit, Def2Cards), merge(Def1Cards, Def2Cards, Def), arg(1,STactic,Tactic), arg(3,STactic,Winners), decompose_tactic1(Suit, Tactic, Winners, Declarer, DecCards, DumCards, Def, Lo_lvl), decompose_plan(STactics, Declarer, Dec, Dum, Def1, Def2, Lo_lvls), append([Lo_lvl],Lo_lvls,Decomposed), !. safety_play(cash, Suit, DecCards, [_|DumCards], Declarer, [cash(1, Suit, Dummy)], DecCards1, DumCards, 1) ::- length(DecCards, L1), length([_|DumCards], L2), 9 is L1 + L2, %here, analysis(Suit, Analysis), member(sim_fin_dum(_,_,_,_,_,_),Analysis), member(sim_fin_dec(_,_,_,_,_,_),Analysis), member(entries(1,2),Analysis), !, partner(Declarer,Dummy), delete_lowest(DecCards,DecCards1). safety_play(cash, Suit, [_|DecCards], DumCards, Declarer, [cash(1, Suit, Declarer)], DecCards, DumCards1, 1) ::- length([_|DecCards], L1), length(DumCards, L2), 9 is L1 + L2, analysis(Suit, Analysis), member(sim_fin_dum(_,_,_,_,_,_),Analysis), member(sim_fin_dec(_,_,_,_,_,_),Analysis), member(entries(2,1),Analysis), !, delete_lowest(DumCards,DumCards1). safety_play(cash, Suit, DecCards, [_|DumCards], Declarer, [cash(1, Suit, Dummy)], DecCards1, DumCards, 1) ::- length(DecCards, L1), length([_|DumCards], L2), 9 is L1 + L2, analysis(Suit, Analysis), member(dbl2_fin_dec(_,_,_,_,_,_),Analysis), member(entries(1,2),Analysis), !, partner(Declarer,Dummy), delete_lowest(DecCards,DecCards1). safety_play(cash, Suit, [_|DecCards], DumCards, Declarer, [cash(1, Suit, Declarer)], DecCards, DumCards1, 1) ::- length([_|DecCards], L1), length(DumCards, L2), 9 is L1 + L2, analysis(Suit, Analysis), member(dbl2_fin_dum(_,_,_,_,_,_),Analysis), member(entries(1,2),Analysis), !, delete_lowest(DumCards,DumCards1). /* Generalized Safety Play for something like A,10,x,x vs K,Q,x,x */ safety_play(cash, Suit, DecCards, [_|DumCards], Declarer, [cash(1, Suit, Dummy)], DecCards1, DumCards, 1) ::- analysis(Suit, Analysis), member(sim_fin_dec(_,_,_,_,_,_),Analysis), member(entries(_,N),Analysis), !, N > 0, partner(Declarer,Dummy), delete_lowest(DecCards,DecCards1). safety_play(cash, Suit, [_|DecCards], DumCards, Declarer, [cash(1, Suit, Declarer)], DecCards, DumCards1, 1) ::- analysis(Suit, Analysis), member(sim_fin_dum(_,_,_,_,_,_),Analysis), member(entries(N,_),Analysis), !, N > 0, delete_lowest(DumCards,DumCards1). decompose_tactic1(Suit, Tactic, Winners, Declarer, DecCards, DumCards, [Highest|DefCards], Lo_lvl) ::- length(DecCards, L1), length(DumCards, L2), length([Highest|DefCards], L3), 13 is L1 + L2 + L3, safety_play(Tactic, Suit, DecCards, DumCards, Declarer, Lo_lvl1, DecCards1, DumCards1, Num), !, Winners1 is Winners - Num, decompose_tactic(Suit, Tactic, Winners1, Declarer, DecCards1, DumCards1, Highest, Lo_lvls), append(Lo_lvl1,Lo_lvls,Lo_lvl). decompose_tactic1(Suit, Tactic, Winners, Declarer, DecCards, DumCards, [Highest|_], Lo_lvl) ::- decompose_tactic(Suit, Tactic, Winners, Declarer, DecCards, DumCards, Highest, Lo_lvl). decompose_tactic1(Suit, Tactic, Winners, Declarer, DecCards, DumCards, [], Lo_lvl) ::- decompose_tactic(Suit, Tactic, Winners, Declarer, DecCards, DumCards, 0, Lo_lvl). decompose_tactic(_, _, 0, _, _, _, _, []). decompose_tactic(Suit, cash, Winners, Declarer, DecCards, [], _, Tactics) ::- !, length(DecCards, L), decompose(cash, Winners, Suit, Declarer, L, 0, Tactics). decompose_tactic(Suit, cash, Winners, Declarer, [], DumCards, _, Tactics) ::- !, length(DumCards, L), decompose(cash, Winners, Suit, Declarer, 0, L, Tactics). decompose_tactic(Suit,cash,Winners,Declarer, [Dec1|DecCards],[Dum1|DumCards], DefHighest, [cash(1,Suit,Declarer)|Tactics]) ::- ( ( Dec1 > DefHighest, Dum1 > DefHighest, length(DecCards,L1), length(DumCards,L2), L1 < L2 ); ( Dec1 > DefHighest, Dum1 < DefHighest ); ( Dec1 < DefHighest, Dum1 < DefHighest, Dec1 > Dum1 ) ), !, delete_highest([Dec1|DecCards], DecCards1), delete_lowest([Dum1|DumCards], DumCards1), Winners1 is Winners - 1, decompose_tactic(Suit, cash, Winners1, Declarer, DecCards1, DumCards1, DefHighest, Tactics). decompose_tactic(Suit,cash,Winners,Declarer, DecCards,DumCards, DefHighest, [cash(1,Suit,Dummy)|Tactics]) ::- partner(Declarer, Dummy), delete_highest(DumCards, DumCards1), delete_lowest(DecCards, DecCards1), Winners1 is Winners - 1, decompose_tactic(Suit, cash, Winners1, Declarer, DecCards1, DumCards1, DefHighest, Tactics). decompose_tactic(Suit, develop, 0 + Winners - Losers, Declarer, DecCards, DumCards, _, Tactics) ::- !, Num is Winners + Losers, length(DecCards, L1), length(DumCards, L2), decompose(develop, Num, Suit, Declarer, L1, L2, Tactics). /* Only duck if number of potential winners > number of losers */ decompose_tactic(Suit, develop, W1 + W2 - Losers, Declarer, DecCards, DumCards, DefHighest, Tactics) ::- W1 + W2 > Losers, !, length(DecCards, L1), length(DumCards, L2), ( L1 < L2, number_higher([DefHighest], DecCards, Cash1), decompose_tactic(Suit, cash, Cash1, Declarer, DecCards, DumCards, DefHighest, Tactics1), delete_played(DecCards, Cash1, DefHighest, DecCards1), delete_played(DumCards, Cash1, 999, DumCards1) ; ( L1 > L2, number_higher([DefHighest], DumCards, Cash1), decompose_tactic(Suit, cash, Cash1, Declarer, DecCards, DumCards, DefHighest, Tactics1), delete_played(DecCards, Cash1, 999, DecCards1), delete_played(DumCards, Cash1, DefHighest, DumCards1) ; Cash1 = 0, Tactics1 = [], DecCards1 = DecCards, DumCards1 = DumCards ) ), NL1 is L1 - Cash1, NL2 is L2 - Cash1, decompose(duck, Losers, Suit, Declarer, NL1, NL2, Tactics2), delete_lowest(Losers, DecCards1, DecCards2), delete_lowest(Losers, DumCards1, DumCards2), Cash is W1 + W2 - Cash1, decompose_tactic(Suit, cash, Cash, Declarer, DecCards2, DumCards2, DefHighest, Tactics3), append(Tactics1, Tactics2, Temp), append(Temp, Tactics3, Tactics). decompose_tactic(Suit, develop, W1 + W2 - Losers, Declarer, DecCards, DumCards, DefHighest, Tactics) ::- !, decompose_tactic(Suit, cash, W1, Declarer, DecCards, DumCards, DefHighest, Tactics1), delete_winners(DecCards, DefHighest, DecCards1), delete_winners(DumCards, DefHighest, DumCards1), decompose_tactic(Suit, develop, 0 + W2 - Losers, Declarer, DecCards1, DumCards1, _, Tactics2), append(Tactics1, Tactics2, Tactics). decompose_tactic(Suit, sim_fin_dec, Winners, Declarer, DecCards, DumCards, DefHighest, Tactic) ::- decompose_finesse(Suit, Winners, Declarer, DecCards, DumCards, DefHighest, Tactic). decompose_tactic(Suit,dbl1_fin_dec, Winners, Declarer, _,_, _, Tactics) ::- !, W1 is Winners - 1, decompose(finesse, 2, Suit, Declarer, Tactic1), decompose(cash, W1, Suit, Declarer, Tactic2), append(Tactic1, Tactic2, Tactics). decompose_tactic(Suit,dbl2_fin_dec, Winners, Declarer, DecCards,DumCards, _, Tactics) ::- decompose_tactic(Suit,dbl1_fin_dec, Winners, Declarer, DecCards,DumCards, _, Tactics). decompose_tactic(Suit,dbl2_fin_dum, Winners, Declarer, DecCards,DumCards, _, Tactics) ::- decompose_tactic(Suit,dbl1_fin_dum, Winners, Declarer, DecCards,DumCards, _, Tactics). decompose_tactic(Suit,dbl2_dfin_dec, Winners, Declarer, DecCards,DumCards, _, Tactics) ::- decompose_tactic(Suit,dbl1_dfin_dec, Winners, Declarer, DecCards,DumCards, _, Tactics). decompose_tactic(Suit,dbl2_dfin_dum, Winners, Declarer, DecCards,DumCards, _, Tactics) ::- decompose_tactic(Suit,dbl1_dfin_dum, Winners, Declarer, DecCards,DumCards, _, Tactics). decompose_tactic(Suit,dbl1_dfin_dec, W1+W2, Declarer, DecCards,DumCards, _, Tactics) ::- decompose_tactic(Suit,dbl1_fin_dec, W1, Declarer, DecCards,DumCards, _, Tactic1), decompose(develop, W2, Suit, both, Tactic2), append(Tactic1,Tactic2,Tactics). decompose_tactic(Suit,dbl1_fin_dum, Winners, Declarer, DecCards,DumCards, _, Tactics) ::- partner(Declarer,Dummy), decompose_tactic(Suit,dbl1_fin_dec, Winners,Dummy, DumCards,DecCards, _, Tactics). decompose_tactic(Suit,dbl1_dfin_dum, Winners, Declarer, DecCards,DumCards, _, Tactics) ::- partner(Declarer,Dummy), decompose_tactic(Suit,dbl1_dfin_dec, Winners,Dummy, DumCards,DecCards, _, Tactics). decompose_tactic(Suit,sim_dfin_dec, W1+W2-L, Declarer, DecCards, DumCards, DefHighest, Tactics) ::- decompose_tactic(Suit,sim_fin_dec, W1, Declarer, DecCards,DumCards, DefHighest, Tactic1), %here, Num is W2 + L, length(DecCards, L1), length(DumCards, L2), NL1 is L1 - W1, NL2 is L2 - W1, decompose(develop, Num, Suit, Declarer, NL1, NL2, Tactic2), append(Tactic1,Tactic2,Tactics). decompose_tactic(Suit,sim_dfin_dum, Winners, Declarer, DecCards, DumCards, DefHighest, Tactics) ::- partner(Declarer,Dummy), decompose_tactic(Suit,sim_dfin_dec, Winners,Dummy, DumCards,DecCards, DefHighest, Tactics). decompose_tactic(Suit,sim_fin_dum, Winners, Declarer, DecCards, DumCards, DefHighest, Tactics) ::- partner(Declarer,Dummy), decompose_finesse(Suit, Winners, Dummy, DumCards, DecCards, DefHighest, Tactics). decompose_tactic(Suit, rev_fin_dum, Winners,Declarer, DecCards,DumCards, DefHighest, Tactics) ::- decompose_tactic(Suit, sim_fin_dum, Winners,Declarer, DecCards,DumCards, DefHighest, Tactics). decompose_tactic(Suit, rev_fin_dec, Winners, Declarer, DecCards, DumCards, DefHighest, Tactics) ::- decompose_tactic(Suit, sim_fin_dec, Winners, Declarer, DecCards, DumCards, DefHighest, Tactics). decompose_finesse(Suit, Winners, Declarer, DecCards, DumCards, DefHighest, Tactic) ::- tops(DecCards, DefHighest, Tops_Dec), tops(DumCards, DefHighest, Tops_Dum), length(DumCards,LDum), length(DecCards,LDec), partner(Declarer,Dummy), %Cash dummy's winner if declarer has more or the same number of cards */ ( LDec >= LDum, decompose(cash, Tops_Dum, Suit, Dummy, Tactic1), decompose(cash, Tops_Dec, Suit, Declarer, Tactic3), Tactic4 = [] ; decompose(cash, Tops_Dec, Suit, Declarer, Tactic3), decompose(cash, Tops_Dum, Suit, Dummy, Tactic4), Tactic1 = [] ), length(Tactic1, Cashed1), length(Tactic3, Cashed3), length(Tactic4, Cashed4), Cashed is Cashed1 + Cashed3 + Cashed4, %Finesse the cards Fin is Winners - Tops_Dec - Tops_Dum, Low_Dum is LDum - Tops_Dum, min(Fin, Low_Dum, Fin1), decompose(finesse, Fin1, Suit, Declarer, Tactic2), Remainder is Winners - Fin1 - Cashed, Rest_Dec is LDec - Fin1 - Cashed, Rest_Dum is LDum - Fin1 - Cashed, decompose(cash, Remainder, Suit, Declarer, Rest_Dec, Rest_Dum, Tactic5), append(Tactic1, Tactic2, Temp1), append(Tactic3, Tactic4, Temp2), append(Temp1, Temp2, Temp), append(Temp,Tactic5, Tactic). decompose(_, 0, _, _, _, _, []) ::- !. decompose(HLT, Num, Suit, _, L, L, Tactic) ::- !, decompose(HLT, Num, Suit, both, Tactic). decompose(HLT, Num, Suit, _, L1, L2, Tactic) ::- Num < L1, Num < L2, !, decompose(HLT, Num, Suit, both, Tactic). decompose(HLT, Num, Suit, Declarer, L1, L2, Tactic) ::- L1 > L2, !, decompose(HLT, L2, Suit, both, Tactic1), length(Tactic1, Len), N is Num - Len, decompose(HLT, N, Suit, Declarer, Tactic2), append(Tactic1, Tactic2, Tactic). decompose(HLT, Num, Suit, Declarer, L1, _, Tactic) ::- decompose(HLT, L1, Suit, both, Tactic1), length(Tactic1, Len), N is Num - Len, partner(Declarer,Dummy), decompose(HLT, N, Suit, Dummy, Tactic2), append(Tactic1, Tactic2, Tactic). decompose(_,N,_,_,[]) ::- N =< 0, !. decompose(Tactic, Winners, Suit, Player,[Decompose|Decomposed]) ::- !, Winners1 is Winners - 1, functor(Decompose,Tactic,3), arg(1,Decompose,1), arg(2,Decompose,Suit), arg(3,Decompose,Player), decompose(Tactic,Winners1,Suit,Player,Decomposed). delete_played(Cards, 0, _, Cards) ::- !. delete_played([C|Cards], Tops, Highest, Cards1) ::- C > Highest, !, Tops1 is Tops - 1, delete_played(Cards, Tops1, Highest, Cards1). delete_played(Cards, Tops, Highest, Cards1) ::- delete_lowest(Cards, NCards), Tops1 is Tops - 1, delete_played(NCards, Tops1, Highest, Cards1). delete_lowest(1, Cards, Cards1) ::- delete_lowest(Cards,Cards1), !. delete_lowest(2, Cards, Cards1) ::- !, delete_2lowest(Cards,Cards1), !. delete_lowest(N, Cards, Cards1) ::- append(Cards1,List,Cards), length(List,N),!. delete_lowest(_, _, []). delete_winners([C|Cards], High, Cards1) ::- C > High, !, delete_winners(Cards, High, Cards1). delete_winners(Cards, _, Cards). /* if def is on lead and finesse with winners/entries in both hands then choose finesse tactic in this suit*/ choose_tactic_suit(Suit, Tactics, Tactic, Tactics1) ::- recursive_delete(Tactic, Tactics, Tactics1), arg(2, Tactic, Suit), functor(Tactic,finesse,_), analysis(Suit,Analysis), member(entries(1,1),Analysis), !, format("Executing Tactic :: ~p ~n",[Tactic]). /* else if def is on lead then choose first tactic in their suit*/ choose_tactic_suit(Suit, Tactics, Tactic, Tactics1) ::- recursive_delete(Tactic, Tactics, Tactics1), arg(2, Tactic, Suit), format("Executing Tactic :: ~p ~n",[Tactic]). choose_tactic_suit(Suit, _, duck(1,Suit,both)) ::- format("Executing Tactic :: ~p ~n",[duck(1,Suit,both)]). /* if declarer is on lead then choose first legal tactic */ /* we must be in the other hand for a finesse or duck with void opposite */ choose_tactic(Leader,Tactics,Tactic, Tactics1) ::- recursive_delete(Tactic, Tactics, Tactics1), ( functor(Tactic, duck, Leader) ; functor(Tactic,finesse,_), arg(3,Tactic,Player), partner(Leader,Player) ), format("Executing Tactic :: ~p ~n",[Tactic]). /* For all other tactics we can be in any hand */ choose_tactic(_,Tactics, Tactic, Tactics1) ::- recursive_delete(Tactic, Tactics, Tactics1), %functor(Tactic,cash,_); ( functor(Tactic, duck,_); functor(Tactic, develop,_) ), format("Executing Tactic :: ~p ~n",[Tactic]). /* tactic_card(Tactic, Contract, Player, Cards, DecSuit1, DecSuit2, DefSuit,Card), Player is who is playing, and Cards are cards that have been played DecSuit1 is the hand to play, DecSuit2 is partner's Presume we are in the right hand and tactic is applicable */ /* play winner from only hand, then shortest hand or duck if both hands have winners and equal length then third hand wins The anyone case is not guaranteed to always be executable */ /* Only 1 player has winner */ tactic_card(cash(_, Suit, anyone), _, _, _, [Card|_], [Card1|_], DefSuit, card(Suit,Card)) ::- defenders_highest(DefSuit,H), Card > H, Card1 < H. /* play winner from shorter hand */ tactic_card(cash(_,Suit,anyone), _, _, _, [Card|DecSuit1], [Card1|DecSuit2], DefSuit, card(Suit,Card)) ::- defenders_highest(DefSuit,H), Card > H, Card1 > H, length(DecSuit1, L1), length(DecSuit2, L2), L1 < L2. /* play winner in 3/4 hand */ tactic_card(cash(_,Suit,anyone), _, _, [_,_|_], [Card|DecSuit1], [Card1|DecSuit2], DefSuit, card(Suit,Card)) ::- defenders_highest(DefSuit,H), Card > H, Card1 > H, length(DecSuit1, L), length(DecSuit2, L). /* else play small */ tactic_card(cash(_,Suit,anyone), _, _, _, DecSuit1, _, _, card(Suit,Card)) ::- append(_,[Card],DecSuit1). /* If winner has been chosen */ /* Got a free finesse on opening lead tactic_card(cash(_, Suit, Player), _, Partner, [_], [H1|DecSuit1], [H2|DecSuit2], [Highest|DefSuit] ,card(Suit,HNW1)) ::- here, partner(Player, Partner), H1 > Highest, H2 > Highest, highest_non_winner(DecSuit1, Highest, HNW1), number_higher([HNW1], [Highest|DefSuit], 1). */ tactic_card(cash(_,Suit,Player), _, Player, [C1,_,C3], DecSuit1, _, _,card(Suit,Card)) ::- defenders_highest(Suit, C1, C3, C), win_cheaply(DecSuit1,C,Card). tactic_card(cash(_,Suit,Player), _, Player, _, [Card|_], _, _,card(Suit,Card)) ::- !. tactic_card(cash(_,Suit,_), _, _, _, DecSuit1, _, _,card(Suit,Card)) ::- append(_,[Card],DecSuit1). tactic_card(cash(_,Suit,_), _, _, _, [Card|_], _, _,card(Suit,Card)) ::- !. tactic_card(cash(_,Suit,_), _, _, _, DecSuit1, _, _,card(Suit,Card)) ::- append(_,[Card],DecSuit1). tactic_card(duck(_,Suit,_), _, _, _, DecSuit1, _, _,card(Suit,Card)) ::- append(_,[Card],DecSuit1). /* In fourth seat play small if Defenders win trick */ tactic_card(develop(_,Suit,_), _, _, [C1,C2,C3], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- ( ( higher(Suit, C1, card(Suit,Card1)), higher(Suit, C1, C2) ) ; ( higher(Suit, C3, card(Suit,Card1)), higher(Suit, C3, C2) ) ), !, append(_,[Card],[Card1|DecSuit1]). /* In fourth seat play small if Partner won the trick */ tactic_card(develop(_,Suit,_), _, _, [C1,C2,C3], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- higher(Suit,C2,C1), higher(Suit,C2,C3), !, append(_,[Card],[Card1|DecSuit1]). /* else win cheaply */ tactic_card(develop(_,Suit,_), _, _, [C1,_,C3], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- defenders_highest(Suit, C1, C3, C), win_cheaply([Card1|DecSuit1],C,Card). /* In third seat play small if Defenders win trick */ tactic_card(develop(_,Suit,_), _, _, [C1,C2], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- higher(Suit, C2, card(Suit,Card1)), higher(Suit, C2, C1), !, append(_,[Card],[Card1|DecSuit1]). /* In third seat play highest if Defender and Partner play small */ tactic_card(develop(_,Suit,_), _, _, [card(Suit,C1),_], [Card1|_], _, Def, card(Suit,Card1)) ::- number_higher([Card1], Def, NH1), number_higher([C1], Def, NH2), NH1 < NH2, !. /* else play small */ tactic_card(develop(_,Suit,_), _, _, [_,_], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- append(_,[Card],[Card1|DecSuit1]). /* In second seat play small if Defenders win trick */ tactic_card(develop(_,Suit,_), _, _, [C1], [Card1|DecSuit1], [Card2|_], _, card(Suit,Card)) ::- higher(Suit, C1, card(Suit,Card1)), higher(Suit, C1, card(Suit,Card2)), !, append(_,[Card],[Card1|DecSuit1]). tactic_card(develop(_,Suit,_), _, _, [C1], [Card1|DecSuit1], [], _, card(Suit,Card)) ::- higher(Suit, C1, card(Suit,Card1)), !, append(_,[Card],[Card1|DecSuit1]). /* Play high if hnw greater than partners */ tactic_card(develop(_,Suit,_), _, _, [_], [Card1|_], DecSuit2, Def, card(Suit,Card1)) ::- number_higher([Card1], Def, NH1), number_higher(DecSuit2, Def, NH2), NH1 < NH2, !. /* else play lowest */ tactic_card(develop(_,Suit,_), _, _, [_], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- !, append(_,[Card],[Card1|DecSuit1]). /* In first seat play hnw if have greater than partner */ tactic_card(develop(_,Suit,_), _, _, [], [Card1|_], DecSuit2, Def, card(Suit,Card1)) ::- number_higher([Card1], Def, NH1), number_higher(DecSuit2, Def, NH2), NH1 < NH2, !. /* else play lowest */ tactic_card(develop(_,Suit,_), _, _, [], [Card1|DecSuit1], _, _, card(Suit,Card)) ::- append(_,[Card],[Card1|DecSuit1]). tactic_card(finesse(_,Suit,Player), _, ToPlay, Played, [Card1|DecSuit1], [Card2|DecSuit2], [Highest|DefSuit], Cards) ::- max(Card1, Card2, Max), Max > Highest, !, ftactic_card(finesse(_,Suit,Player), _, ToPlay, Played, [Card1|DecSuit1], [Card2|DecSuit2], [Highest|DefSuit], Cards). tactic_card(finesse(_,Suit,Player), _, ToPlay, Played, [Card1|DecSuit1], [Card2|DecSuit2], [Highest|DefSuit], Cards) ::- rtactic_card(finesse(_,Suit,Player), _, ToPlay, Played, [Card1|DecSuit1], [Card2|DecSuit2], [Highest|DefSuit], Cards). /* 1 reg finesse 4th Seat - partner won, so duck */ ftactic_card(finesse(_,Suit,_), _, _, [C1,C2,C3], DecSuit, _, _, card(Suit,Card)) ::- higher(Suit, C2, C1), higher(Suit,C2, C3), append(_,[Card],DecSuit). /* 2 reg finesse 4th Seat - win as cheap as possible */ ftactic_card(finesse(_,Suit,_), _, _, [C1,_,C3], DecSuit, _, _, card(Suit,Card)) ::- defenders_highest(Suit, C1, C3, C), win_cheaply(DecSuit,C,Card). /* 3 reg finesse 1st Seat - play hnw if finesse card only in this hand */ ftactic_card(finesse(_, Suit, Player), _, Partner, [], DecSuit1, DecSuit2, [Highest|DefSuit], card(Suit,HNW1)) ::- partner(Player, Partner), highest_non_winner(DecSuit1,Highest,HNW1), highest_non_winner(DecSuit2,Highest,HNW2), number_higher([HNW1],[Highest|DefSuit], N1), number_higher([HNW2],[Highest|DefSuit], N2), N1 < N2, !. /* 4 reg finesse 1st Seat - play hnw if both hands have finesse cards but have enough finesse cards to lead hnw and save communication */ ftactic_card(finesse(_, Suit, Player), _, Partner, [], DecSuit1, DecSuit2, [H1,H2|_], card(Suit,HNW1)) ::- partner(Player, Partner), %here, highest_non_winner(DecSuit1, H1, HNW1), highest_non_winner(DecSuit2, H1, HNW2), HNW1 > H2, HNW2 > H2, number_between(DecSuit1, H1, H2, N1), number_between(DecSuit2, H1, H2, N2), number_of_actions(_, 1, Suit, Actions), plan((_,Plan),_), member(HLT,Plan), functor(HLT, Suit, _), arg(3,HLT,Potential), winners(Suit, Winners), val(Potential, No_of_Tricks), N1 + N2 >= No_of_Tricks - Winners - Actions, !. /* 5 else reg finesse 1st Seat - play small */ ftactic_card(finesse(_,Suit,Player), _, Partner, [], DecSuit, _, _, card(Suit,LCard)) ::- partner(Player, Partner), append(_,[LCard],DecSuit). /* 6 reg finesse any but 1st Seat - play high if finesse card played */ ftactic_card(finesse(_, Suit,Player), _, Player, [card(Suit,Card)|_], [Card1|DecSuit1], DecSuit2, [Highest|_], card(Suit,Card1)) ::- highest_non_winner([Card1|DecSuit1], Highest, HNW1), highest_non_winner(DecSuit2, Highest, HNW2), HNW1 < Card, HNW2 < Card, Card1 > Card, !. /* 7 reg finesse 2st Seat - play hnw if finesse card only in this hand and led low*/ ftactic_card(finesse(_,Suit,_), _, _, [card(Suit,Card)], DecSuit1, DecSuit2, [Highest|DefSuit], card(Suit,HNW1)) ::- highest_non_winner(DecSuit1,Highest,HNW1), highest_non_winner(DecSuit2,Highest,HNW2), number_higher([HNW1],[Highest|DefSuit], N1), number_higher([HNW2],[Highest|DefSuit], N2), HNW1 > Card, N1 < N2. /* 8 reg finesse 2nd Seat - play hnw if both hands have finesse cards, led low but have enough finesse cards to play hnw and save communication */ ftactic_card(finesse(_, Suit, Player), _, Partner, [card(Suit,Card)], DecSuit1, DecSuit2, [H1,H2|_], card(Suit,HNW1)) ::- partner(Player, Partner), %here, highest_non_winner(DecSuit1, H1, HNW1), highest_non_winner(DecSuit2, H1, HNW2), HNW1 > Card, HNW1 > H2, HNW2 > H2, number_between(DecSuit1, H1, H2, N1), number_between(DecSuit2, H1, H2, N2), number_of_actions(_, 1, Suit, Actions), plan((_,Plan),_), member(HLT,Plan), functor(HLT, Suit, _), arg(3,HLT,Potential), winners(Suit, Winners), val(Potential, No_of_Tricks), N1 + N2 >= No_of_Tricks - Winners - Actions, !. /* 9 reg finesse 2st Seat - else if led low play low */ ftactic_card(finesse(_, Suit,_), _, _, [_], DecSuit, _, _, card(Suit,LCard)) ::- append(_,[LCard],DecSuit). /* 10 reg finesse 3rd Seat - play high if defender does not follow */ ftactic_card(finesse(_, Suit,Player), _, Player, [card(Suit1,_),_], [Card1|_], _, _, card(Suit,Card1)) ::- Suit1 \== Suit, !, Tactic =.. [Suit, finesse], ( clause(failed(Tactic),_) ; assert(failed(Tactic)) ). /* 11 reg finesse 3rd Seat - play hnw if finesse card in this hand and defender follows low */ ftactic_card(finesse(_,Suit,Player), _, Player, [_, card(Suit,Card)], DecSuit, _, [Highest|DefSuit], card(Suit,HNW1)) ::- highest_non_winner(DecSuit,Highest,HNW1), number_higher([HNW1],[Highest|DefSuit], N1), number_higher([Card],[Highest|DefSuit], N2), N1 < N2. /* 12 else partner has played hnw and defender has followed low so play low*/ ftactic_card(finesse(_,Suit,Player), _, Player, [_,_], DecSuit, _, _, card(Suit,Card)) ::- append(_, [Card], DecSuit). /*reverse finesse 4rd Seat - partner won so duck */ rtactic_card(finesse(_,Suit,_), _, _, [C1,C2,C3], DecSuit, _, _, card(Suit,Card)) ::- higher(Suit, C2, C1), higher(Suit,C2, C3), append(_, [Card], DecSuit). /*reverse finesse 4rd Seat - partner won so win cheapest */ rtactic_card(finesse(_,Suit,_), _, _, [C1,_,C3], DecSuit, _, _, card(Suit,Card)) ::- defenders_highest(Suit, C1, C3, C), win_cheaply(DecSuit,C,Card). /*reverse finesse to partner's hand - duck */ rtactic_card(finesse(_, Suit, Player), _, Partner, _, DecSuit1, _, _, card(Suit,Card)) ::- partner(Player,Partner), !, append(_,Card,DecSuit1). /*reverse finesse - duck if defender plays high */ rtactic_card(finesse(_,Suit,Player), _, Player, [suit(Suit,Highest)|_], DecSuit, _, [Highest|_], card(Suit,Card)) ::- !, append(_,[Card],DecSuit). rtactic_card(finesse(_,Suit,Player), _, Player, [_,_,suit(Suit,Highest)|_], DecSuit, _, [Highest|_], card(Suit,Card)) ::- !, append(_,[Card],DecSuit). /*reverse finesse 2nd, 3rd - play high */ rtactic_card(finesse(_,Suit,Player), _, Player, _, [Card1|_], _, _, card(Suit,Card1)) ::- !. highest_non_winner([C1|_], C2, C1) ::- C1 < C2, !. highest_non_winner([_|Cs], C2, C3) ::- highest_non_winner(Cs, C2, C3). higher(Suit, card(Suit, Card1), card(Suit, Card2)) ::- Card1 < Card2, !, fail. higher(Suit,card(Suit,_), card(_,_)). defenders_highest(Suit, card(Suit,C1),card(Suit,C2), C1) ::- C1 > C2, !. defenders_highest(Suit, card(Suit,_),card(Suit,C2), C2) ::- !. defenders_highest(Suit, card(Suit,C1),_, C1) ::- !. defenders_highest(Suit, _, card(Suit,C2), C2) ::- !. defenders_highest(_, _, _, 0). defenders_highest([H|_], H). defenders_highest([], 0). win_cheaply([Card1], _, Card1) ::- !. win_cheaply([Card1,Card2|_],C,Card1) ::- Card1 > C, Card2 < C, !. win_cheaply([_,Card2|Cards], C, Card) ::- win_cheaply([Card2|Cards], C, Card). %defender_card(Hand,Player,LeadSuit,contract(_,_,Dec),Card) defender_card(Hand, Player, _, contract(_,_,Dec), card(Suit,Card)) ::- ( Player = Dec ; partner(Player,Dec) ), plan((_,Plan),_), member(HLT,Plan), functor(HLT,Suit,_), get_suit(Hand, Suit, Cards), length(Cards,L), L > 0, arg(3,HLT,N), number_of_actions(_,1,Suit,N1), L > N + N1, !, append(_,[Card],Cards). defender_card(Hand, _, LeadSuit, _, card(LeadSuit,Card)) ::- nonvar(LeadSuit), get_suit(Hand, LeadSuit,[Card]), !. defender_card(Hand,Player,LeadSuit,_,card(SuitName,Value)) ::- repeat, format("Choose card from ~p's hand :: ",[Player]), read_line(Cs), pick_suit(Cs,LeadSuit,SuitName), pick_card(Cs,Value), in_hand(Hand,Player,SuitName,Value), follow_suit(Hand,SuitName,Value,LeadSuit), !. defender_card(Hand,Player,LeadSuit,Contract,card(SuitName,Value)) ::- format("Illegal Card ~n",[]), defender_card(Hand,Player,LeadSuit,Contract,card(SuitName,Value)). check_suits(contract(_,_,Dec), Suit, Hand, Side, Winner, [Learnt|Learned]) ::- assert(known(Learnt)), format("Leart ~p~n",[Learnt]), getdeflen(Hand, Dec, Suit, L), Clause =.. [Suit, pos], not(clause(failed(Clause),_)), ( L >= 1, %format("Failed ~p~n",[Clause]), assert(failed(Clause)) ; true ), ( L >= 2, Clause1 =.. [Suit,usual], %format("Failed ~p~n",[Clause1]), assert(failed(Clause1)) ; true ), !, check_suits(contract(_,_,Dec),Suit, Hand, Side, Winner, Learned). check_suits(_, _, _, _, _, _) ::- !. check_plan(_, _, defender, _, Action) ::- ( Action = dbl1_fin_dec ; Action = dbl1_fin_dum ), !. check_plan(_, Suit, defender, _, Action) ::- finesseable(Action), plan(_, Reqs), Req =.. [Suit, finesse], member(Req, Reqs), %assert(failed(Req)), format("Current plan has failed~n",[]), !, fail. check_plan(contract(_,_,Dec), Suit, declarer, _, Action) ::- finesseable(Action), plan((_,Plan), Reqs), Req =.. [Suit, finesse], member(Req, Reqs), member(Tactic,Plan), functor(Tactic, Suit, _), arg(1,Tactic, HLT), name(HLT, Name), append(_,[P, L, R], Name), name(Player, [P, L, R]), ( Player = dec, next_play(Next, Dec) ; Player = dum, next_play(Dec, Next) ), Known =.. [Suit, void, Next], clause(known(Known),_), format("Current plan has failed~n",[]), !, fail. check_plan(_, _, _, _, _) ::- plan(_, Reqs), member(Req, Reqs), clause(failed(Req),_), format("Current plan has failed~n",[]), !, fail. check_plan(_, _, _, _, _). getdeflen(hand(_,_,Hand1,Hand2),Dec,Suit,L) ::- ( Dec = north ; Dec = south ), !, get_suit(Hand1,Suit,Cards1), get_suit(Hand2,Suit,Cards2), length(Cards1,L1), length(Cards2,L2), L is L1 + L2. getdeflen(hand(Hand1,Hand2,_,_), _,Suit,L) ::- get_suit(Hand1,Suit,Cards1), get_suit(Hand2,Suit,Cards2), length(Cards1,L1), length(Cards2,L2), L is L1 + L2. hi_lvl_tactic([HLT|_], Suit, HLT) ::- functor(HLT, Suit, _), !. hi_lvl_tactic([_|HLTs], Suit, HLT) ::- hi_lvl_tactic(HLTs, Suit, HLT). number_of_actions(Action, Win, Suit, N) ::- bagof(action(Action, Win, Suit, P), action(Action, Win, Suit, P), Actions), !, length(Actions, N). number_of_actions(_, _, _, 0). assert_action(declarer, Winner) ::- retract(action(Tactic, 0, Suit, _)), !, asserta(action(Tactic, 1, Suit, Winner)). assert_action(defender, Winner) ::- retract(action(Tactic, 0, Suit, _)), !, asserta(action(Tactic, -1, Suit, Winner)). %change_llp(Plan1, _Leader, WinSuit, Winner, Update, NPlan). change_llp(Plan, _Leader, _, _, [], Plan) ::- !. change_llp([], _, _, _, _, []) ::- !. change_llp([Tactic|Tactics], _, Suit, _, [Old/New], [NTactic|NTactics]) ::- arg(2, Tactic, Suit), functor(Tactic, Old, _), !, functor(NTactic, New, 3), arg(1,NTactic,1), arg(2,NTactic,Suit), arg(3,NTactic,anyone), change_llp(Tactics, _, Suit, _, [Old/New], NTactics). change_llp([Tactic|Tactics], _, Suit, _, Update,[Tactic|NTactics]) ::- change_llp(Tactics, _, Suit, _, Update, NTactics). update_llp(LLP, _, _, _, [], _, LLP) ::- !. update_llp(LLP, Hand, Suit, Analysis, [New], contract(_,_,Declarer),NLLP) ::- partner(Declarer, Dummy), next_play(Declarer, Defender1), next_play(Dummy, Defender2), get_hand(Hand, Declarer, Dec), get_hand(Hand, Dummy, Dum), get_hand(Hand, Defender1, Def1), get_hand(Hand, Defender2, Def2), member(Tactic,Analysis), functor(Tactic,New,_), arg(1,Tactic,Winners), Tactic1 =.. [Suit, New, cert, Winners], decompose_plan([Tactic1], Declarer, Dec, Dum, Def1, Def2, [Lo_Lvl]), update_suit_llp(LLP, Lo_Lvl, LLP1), splice_plan(LLP1, NLLP). /* t(P) ::- update_suit_llp( [[cash(1,diamonds,north), cash(1,diamonds,south)], [cash(1,hearts,north)], [cash(1,spades,north)], [cash(1,hearts,south)]], [cash(1,hearts,both),cash(1,hearts,noone)],P). */ update_suit_llp([], _, []). update_suit_llp([Act|Acts], Lo_Lvl, [NAct|NActs]) ::- update_a_suit(Act, Lo_Lvl, NAct, Rest), update_suit_llp(Acts, Rest, NActs). update_a_suit([], Rest, [], Rest). update_a_suit([Act|Acts], [NAct|NActs], [NAct|NActs1], Rest) ::- arg(2, Act, Suit), arg(2, NAct, Suit), !, update_a_suit(Acts, NActs, NActs1, Rest). update_a_suit([Act|Acts], NActs, [Act|NActs1], Rest) ::- update_a_suit(Acts, NActs, NActs1, Rest). update_hlp(Suit,[New]) ::- !, plan((Prob,Plan),Reqs), change_hlp(Plan, Suit, New, NPlan), format("Old High Level Plan ~p~n",[Plan]), retract_it(plan(_,_)), format("New High Level Plan ~p~n",[NPlan]), assert(plan((Prob, NPlan), Reqs)), update_actions(Suit). update_hlp(_, _). change_hlp([HLT|HLTs], Suit, New, [HLT1|HLTs]) ::- functor(HLT, Suit, _), !, number_of_actions(_, 1, Suit, W), number_of_actions(_, -1, Suit, L), arg(2, HLT, Prob), arg(3, HLT, N1), val(N1,Val), N2 is Val - W - L, HLT1 =.. [Suit, New, Prob, N2]. change_hlp([HLT|HLTs], Suit, New, [HLT|HLTs1]) ::- change_hlp(HLTs, Suit, New, HLTs1) . number_between([Card|Cards], H1, H2, N) ::- Card > H1, !, number_between(Cards, H1, H2, N). number_between([Card|Cards], H1, H2, N) ::- Card < H1, Card > H2, !, number_between(Cards, H1, H2, N1), N is N1 + 1. number_between(_, _, _, 0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/ProNTo/witzig/convert_file.pl ::% s([human,action|_G4016],100022113,2,n,1,1). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/wn_frames.pl ::opposite(n,action,inaction,_20). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/vnsmall.pl ::verbnet_secondary('waltz-51.5_f2',['NP-PP;','Induced','Action',with,accompanied,'motion,','path-PP']). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/verbs.pl :: Passive Phrasal Verbs ("An action has been called for by an official") T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/verbnet_iface.pl ::verbnet_role('Source', 'Place', 'concrete or abstract place that is starting point of action'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/tt0_iface.pl ::prim_acts(Z) ::- ttholds(_,Y,primitive_action_tt),(ttholds(_,Z,Y)*->true; Z=Y). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/tt0_00022_cycl.pl ::; distribute the Program or its derivative works. These actions are T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/posm_cached_data2.pl ::textCached('About-TheWord',frame, ['About-TheWord', 'Preposition', 'Post-NounPhraseModifyingFrame', topicOfInfoTransfer(' ::ACTION', ' ::OBLIQUE-OBJECT'), prepSemTrans]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/stem/lancaster.py :: >>> st.stem('multiply') # No action taken if word ends with "-ply" T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/sem/util.py :: opts.add_option("-e", "--no-eval", action="store_false", dest="evaluate", T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/sem/drt_glue_demo.py :: actionmenu = Menu(menubar, tearoff=0) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/sem/chat80.py :: opts.add_option("-c", "--concepts", action="store_true", T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/sem/boxer.py :: opts.add_option("--verbose", "-v", help="display verbose logs", action="store_true", default=False, dest="verbose") T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/metrics/agreement.py :: parser.add_option("-e", "--exclude", dest="exclude", action="append", T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/inference/prover9.py :: 7 :: "(ACTION)", # A Prover9 action terminated the search. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/downloader.py :: parser.add_option("-q", "--quiet", dest="quiet", action="store_true", T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/chat/zen.py ::# or an action (eg 'to see you') T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/app/wordnet_app.py ::

T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nltk_3.0a3/nltk/app/chunkparser_app.py :: "which performs an action such as creating a chunk or merging " T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/nl_iface.pl ::nlkb7166 ::assertion_content(verbSemTrans, xShowerTheWord, 0, xIntransitiveVerbFrame, and(isa('ACTION', actTakingAShower), performedBy('ACTION', 'SUBJECT')), 639086). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/mworld0_declpreds.pl ::dynamicCyc2( 'actionExpressesFeelingToward'/5). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/framenet.pl ::fnpattern(sanction, 33000000, 'grant_permission', ['agent' :: 'grantor', 'theme' :: 'grantee', 'predicate' :: 'action']). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/pldata/ac_xnl_iface.pl ::acnl('nbarForArgOfPred','unitCommander',2,uU('xPhraseFnConstrained',nartR('xPhraseFnBar1','xtNoun'),uU('xConcatenatePhrasesFn',[uU('xHeadWordOfPhraseFn',uU('xParaphraseFnConstrained','singularGeneric','unitCommander')),uU('xPpPNpFn','xOfTheWord',uU('xParaphraseFnNp','ARG1'))])),1828320acnl('verbSemTrans','iInstitutionaliseTheWord',0,'xDitransitiveNPInfinitivePhraseFrame','and'('isa'('ACTION','actCommittingSomeoneToAnInstitution'),'performedBy'('ACTION','SUBJECT'),'recipientOfInfo'('ACTION','OBJECT'),'infoTransferred'('ACTION',PERMISSION),'istInformation'(PERMISSION,'performedBy'('INF-COMP','OBJECT'))),3308704). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/nlp_book/plan_gen.pl ::% actions to achieve a goal, but stops as soon as it finds an T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/nlp_book/plan_gen.pl :: planner(Id,Actions). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/nlp_book/disambig.ptr :: PP :: arg0 :: type === action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/nlp_book/airlines.ptr :: W :: sem :: body :: action === printout, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/e2c/e2c.pl :: subst(Formula3,' ::ACTION','?ACTION',Formula4), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/chat80_regress/newdict.pl ::/* THAT INVOKES ACTION */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/chat80/newdict_regress.pl ::/* THAT INVOKES ACTION */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/chat80/newdict.pl ::/* THAT INVOKES GOVERNING ACTIONS ... */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/chart89/plan_gen.pl ::% actions to achieve a goal, but stops as soon as it finds an T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/chart89/plan_gen.pl :: planner(Id,Actions). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/chart89/disambig.ptr :: PP :: arg0 :: type === action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/chart89/airlines.ptr :: W :: sem :: body :: action === printout, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/tests/depbank560/train.retok.autopos.parses ::(ncmod _ lawsuit class-action) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/tests/depbank560/example.trans.parses ::(ncmod _ lawsuit class-action) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/tests/depbank560/depbank560.retok.pipe ::( T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/tests/depbank560/depbank560.retok.goldpos.parses ::(ncmod _ lawsuit class-action) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/tests/depbank560/depbank560.retok.autopos.parses ::(ncmod _ lawsuit class-action) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/tests/depbank560/ccgbank.retok.nopost.parses ::(ncmod _ lawsuit class-action) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/tests/depbank560/ccgbank.retok.gold.parses ::(ncmod _ lawsuit class-action) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/prolog/boxer/lex/verbs.pl :: Passive Phrasal Verbs ("An action has been called for by an official") T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/prolog/boxer/lex/framenet.pl ::fnpattern(sanction, 33000000, 'Grant_permission', ['Agent' :: 'Grantor', 'Theme' :: 'Grantee', 'Predicate' :: 'Action']). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/prolog/boxer/knowledge/wiki.pl ::wiki('organization','"Anti-Fascist_Action"', ['"anti-fascist"','"action"']). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/prolog/boxer/knowledge/verbalization-list-v1.01.pl ::verbalize('planner','person','ARG0-of','plan-01'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/prolog/boxer/knowledge/roles.pl ::role('Source', 'Place', 'concrete or abstract place that is starting point of action'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/prolog/boxer/knowledge/relations.pl ::nn('action','agenda','for'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/prolog/boxer/knowledge/negprefix.pl ::negprefix(n, inaction, in, action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/candc/src/api/ccg/tgrep.py ::parser.add_option('-c', '--colour', dest='colour', help='force match highlighting', action='store_true', default=False) T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/ace_in_gf/tools/normalize_ace.py ::parser.add_argument('-v', '--version', action='version', version='%(prog)s v0.1') T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/ace_in_gf/tools/make_lang.py ::parser.add_argument('-l', '--lang', type=str, action='store', dest='lang', T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/ace_in_gf/tools/make_gf_parse_lin_command.py :: type=str, action='store', dest='lang_in', T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/ace_in_gf/tools/length.py ::parser.add_argument('-v', '--version', action='version', version='%(prog)s v0.1') T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/ext/ace_in_gf/tools/convert_acewiki.py ::parser.add_argument('-i', '--in', type=str, action='store', dest='file_in', T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-3.0/prolog/wn_sk.pl ::sk(103956785,1,'planner%1 ::06 ::00 :: ::'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-3.0/prolog/wn_sk.pl ::sk(100030358,3,'human_action%1 ::03 ::00 :: ::'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-3.0/prolog/wn_s.pl ::s(103956785,1,'planner',n,2,0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-3.0/prolog/wn_s.pl ::s(100030358,3,'human action',n,1,1). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-3.0/prolog/wn_g.pl ::g(105907251,'a speculative scheme that depends on unstable factors that the planner cannot control; "his proposal was nothing but a house of cards"; "a real estate bubble"'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-3.0/prolog/wn_g.pl ::g(100023773,'the psychological feature that arouses an organism to action toward a desired goal; the reason for the action; that which gives purpose and direction to behavior; "we did not understand his motivation"; "he acted with the best of motives"'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.7.1/prolog/wn_s.pl ::s(103447389,1,'planner',n,2,0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.7.1/prolog/wn_s.pl ::s(100022113,2,'human_action',n,1,1). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.7.1/prolog/wn_g.pl ::g(105055267,'(a speculative scheme that depends on unstable factors that the planner cannot control; "his proposal was nothing but a house of cards"; "a real estate bubble")'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.7.1/prolog/wn_g.pl ::g(100017684,'(the psychological feature that arouses an organism to action toward a desired goal; the reason for the action; that which gives purpose and direction to behavior; "we did not understand his motivation"; "he acted with the best of motives")'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.6/prolog/wn_s.pl ::s(107249684,1,'event_planner',n,1,0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.6/prolog/wn_s.pl ::s(100017487,2,'human_action',n,1,1). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.6/prolog/wn_g.pl ::g(104539869,'(a scheme that depends on unstable factors that the planner cannot control)'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nlu/data/WNprolog-1.6/prolog/wn_g.pl ::g(100013700,'(the psychological feature that arouses an organism to action; the reason for the action; "we did not understand his motivation"; "he acted with the best of motives")'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_nars/prolog/sre_dna/sre3.pl ::% action :: a T:/opt/logicmoo_workspace/packs_sys/logicmoo_nars/prolog/miles/xm.pl :: xtAddActions([action(label_ok,changeSelectedLabels,LabelChangeDialog)]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_nars/misc/Networking/udp_toothbrush.py :: * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nars/misc/Networking/irc_nar.py :: * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nars/evaluation.py :: * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nars/english_to_narsese.py :: * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, T:/opt/logicmoo_workspace/packs_sys/logicmoo_nars/analysis.py :: * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/states_explorer.pl :: ::- use_module('../engine/interpreter.P',[flat_sequence/2, action_/1, event_pred/1, abstract_numbers/2, user_prolog_clause/2]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysLate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysEarlyTricky.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseNoComplications.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerDefaults.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCuresRep.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/utils/explanator.pl ::action(X) ::- lps_program_module(M), catch(M ::action(X),_,fail). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/swish/user_module_swish.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/swish/user_module_repl.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/swish/user_module_base.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/swish/lps_server_UI.pl :: interpreter ::query_thread(LPS_ID, lps_server_UI ::provide_events_get_fluents_events_actions(InputEvents,Timeless,_Result), Cycle, Result), T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/prolog/lps_syntax.pl :: op(1050,fx,actions), T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/prolog/dialect/lps.pl :: op(1050,fx,(Module ::actions)), T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/slamodel.pl ::% this is automatically achieved with condition-action rules T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/party_minimal.pl ::% the askMoney action is not firing because the timeless predicate parent's second solution is not being considered T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/oneprisoner.pl ::% There is some action better than A1 in the context of B1, B2, P and Q. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/lps_dialect_test.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/goat.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/unserializedDice.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/two_initiate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/terminator.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/terminator.pl ::% Demo lps_terminate action, and Prolog system "output predicate" called as an action T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/switchingWithTimeExpression.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/simulatedTimeCompositeEvent2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/simulatedTimeCompositeEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/simulatedTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/serializedDice.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/RockPaperScissors-3players.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/RockPaperScissors-3players.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/RockPaperScissors-3players-badFluent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/RockPaperScissors-3players-badFluent.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/realTimeObservations.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/real_time_constants.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/prospectiveGoat2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/paralellConjunctions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/neverEndingEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/negatedFluentShouldNotSucceed.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/negatedFluentShouldNotSucceed.pl ::then legal_action_against(lender) from T3. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/negatedFluentInConjunction.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/meta.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/intensFluentBindingTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/inLineTimeExpressions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/implicitTimeOrdering.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/if_then_else_with_writes.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/if_then_else_with_writes.pl :: % specified timewise, and the IF subgoal would NOT be assumed adjacent to the terminate action above T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/if_then_else.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/if_then.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/futuresContractFailing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/futuresContractCompliant.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/fluentAfterEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/fluentAfterEvent.pl ::actions legal_action_against(_). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/fariba_sam_bug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/failBetter.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/externalPrologEvents.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/externalPrologEvents.pl ::% no facts here please, otherwise they'll be taken as macro action clauses :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/external_stuff.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/editingActions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/compositeInitiateBug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/compositeEventsInPostConditions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/compositeEventInconsistency.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/compositeEventInconsistency.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/changingFluentInAntecedent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/BugEndingWithSimulatedRealTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/bobObservationBug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/bobObservationBug.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/bankTransfer2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/bankTransfer1.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/bankDoubleTransfer.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/bankDoubleTransfer.pl ::% following commented out :: all actions are serialised, producing cumulative effects IF using updates T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/bank_transferWithhappened.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/ballotTest.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/badlight2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/backtrackingAcrossCycles.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/forTesting/authoriseCard.pl ::?- go(Timeline,[more_actions]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/external_interfaces/myJavaHook.pl :: % interpreter ::option(cycle_hook(my_hook,Fluents,Actions)), % only one hook, but check name anyway T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/external_interfaces/myHook.pl :: go(YourProgram,[...,cycle_hook(my_hook,FluentTemplates,ActionTemplates),..]) T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/ethereumAntecedent.pl ::% Reactive rule antecedents cannot execute actions, they consume events. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/dining_philosophers_terse.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/use_insulin.pl ::% Events and actions take place between cycles, and fluents hold during cycles. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/turingTest.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_tricky_claim.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_normal_claim.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_noncompliant.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_irrelevant_events.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_foreclosing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_insurance_eternal.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_futures_failing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/SzaboLanguage_futures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/sos.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/sortWithTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/simulation/SimulationKit.pl ::% This postcondition must be used, rather than a simple update "anonymous action", for serializability, T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/simulation/cookingMachine.pl ::% "if true at T then ..." is a way to "observe" (e.g. request to perform) a composite event/action T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/simulateExternalEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/simulateExternalEvent.pl ::actions some_action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissorsServer.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissorsServer-noProspectivePCs.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissorsEthereum.pl ::pay(Player,Prize) from T1 to T3 if % plan / macro action on the blockchain T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissorsBaseEN.pl ::the actions are :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissorsBase.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissors.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissors.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/RockPaperScissors-Minimal-en.pl ::the actions are :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/quicksort.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/prisoners.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/negatedEvents.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/negatedEvents-FS.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/loanAgreementPostConditionsRTbase.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/loanAgreementPostConditionsRT.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/loanAgreementPostConditionsRT.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/loanAgreementPostConditions.pl ::actions legal_action_against/1, terminate_correctly, cancel. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/loan_agreement.pl ::actions legal_action_against/1, potential_default_occurs/1, T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/goat.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/deliveryDelay.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/consolidatedLoan.pl ::fluents requested/3, advanced/2, legal_action_against/1, terminated. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/concurrentTowers.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/burning.pl ::fluents burning(_X,_Y). actions ignite(_X,_Y). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/bankTransfer.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/CLOUT_workshop/ballot.pl ::% by adding a ballot identifier as an extra parameter of all the events, fluents and actions. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps2.sav/examples/bank account_terse.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/states_explorer.pl :: ::- use_module('../engine/interpreter.P',[flat_sequence/2, action_/1, event_pred/1, abstract_numbers/2, user_prolog_clause/2]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/redisclient.pl :: ::- multifile interpreter ::premature_system_action/1. % LPS engine hook T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysLate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysEarlyTricky.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseNoComplications.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerDefaults.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCuresRep.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/utils/explanator.pl ::action(X) ::- lps_program_module(M), catch(M ::action(X),_,fail). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/swish/user_module_swish.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/swish/user_module_repl.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/swish/user_module_base.pl ::swish_highlight ::style(action,action,[text,base(atom)]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/swish/lps_server_UI.pl :: interpreter ::query_thread(LPS_ID, lps_server_UI ::provide_events_get_fluents_events_actions(InputEvents,Timeless,_Result), Cycle, Result), T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/prolog/lps_syntax.pl :: op(1050,fx,actions), T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/prolog/dialect/lps.pl :: op(1050,fx,(Module ::actions)), T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/tictactoe.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/slamodel.pl ::% this is automatically achieved with condition-action rules T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/party_minimal.pl ::% the askMoney action is not firing because the timeless predicate parent's second solution is not being considered T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/oneprisoner.pl ::% There is some action better than A1 in the context of B1, B2, P and Q. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/lps_dialect_test.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/goat.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/unserializedDice.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/two_initiate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/terminator.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/terminator.pl ::% Demo lps_terminate action, and Prolog system "output predicate" called as an action T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/switchingWithTimeExpression.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/sos.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/simulatedTimeCompositeEvent2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/simulatedTimeCompositeEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/simulatedTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/serializedDice.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/RockPaperScissors-3players.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/RockPaperScissors-3players.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/RockPaperScissors-3players-badFluent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/RockPaperScissors-3players-badFluent.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/realTimeObservations.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/real_time_constants.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/prospectiveGoat2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/paralellConjunctions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/neverEndingEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/negatedFluentShouldNotSucceed.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/negatedFluentShouldNotSucceed.pl ::then legal_action_against(lender) from T3. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/negatedFluentInConjunction.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/meta.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/intensFluentBindingTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/inLineTimeExpressions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/implicitTimeOrdering.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/if_then_else_with_writes.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/if_then_else_with_writes.pl :: % specified timewise, and the IF subgoal would NOT be assumed adjacent to the terminate action above T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/if_then_else.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/if_then.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/futuresContractFailing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/futuresContractCompliant.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/fluentInCompositeEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/fluentAfterEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/fluentAfterEvent.pl ::actions legal_action_against(_). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/fariba_sam_bug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/failBetter.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/externalPrologEvents.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/externalPrologEvents.pl ::% no facts here please, otherwise they'll be taken as macro action clauses :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/external_stuff.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/editingActions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/compositeInitiateBug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/compositeEventsInPostConditions.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/compositeEventInconsistency.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/compositeEventInconsistency.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/changingFluentInAntecedent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/BugEndingWithSimulatedRealTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bobObservationBug.pl_.P.lpst.bak :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bobObservationBug.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bobObservationBug.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bankTransfer2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bankTransfer1.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bankDoubleTransfer.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bankDoubleTransfer.pl ::% following commented out :: all actions are serialised, producing cumulative effects IF using updates T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/bank_transferWithhappened.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/ballotTest.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/badlight2.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/backtrackingAcrossCycles.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/forTesting/authoriseCard.pl ::?- go(Timeline,[more_actions]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/external_interfaces/myJavaHook.pl :: % interpreter ::option(cycle_hook(my_hook,Fluents,Actions)), % only one hook, but check name anyway T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/external_interfaces/myHook.pl :: go(YourProgram,[...,cycle_hook(my_hook,FluentTemplates,ActionTemplates),..]) T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/ethereumAntecedent.pl ::% Reactive rule antecedents cannot execute actions, they consume events. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/dining_philosophers_terse.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/use_insulin.pl ::% Events and actions take place between cycles, and fluents hold during cycles. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/turingTest.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_insurance_tricky_claim.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_insurance_normal_claim.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_insurance_noncompliant.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_insurance_irrelevant_events.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_insurance_foreclosing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_insurance_eternal.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_futures_failing.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/SzaboLanguage_futures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/sos.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/sortWithTime.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/smartHomePrimitives.pl :: (actions = [ json([ (tag = 'ict.HueLight01.onoff'), T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/simulation/SimulationKit.pl ::% This postcondition must be used, rather than a simple update "anonymous action", for serializability, T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/simulation/cookingMachine.pl ::% "if true at T then ..." is a way to "observe" (e.g. request to perform) a composite event/action T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/simulateExternalEvent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/simulateExternalEvent.pl ::actions some_action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissorsServer.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissorsServer-noProspectivePCs.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissorsEthereum.pl ::pay(Player,Prize) from T1 to T3 if % plan / macro action on the blockchain T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissorsBaseEN.pl ::the actions are :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissorsBase.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissors.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissors.pl ::actions send(_Winner,_Prize). % actions are serialisable by default T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/RockPaperScissors-Minimal-en.pl ::the actions are :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/quicksort.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/prisoners.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/negatedEvents.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/negatedEvents-FS.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/loanAgreementPostConditionsRTbase.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/loanAgreementPostConditionsRT.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/loanAgreementPostConditionsRT.pl ::actions legal_action_against/1, terminate_correctly, cancel, potential_default/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/loanAgreementPostConditions.pl ::actions legal_action_against/1, terminate_correctly, cancel. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/loan_agreement.pl ::actions legal_action_against/1, potential_default_occurs/1, T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/goat.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/fireSimple.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/fireRecurrent.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/diningPhilosophers.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/deliveryDelay.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/consolidatedLoan.pl ::fluents requested/3, advanced/2, legal_action_against/1, terminated. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/concurrentTowers.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/burning.pl ::fluents burning(_X,_Y). actions ignite(_X,_Y). T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/bubbleSort.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/bankTransfer.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/ballot.pl ::% by adding a ballot identifier as an extra parameter of all the events, fluents and actions. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/CLOUT_workshop/badlight.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_lps/examples/bank account_terse.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/prolog_files/dtp.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/prolog_files/delrob_sitc.pl ::% ACTION PRECONDITIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/prolog_files/delrob/delrob_strips_PMG.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/prolog_files/delrob/delrob_strips.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/prolog_files/delrob/delrob_strips.pl :: ::- use_module(library(planner_api)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/prolog_files/delrob/delrob_sitc.pl ::% ACTION PRECONDITIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/ZenoTravel/zeon.pl ::% action(zoom(_,_,_,_,_,_)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/wa-star.pl ::a_star(+InitState, -Actions, -Cost). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/readFile.pl ::%%% ( ::requirements ::strips ::typing ::action-costs) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/parseDomain.pl ::%% [strips, typing, 'action-costs'], T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/iddfs.pl ::%% Solution is a list of actions obtained from ActionDef of predicate step. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/h_maxb.pl :: get_action(A), get_precondition(A, P), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/h_max.pl :: get_action(A), get_precondition(A, P), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/h_addb.pl :: get_action(A), get_precondition(A, P), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/h_add.pl :: get_action(A), get_precondition(A, P), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/forward.pl ::%% step(+State, -ActionDef, -NewState) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/dfs.pl ::%% Solution is a list of actions obtained from ActionDef of predicate step. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/common.pl ::% This file contain common predicates that are used in planners T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/common.pl :: get_actions(D, A), bb_put(actions, A), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/bfs.pl ::%% Solution is a list of actions obtained from ActionDef of predicate step. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/backward.pl ::%% step(+State, -ActionDef, -NewState) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/backward-lifted.pl ::%% step(+State, -ActionDef, -NewState) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_tests/orig_pddl_parser/a-star.pl ::%bfs(+InitState, -Actions, -Cost). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_reader/readFile.pl ::%%% ( ::requirements ::strips ::typing ::action-costs) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/pddl_reader/parseDomain.pl ::%% [strips, typing, 'action-costs'], T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/Tezos game.pl ::% Here the transfer action only affects the balance in the smart contract. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/Tezos game revised.pl :: * Here is an alternative approach, in which the action initiates the fluent. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/take insulin.pl ::% Events and actions take place between cycles, and fluents hold during cycles. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/Solomon and the two women.pl ::% Action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/simplified checkout.pl ::% without the constraint, it executes both enter actions simultaneously. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/simple conveyor.pl ::% Here startConveyor and stopConveyor are external actions. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/self-drivers.pl ::% LPS uses a simple event-calculus-like ontology of fluents, and events, which include actions :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/New Tezos.pl ::% Here the transfer action only affects the balance in the smart contract. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/need insulin.pl ::% This rule is a goal, which generates actions to make itself true :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/Jeinfferson Bernal.pl ::%actions :: expresion atomica que se realiza instantaneamente y son generadas por T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/insurance.pl ::% action to(holder, foreclose(_,_)). doesn't work. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/initiating more actions.pl ::?- go(T, [more_actions]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/end of day.pl ::fluents legal_action_against/1, due_payable/2, paid/4. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/end of daay.pl ::fluents legal_action_against/1, due_payable/2, paid/4. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/cooking.pl ::% This postcondition must be used, rather than a simple update "anonymous action", for serializability, T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/consolidated loan.pl ::fluents requested/3, advanced/2, legal_action_against/1, terminated. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/checkout with more_actions.pl ::?- go(T, [more_actions]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/arrival_español.pl ::%actions :: expresion atomica que se realiza instantaneamente y son generadas por T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/lps_user_examples/arrival_español(1).pl ::%actions :: expresion atomica que se realiza instantaneamente y son generadas por T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/iwfms/loopReduction.pl ::reduceLoops(Actions, Ordering, FinalOrdering) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/iwfms/eventCalculusPlanner.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/iwfms/eventCalculusPlanner.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/testC.e.pl :: ::- use_module(library(ec_planner/ec_loader)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/TestBoxRoom.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/Story1.e',47). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_np_box_agent.e.pl ::% init_why(after('/opt/logicmoo_workspace/packs_sys/small_adventure_games/prolog/episodic_memory/planner/ec_reader.pl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_c.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_b.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_a.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_9.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_8.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_7.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_6.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_5.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_4.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_3.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_2.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/test_mail_1.pl ::/* There should probably be some releases clauses for compound actions */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/Story1.pel :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/sanity_equals_04.e',39). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/sanity_equals_04.pel :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/sanity_equals_03.e',39). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/sanity_equals_03.pel :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/sanity_equals_02.e',39). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/sanity_equals_02.pel :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/sanity_equals_01.e',39). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/sanity_equals_01_extra.pl ::% From /opt/logicmoo_workspace/packs_sys/small_adventure_games/prolog/ec_planner/ectest/sanity_equals_01.e ::34 T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/sanity_equals_01.pel :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/Example4.e',27). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/Example4.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/Example3.e',25). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/Example3.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/Example2.e',25). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/Example2.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/Example1.e',30). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/Example1a.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_includes.e',257). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/Example1.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/Example1a.e',43). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_includes.e.pl ::% sort rule,subject,object,action,ruleeffect,policy,policyset T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_includes.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_foundations.e',262). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_foundations.e.pl :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_examples.e',9038). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_examples.pel ::%; title = "Reasoning about action \uppercase{I} :: \uppercase{A} possible worlds approach", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_examples.pel :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_ecnet.e',4640). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/ec_reader_test_ecnet.pel :: ::-was_s_l('/pack/logicmoo_ec/test/ec_planner/ectest/ec_reader_test.e',4647). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/ec_planner/ectest/ec_reader_test.pel :: '/pack/logicmoo_ec/test/ec_planner/ectest/ec_reader_test.pel')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/domains_ocl/tyreLM.pl :: * This tyre domain has extra objects and actions. Now, instead of just two T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/domains_ocl/translogLM.pl :: * This model captures the object structure and actions in a "transport T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/domains_ocl/translog4_problems.pl ::This model captures the object structure and actions in a "transport T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/domains_ocl/translog4_domain.pl ::This model captures the object structure and actions in a "transport T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/domains_ocl/ocl_files/chameleonworld.pddl.P :: [ action(takeoutflex, T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/test/bounty0500_tests.pl ::root@gitlab ::/opt/logicmoo_workspace/packs_sys/planner_api# cd t T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/planner_api.pl ::/* Part of Optic Planner interface for SWI-Prolog T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/planner_api.pl ::" ::typing" | " ::strips" | " ::equality" | " ::fluents" | " ::durative-actions" | " ::duration-inequalities" | " ::numeric-fluents" | " ::action-costs" | " ::adl" | " ::negative-preconditions" | " ::disjunctive-preconditions" | " ::existential-preconditions" | "universal-preconditions" | "quantified-preconditions" | " ::conditional-effects" | " ::timed-initial-literals" | " ::preferences" | " ::constraints" T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/lps_pddl/lps_pddl_convert.pl.bak ::is_pddl_special([axiom,'durative-action'],'always'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/lps_pddl/lps_pddl_convert.pl.bak :: ::- use_module(library(ec_planner/ec_lps_convert)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/lps_pddl/lps_pddl_convert.pl ::is_pddl_special([axiom,'durative-action'],'always'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/lps_pddl/lps_pddl_convert.pl :: ::- use_module(library(ec_planner/ec_lps_convert)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_planner.pl :: ::- module(logicmoo_planner,[load_planner_api/0]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_planner.pl :: ::- show_call(record_time(forall(between(1,1000000,_),forall(get_action_bb(_),true)),_Time1)), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_ocl.pl :: ::- use_module(logicmoo_planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_lps.pl :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_lps.pl :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_icl.pl :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_flp.pl :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_ec.pl :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/logicmoo_dec.pl :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/rsasak_pddl_parser.pl :: ::- use_module(library(logicmoo_planner)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/rsasak_pddl_parser.pl :: ::- decl_struct(domain(domain_name, requires, types, constants, predicates, functions, constraints, actions, dict(extraprops))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/rsasak_forward_wa_star_h_add.pl :: ::- use_module(library(logicmoo_planner)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/rsasak_forward_wa_star_h_add.pl :: ::- decl_struct(domain(domain_name, requires, types, constants, predicates, functions, constraints, actions, dict(extraprops))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/olprecede.pl ::% if NOT the action wouldn't be able to add both T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/ocl2pddlX.pl :: planner_task(Num,Goal,Ini), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/ocl2pddlX.pl :: do_action, T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/ocl2pddl_p.pl :: planner_task(Num,Goal,Ini), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/ocl2pddl.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/ocl2pddl.pl :: planner_task(Num,Goal,Ini), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/ob_utils.pl ::Utilities for object-centred planner 4/11/96 T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/hyhtn_code3.pl ::% Pre is the ground states before the action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/hyhtn_code3.pl :: planner_interface(Goal,Init,Sol,_,TNLst), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/hyhtn_code2.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/hyhtn_code2.pl :: planner_interface(Goal,Init,Sol,_,TNLst), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/hyhtn_code1.pl ::%0-2. if it is an achieve action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/hyhtn_code1.pl :: planner_interface(Goal,Init,Sol,_), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/groundCE.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/gentasks.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/gentasks.pl :: nl, write('planner_task('), write(TaskNo), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/Forward.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/Forward.pl :: planner_task(Id,Goal,Init), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/ptools/compile.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/pddl_as_ocl.pl :: locally(t_l ::other_planner(hyhtn_solve), record_time(try_solve(PName, D,P,S),SolverTime)), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/pddl_as_ocl.pl :: prop_get(actions,D,A), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_works.pl :: ::- ensure_loaded(library(planner_api)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_works.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_old.pl ::%0-2. if it is an achieve action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_old.pl :: ::- ensure_loaded(library(planner_api)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_new.pl :: ::- ensure_loaded(library(planner_api)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_new.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_lm.pl ::% Pre is the ground states before the action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_lm.pl :: planner_interface(Goal,Init,Sol,_,TNLst), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code3.pl ::% Pre is the ground states before the action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code3.pl :: planner_interface(Goal,Init,Sol,_,TNLst), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code2.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code2.pl :: planner_interface(Goal,Init,Sol,_,TNLst), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code1.pl ::%0-2. if it is an achieve action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code1.pl :: planner_interface(Goal,Init,Sol,_), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code.pl :: ::- ensure_loaded(library(planner_api)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/hyhtn_code.pl :: * action of contract, negligence or other tortious action, arising out of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/htncode.pl ::%0-2. if it is an achieve action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/hyhtn_pddl/htncode.pl :: ::- ensure_loaded(library(planner_api)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/survival_game.pl ::/* Preconditions to ensure a unit cannot do to actions at once */ T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/planner19a.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/planner19a.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/planner115.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/planner115.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/eventCalculusPlannerDMiles_OLD.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/eventCalculusPlannerDMiles_OLD.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/eventCalculusPlannerDMiles.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/eventCalculusPlannerDMiles.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_test_incl.pl ::% ::- consult(planner19a). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_reader_no_lps.pl ::relative_from(D) ::- expand_file_search_path(library(ec_planner),D),exists_directory(D). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_reader.pl :: format(Outs,'~N~q.~n',[( ::- include(library('ec_planner/ec_test_incl')))]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_planner_dmiles.pl :: ::- include('planner115.pl'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_lps_convert_advice.pl ::% LPS :: actions(sample(_20552)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_lps_convert.pl :: ::- use_module(library(ec_planner/ec_loader)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_lps_convert.pl :: setup_call_cleanup(push_operators(M ::[op(900, fy, M ::not), op(1200, xfx, M ::then), op(1185, fx, M ::if), op(1190, xfx, M ::if), op(1100, xfy, M ::else), op(1050, xfx, M ::terminates), op(1050, xfx, M ::initiates), op(1050, xfx, M ::updates), op(1050, fx, M ::observe), op(1050, fx, M ::false), op(1050, fx, M ::initially), op(1050, fx, M ::fluents), op(1050, fx, M ::events), op(1050, fx, M ::prolog_events), op(1050, fx, M ::actions), op(1050, fx, M ::unserializable), op(999, fx, M ::update), op(999, fx, M ::initiate), op(999, fx, M ::terminate), op(997, xfx, M ::in), op(995, xfx, M ::at), op(995, xfx, M ::during), op(995, xfx, M ::from), op(994, xfx, M ::to), op(1050, xfy, M :: :: ::), op(1200, xfx, M ::(<-)), op(1050, fx, M ::(<-)), op(700, xfx, M :: <=)],Undo), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_loader.pl ::arg_info(domain,action,arginfo). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_loader.pl ::% ::- reexport(library('ec_planner/ec_planner_dmiles')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner/ec_common.pl :: ::- reexport(library(ec_planner/ec_loader)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/code_icl/dtp.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ccalc/cchelp.pl :: write(' in either action language C+ or the language of causal theories. The'), nl, T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ccalc/ccalc.pl :: ( value(additive_detected,true) % if additive fluent or action is detected T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/pack.pl ::title('Logicmoo Event Calc -- A SWI-Prolog Pack that lets Prolog code seamlessly use planners speaking :: LPS, Decreasoner EventCalc, PDDLish and OCLh'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/Tom/Src/nnf.pl ::This is an empty filter. No action is performed except that terms are T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/theorist/cilog_code/ch8/strips_strips.pl ::% U0 is the bound on the number of actions going into achieve_all T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/theorist/cilog_code/ch8/strips_strips.pl ::% A SIMPLE STRIPS PLANNER USING STRIPS NOTATION T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/theorist/cilog_code/ch8/regr_strips_sim.pl ::% A SIMPLE REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/theorist/cilog_code/ch8/regr_strips.pl ::% A REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/theorist/cilog_code/ch8/delrob_strips.pl ::% ACTIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/theorist/cilog_code/ch8/delrob_sitc.pl ::% ACTION PRECONDITIONS T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/PKnows-0.9.9/sitcalc.pl ::% action_with_vars(A,Vs) - get an action term with variable arguments T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/PKnows-0.9.9/domain.pl ::% paper "Common Knowledge, Hidden Actions, and the Frame Problem", as T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/trim_optic_clp.pl :: # 0 :: (ACTION1 OBJ1 OBJ2) [1] T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/sharedPDDL2.2Domain.pl ::require_key('durative-actions') --> [' ::durative-actions']. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/readFileI.pl ::%%% ( ::requirements ::strips ::typing ::action-costs) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/readFile.pl ::%%% ( ::requirements ::strips ::typing ::action-costs) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/pddl_wrapper.pl ::actions(domain(A,B,C,D,E,F),Action) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/parseSolutionLPGTD.pl ::%% plan_step(P) --> mfloat(T), [ ::], ['('], action(A), oneOrMore(action_argument, Args), [')'], ['['], mfloat(D), [']'], {P = [T,A,Args,D]}. T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/parseSolutionLPGTD.pl :: currentPlanner(Planner), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/parser.pl :: currentPlanner(Planner), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/parseDomainVerb.pl ::%% [strips, typing, 'action-costs'], T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/parseDomainPDDL2.2.pl ::%% [strips, typing, 'action-costs'], T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/normal_form.pl :: currentPlanner(Planner), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/iem_parser.pl :: actionNLGTemplates(List), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/iem.pl :: findall(at(Start,action(start,Term)),(member([Start,Action,Arguments,_],Steps),Term =.. [Action|Arguments]),ActionStarts), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/generate_glosses.pl ::%% [preconditions,['at start'(locked('$VAR'('Lo'))),'at start'(at('$VAR'('P'),'$VAR'('L'))),'at start'(at('$VAR'('Lo'),'$VAR'('L')))],effects,['at end'(not(locked('$VAR'('Lo')))),'at end'([assign(actions,op(+,actions,1))])]] T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/flp_convert_pl_to_verb.pl :: fixActions(TmpActions,Actions), T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/failure_modes.pl ::listModesForAction(Parsed,Action,Modes) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/configuration.pl ::currentPlanner(Planner) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/flp/baseKB.pl ::atTime(['2017'-'6'-'10','19' ::'55' ::'44.011715584'],completed(tell(freeLifePlanner,andrewDougherty,recurrenceFn([action('Andy should pick up the Bluetooth keyboard in the townhomeofeleanorandandrewandmeredith'),itemDateTime(['2017'-'4'-'20','15' ::'15' ::'1']),recurrenceDateTime(['2017'-'4'-'20','15' ::'15' ::'1.999999999']),type(planStep(start))])))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/sorts.pel ::% sort rule,subject,object,action,ruleeffect,policy,policyset T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/sorts.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/RulesPatterns/targetHolds.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/RulesPatterns/ruleOutput.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/RulesPatterns/ruleModel.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/RulesPatterns/ConditionsVerification.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/PolicySetPatterns/policySetModel.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/PolicyPatterns/policyModel.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/ordering.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/input.pel ::% action Get T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/includes/SaaSPatterns/input.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/foundations/Root.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/foundations/ECTraj.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/foundations/ECCausal.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/foundations/EC.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/foundations/DEC.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1999/ThielscherCircuit.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1999/RussianTurkey.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1999/Happy.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1999/CoinToss.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1999/ChessBoard.pel ::%; title = "Actions with indirect effects (preliminary report)", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1999/ChessBoard.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1997/Yale.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1997/Supermarket.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1997/StuffyRoom.pel ::%; title = "Reasoning about action \uppercase{I} :: \uppercase{A} possible worlds approach", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1997/StuffyRoom.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1997/StolenCar.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1997/DeadOrAlive.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Shanahan1997/BusRide.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ReiterCriscuolo1981/NixonDiamond2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ReiterCriscuolo1981/NixonDiamond1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Exercises/TelephoneBugs.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Exercises/TeacherTells.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Exercises/SnoozeAlarm.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Exercises/MixingPaints.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Exercises/Counter.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter9/RunningAndDriving.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter9/RouletteWheel.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter8/PatHeadRubStomach.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter8/MovingRobot.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter8/CameraWithFlash.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter7/HotAirBalloon.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter7/FallingObjectWithEvents.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter7/FallingObjectWithAntiTrajectory.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter6/ThielscherCircuit2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter6/ThielscherCircuit1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter6/ShanahanCircuit.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter6/CarryingABook2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter6/CarryingABook1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter4/BankAccountServiceFee.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter4/AlarmClock.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter3/Telephone2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter3/Telephone1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Sleep4.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Sleep3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Sleep2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Sleep1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Inconsistency4.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Inconsistency3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Inconsistency2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter2/Inconsistency1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter14/Workflow.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter14/Vision.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter14/NetBill3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter14/NetBill2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter14/NetBill1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter13/Postdiction.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter13/ModelFinding.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter13/Deduction2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter13/Deduction1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter13/Abduction.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter12/MethodD.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter12/MethodB.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter12/ErraticDevice.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter12/Device.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter12/DefaultLocation.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter12/DefaultEvent.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter12/BrokenDevice.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter11/Lottery.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter11/HungryCat.pfc :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter11/HungryCat.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter10/TwoScreens.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter10/OneScreen.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2006/Chapter10/MovingNewspaperAndBox.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/TV2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/TV1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/RunningAndDriving2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/RunningAndDriving1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/RouletteWheel.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/PickUp.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/OffOn.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/Leaf.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004b/Approve.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004a/Leaf.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Mueller2004a/Holding.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/MillerShanahan2002/Bowl.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Manual/Example4.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Manual/Example3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Manual/Example2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Manual/Example1a.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Manual/Example1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/GiunchigliaEtAl2004/MonkeyPrediction.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/GiunchigliaEtAl2004/MonkeyPostdiction.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/GiunchigliaEtAl2004/MonkeyPlanning.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/GiunchigliaEtAl2004/MonkeyBananas.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/FrankEtAl2003/Story1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/FrankEtAl2003/FrankEtAl.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Yale40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Yale3-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/WalkingTurkey40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/WalkingTurkey3-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/ThielscherCircuit40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/ThielscherCircuit20-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/ThielscherCircuit1-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Telephone40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Telephone3-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Supermarket40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Supermarket12-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/StuffyRoom40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/StuffyRoom2-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/StolenCar40-ea.pel ::%; Action Precondition axiom added T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/StolenCar40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/StolenCar2-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/RussianTurkey40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/RussianTurkey4-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/KitchenSink_M5-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/KitchenSink_M40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/KitchenSink_M25-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/HotAirBalloon40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/HotAirBalloon3-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/HotAirBalloon20-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/HotAirBalloon15-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Happy40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Happy2-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/FallingObjectWithEvents5-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/FallingObjectWithEvents40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/FallingObjectWithEvents25-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/FallingObjectWithEvents20-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/FallingObjectWithAntiTrajectory5-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/FallingObjectWithAntiTrajectory25-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/FallingObjectWithAntiTrajectory15-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/DeadOrAlive40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/DeadOrAlive3-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/Commuter15-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/CoinToss40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/CoinToss4-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/ChessBoard40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/ChessBoard2-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/BusRide40-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp/BusRide2-ea.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Yale40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Yale3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/ThielscherCircuit40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/ThielscherCircuit20.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/ThielscherCircuit1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Telephone40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Telephone3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Supermarket40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Supermarket12.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/StuffyRoom40.pel ::%; title = "Reasoning about action \uppercase{I} :: \uppercase{A} possible worlds approach", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/StuffyRoom40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/StuffyRoom2.pel ::%; title = "Reasoning about action \uppercase{I} :: \uppercase{A} possible worlds approach", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/StuffyRoom2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/StolenCar40.pel ::%; Action Precondition axiom added T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/StolenCar40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/StolenCar2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Sleep_Postdiction.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Sleep_Planning.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Sleep.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/RussianTurkey40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/RussianTurkey4.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/PickUp.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Pendulum_Prediction.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/KitchenSink_M5.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/KitchenSink_M25.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/KitchenSink.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/HotAirBalloon3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/HotAirBalloon20.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/HotAirBalloon15.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Happy40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/Happy2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/FallingObjectWithEvents5.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/FallingObjectWithEvents25.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/FallingObjectWithEvents20.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/FallingObjectWithAntiTrajectory5.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/FallingObjectWithAntiTrajectory15.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/DeadOrAlive40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/DeadOrAlive3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/CoinToss40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/CoinToss4.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/ChessBoard40.pel ::%; title = "Actions with indirect effects (preliminary report)", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/ChessBoard40.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/ChessBoard2.pel ::%; title = "Actions with indirect effects (preliminary report)", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/ecasp-decreasoner/ChessBoard2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Cassimatis2002/TwoScreens.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Cassimatis2002/PolySpace.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Cassimatis2002/OneScreen.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/BrewkaDixKonolige1997/Wine.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Antoniou1997/Student.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/Antoniou1997/Dropout.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooWorld.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest6.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest5.2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest5.1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest4.2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest4.1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest3.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest2.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/examples/AkmanEtAl2004/ZooTest1.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/XWalk.pel ::%; title = "Knowledge-based Action Representations for Metaphor and Aspect (\uppercase{KARMA})", T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/XWalk.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/WritingABook.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Vision.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Vehicle.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/TimeDelayBombing.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/TakingAWalk.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/TakingATrain.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/SpeechAct.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Smoking.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Smoke.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/SmallFire.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Sleeping.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Sleep.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/ShootingAttack.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/RTSpace.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/RidingInACarriage.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Restaurant.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Rest.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/RepRest.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/ReadingALetter.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/ReadingABook.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Rain.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/PolySpace.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/PlayNeed.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/OTSpace.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Ontology.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/OMSpace.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Money.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/MakingAnAcquaintance.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Kidnapping.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/IPRel.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/HungerNeed.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/HandTo.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Gun.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/GSpace.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Fire.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Feeling.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/EatingInAHouse.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Dress.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Diving.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/CTime.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Container.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Condition.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Cognition.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Book.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Bomb.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Baseball.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/ec_sources/ecnet/Arson.pel :: ::-include(library('ec_planner/ec_test_incl')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/aiswi/sciff/svg.pl ::user ::debugger_command_hook(unknown([115,118,103],_), Actions) ::- % Command :: svg T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/aiswi/sciff/sciff.pl :: pending(e(F,do(X,X,Rec,Action,D),T)) T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/ext/aiswi/sciff/quant.pl ::%debugger_command_hook(unknown([113,117,97,110,116,105,102],Warning),Actions) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/transplan.ps.txt ::that part of the definition of a feasible action in the domain involves the use of T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/transplan.ps.txt ::purely "classical," in that all actions are under the control of the planner, and T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/PDDL opt-manual.pdf.txt ::prover, a planner [?], and a plan checker. The description of these systems and their APIs is beyond T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/PDDL opt-manual.pdf.txt ::5 Actions 21 T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/PDDL 2.1.pdf.txt ::guage along with a number of new problems and domains that challenged existing planners T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/PDDL 2.1.pdf.txt :: 2. Actions with durations T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/kbcs00.ps.txt ::propositions are clustered around objects, and actions change the state of objects [11]. Rather T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/kbcs00.ps.txt ::algorithm that can perform well on all problems in all domains. In practice, many planners T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/ai05.pdf.txt ::Sometimes things get even worse as extra actions need to be introduced or action T:/opt/logicmoo_workspace/packs_sys/logicmoo_ec/docs/ai05.pdf.txt ::icates is needed for planners to handle real-world domains effectively. Many researchers T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/SHRDLU.plgCG ::Universal > Person, Object, Action, Attribute, Proposition. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Prg92SHRDLU.plgCG ::Universal > Personne, Objet, Action, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Prg8Obj1.prlg ::Universal > Animate, Inanimate, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Prg8Obj1.plgCG ::Universal > Animate, Inanimate, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Prg6OperCG.prlg ::Universal > Person, Animal, Action, Situation, Object, AbstractEntity, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Prg6OperCG.plgCG ::Universal > Person, Animal, Action, Situation, Object, AbstractEntity, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Prg5ESCG.plgCG ::Universal > Objet, Animal, Personne, Action, Etat, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Prg3MMPrg.plgCG ::Universal > Entity, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/Prg7PrgPrlgCG.plgCG ::Universal > Person, Action, Object, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/Prg1xCGEx.prlg ::Universal > Person, Action, Object. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/Prg1xCGEx.plgCG ::Universal > Person, Action, Object. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg92SHRDLU.plgCG ::Universal > Personne, Objet, Action, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg8Obj1.prlg ::Universal > Animate, Inanimate, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg8Obj1.plgCG ::Universal > Animate, Inanimate, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg6OperCG.prlg ::Universal > Person, Animal, Action, Situation, Object, AbstractEntity, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg6OperCG.plgCG ::Universal > Person, Animal, Action, Situation, Object, AbstractEntity, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg5ESCG.plgCG ::Universal > Objet, Animal, Personne, Action, Etat, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg3MM.prlg ::Universal > Entity, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ICCSDemo/ICCSDemoPres/Prg3MM.plgCG ::Universal > Entity, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Examples/SHRDLU.plgCG ::Universal > Person, Object, Action, Attribute, Proposition. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Examples/Prg92SHRDLU.plgCG ::Universal > Personne, Objet, Action, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Examples/Prg8Obj1.plgCG ::Universal > Animate, Inanimate, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Examples/Prg6OperCG.plgCG ::Universal > Person, Animal, Action, Situation, Object, AbstractEntity, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Examples/Prg5ESCG.plgCG ::Universal > Objet, Animal, Personne, Action, Etat, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Examples/Prg3MMPrg.plgCG ::Universal > Entity, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/Examples/ESCGAnimalEng.plgCG ::Universal > Object, Animal, Person, Action, State, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/ESCGAnimalEng.plgCG ::Universal > Object, Animal, Person, Action, State, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/AAU/macbeth2.plgCG ::// Subsuming action T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Samples/AAU/macbeth.plgCG ::// Subsuming action T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/PrologSamples/Singe_Banane.pcg ::// actions :: regles de comportement T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/PrologSamples/PrologKarim/robot.pcg :: groupe_verbal(_Action, _Direction, _Origine, _GV, _S, _U), T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/NLP/QuestionAnswering.pcg ::// a) temporal structure represented here by "after" relation which specify the temporal succession of actions, events, and states. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/NLP/Analysis.pcg ::imperative_sentence(P, [Action = G]-modalityOf->[Modality = imperative]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ShrdluNabil/SHRDLU_EnglishGrammar.pcg ::ImperativeSentence(P, [Action = G]-modalityOf->[Modality = imperative]) ::- ActiveVP(P, ["."], G). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ShrdluNabil/SHRDLU.pcg ::ImperativeSentence(P, [Action = G]-modalityOf->[Modality = imperative]) ::- ActiveVP(P, ["."], G). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ShrdluNabil/Semantic.pcg :: branchOfCG(B_Branch, [Action]-agnt->[X], G), T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ShrdluNabil/Lexicon.pcg.bak :: -for->[Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ShrdluNabil/Lexicon.pcg :: -for->[Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Shrdlu/SHRDLU4.pcg ::imperative_sentence(P, [Action = G]-modalityOf->[Modality = imperative]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Shrdlu/SHRDLU3.pcg ::imperative_sentence(P, [Action = G]-modalityOf->[Modality = imperative]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Shrdlu/SHRDLU2.pcg ::// **** Interpretation of the semantic :: it can be action or goals to perform, like the following :: T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Shrdlu/SHRDLU.plgCG :: branchOfCG(B_Branch, [Action]-agnt->[X], G), T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/SHRDLU.plgCG ::Universal > Person, Object, Action, Attribute, Proposition. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Prg92SHRDLU.plgCG ::Universal > Personne, Objet, Action, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Omar/archives/animal.pcg ::// - call the action Move to the target position T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Omar/archives/animal functions.pcg ::// Description of the primitive action Eat T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/Omar/animal functions.pcg ::// Description of the primitive action Eat T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ICCSDemo/Prg7PrgPrlgCG.plgCG ::Universal > Person, Action, Object, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ICCSDemo/Prg1xCGEx.prlg ::Universal > Person, Action, Object. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ICCSDemo/ICCSDemoPres/Prg92SHRDLU.plgCG ::Universal > Personne, Objet, Action, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ICCSDemo/ICCSDemoPres/Prg8Obj1.prlg ::Universal > Animate, Inanimate, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ICCSDemo/ICCSDemoPres/Prg6OperCG.prlg ::Universal > Person, Animal, Action, Situation, Object, AbstractEntity, Attribute. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ICCSDemo/ICCSDemoPres/Prg5ESCG.plgCG ::Universal > Objet, Animal, Personne, Action, Etat, Attribut. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/ICCSDemo/ICCSDemoPres/Prg3MM.prlg ::Universal > Entity, Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/prologPlusCG/Archives/AnalyseSemSimon.plgCG ::adv(bien, S, E) ::- eq(S, [Action] - T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/ontology/ontBasedOnACEOntology/aceOntDom_clex.pl ::noun_pl(planners, planner, neutr). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/ontology/ontBasedOnACEOntology/aceOntDom_clex.pl ::adj_itr('delayed-action', 'delayed-action'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/cgworld/example/level2.pl ::cg(404,[cgr(dest,[40,45],_),cgr(inst,[40,46],_),cgr(rslt,[40,51],_)],[],[fs(kind,body_of_context),fs(comment,'This action moves the hand to a location')]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/test/cgworld/example/level1.pl ::cg(103,[cgr(at,[6,5],_)],[],[fs(kind,body_of_context),fs(comment,'This action moves the hand to a location')]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/prolog/dialect/plgcg.pl ::Universal > Person, Object, Action, Attribute, Proposition. T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/prolog/cgt/qxp.pl :: [cge_actions], % actions performed by the editor T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/prolog/cgt/cge/dialog.pl ::process_confirm_dialog(Kind, Message, Action) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/prolog/cgt/cge/choice.pl :: choice_action(E, List, Choice, Items, Goal), T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/prolog/cgt/cge/cge_widgets.pl :: callback(g(cge_action(indiv, cge_restrict_type, Editor, only-concept, multiple))), T:/opt/logicmoo_workspace/packs_sys/logicmoo_cg/prolog/cgt/cge/cge_actions.pl :: ( Modified -> Action = map ; Action = unmap ), T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/trypfcall.pl.txt :: ::- dynamic (mpred_action)/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/pfcall-orig.pl.pl.txt :: ::- dynamic (mpred_action)/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/pfc_test1.pl.txt ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/pfc_sanity.pl.txt ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/pfc_info.pl.txt ::which represent conditions/actions which are executed. As a simple T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/pfc.pl :: ::- dynamic (mpred_action)/1. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/na.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/lion.pl ::%% causes(action,state,new_state). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/lion.pfc ::%% causes(action,state,new_state). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/bulbs.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/bulb1.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/pfc/adder.pfc ::% a conflict triggers a Prolog action to resolve it. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/fol/kif_sanity_01.pfc.pl :: (isa ?ACTION PurposefulAction) T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/t/examples/fol/boxlog_sanity_03.pfc.pl ::It achieves goals by inferring that a certain strategy of action is appropriate to achieve the goal. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo_swilib.pl :: (user ::load_library_system(library(logicmoo_planner))), T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo_repl.pl :: action_info/2, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/typesystem/mpred_userkb.pl ::type_action_info/3, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/typesystem/mpred_hooks.pl ::agent_action_queue/3, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/webproxy.pl ::fix_ref_attribute(action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/task_plan.pl ::% hmmm - the actions are inherently Quoted! T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/task_plan.pl :: ::- use_module(planner_run). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/solution_dotgraph.pl :: ::- use_module(planner_dotgraph). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/solution_dotgraph.pl :: action_attribs/4, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/rdf_convert.pl ::pseudo_namespace('inf_', 'http :://www.infraengine.com/planner/', inf). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_run.pl ::%%%% Planner Runtime T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_dotgraph.pl ::action_attributes(Action, Args, [label=Label]) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_dotgraph.pl :: ::- module(planner_dotgraph, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_cs_simple.pl ::%%%% Simple Planner Constraints T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_cs_linear.pl ::%%%% Planner Constraints - Linear Equation Solver T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_convert.pl :: ::- module(planner_convert, [plan_to_gplan/2, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_convert.pl :: Plan = plan(action('$goal', SubActions1, Label), []), T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_cm.pl ::rule_action( rule(X, _, _, _), X). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/planner_cm.pl ::%%%% Planner Compiler T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/pages_planner.pl :: ::- module(pages_planner, [make_item_solution_page/3, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/pages_planner.pl :: [action='/command'], T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/pages_browser.pl :: ::- use_module(pages_planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/pages_browser.pl :: [action='/command'], T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/obj_task.pl :: %% that can be used directly by the planner. T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/obj_task.pl :: task_action_patterns/2, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/obj_inverse.pl :: atom_concat('http :://www.infraengine.com/planner/var/', Varname, V). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/load_just_planner.pl ::%%%% Load Just Planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/graphs_util.pl ::%%%% (such as action_after). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/src/config.pl ::% default_config(planner_dotgraph_fontname, planner, 'Andale_Mono'). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/tptp/infra/lib/documents/doc/planner/examples/examples.pl ::%%%% Examples Descibed in planner_manual.html T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pttp/dbase_i_mpred_pttp_statics.pl ::%%% CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pttp/dbase_i_mpred_pttp_compile_dalit.pl ::%%% CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/plarkc/logicmoo_u_cyc_kb_tinykb.pl ::exactlyAssertedEL_next(comment, resultGenl, "A MetaFunction that is used to specify that a \ngiven collection is a supercollection of any value returned by a given CollectionDenotingFunction (q.v.). (resultGenl COLFUNC COL) means that when COLFUNC is applied to any sequence of arguments ARGS for which it is defined, the resulting value will be a subcollection of COL. That is, (genls (COLFUNC . ARGS) COL) holds. \n

\nFor example, (resultGenl UsingAFn Action) implies that the collection of acts done using any given type of object is a type of action, (resultGenl AttemptingFn PurposefulAction) implies that the attempts at a given type of action constitute a type of purposeful act, and (resultGenl JointTypeBetweenFn Joint-Physical) means that the collection of joints between two given types of things is a type of physical joint. \n

\nSee also resultIsa.", 'UniversalVocabularyMt', vStrDef). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/plarkc/logicmoo_i_cyc_rewriting.pl ::builtin_rn('ActionQualifyingFunction', rtActionQualifyingFunction). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/plarkc/logicmoo_i_cyc_kb.pl ::% Y=verbSemTrans(xIndicateTheWord,X,xTransitiveThatClauseFrame,and(isa('ACTION',eventInformationTransferEvent),informationOrigin('ACTION','SUBJECT'),infoTransferred('ACTION','CLAUSE'))),rtrace(kif_to_boxlog(Y,BL)). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pfc/user_type_barriers.pfc.pl ::ttBarrierStr("Action"). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pfc/system_common.pfc.pl ::% ::- with_no_term_expansions(if_file_exists(use_module(logicmoo(mobs/planner/mpred_i_hyhtn)))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pfc/system_common.pfc.pl :: ::- ain(((baseKB ::action_info(ArgTypes,_)/is_declarations(ArgTypes) ==> vtActionTemplate(ArgTypes)))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pfc/system_basic.pfc.pl ::ttTypeType(ttActionType,comment("Types of actions such PostureChangingAction")). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/prolog.connector/src/org/cs3/prolog/connector/process/process_observe.pl ::% if they need to take additional actions on registration of an observer T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/prolog.connector/src/org/cs3/prolog/connector/internal/process/socket/consult_server.pl :: ( handle_exception(InStream,OutStream,Error,Action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/prolog.connector/org/cs3/prolog/connector/process/process_observe.pl ::% if they need to take additional actions on registration of an observer T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/prolog.connector/org/cs3/prolog/connector/internal/process/socket/consult_server.pl :: ( handle_exception(InStream,OutStream,Error,Action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/process_observe.pl ::% if they need to take additional actions on registration of an observer T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/src/org/cs3/pdt/editor/ui.properties ::org.cs3.pdt.editor.actions.SpyPointActionDelegate.label=Spy point T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/src/org/cs3/pdt/editor/internal/views/testdata/testdata_02.pl :: action(replace(applyT(_call, _execReturn, _forwMethod, _forwReceiver,_origName, _argsInForw,_method))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/src/org/cs3/pdt/editor/internal/views/testdata/testdata_01.pl :: * - actions used by CTs T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/src/org/cs3/pdt/editor/internal/views/testdata/testdata_00.pl :: * - actions used by CTs T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/org/cs3/pdt/editor/ui.properties ::org.cs3.pdt.editor.actions.SpyPointActionDelegate.label=Spy point T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/org/cs3/pdt/editor/internal/views/testdata/testdata_02.pl :: action(replace(applyT(_call, _execReturn, _forwMethod, _forwReceiver,_origName, _argsInForw,_method))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/org/cs3/pdt/editor/internal/views/testdata/testdata_01.pl :: * - actions used by CTs T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.editor/org/cs3/pdt/editor/internal/views/testdata/testdata_00.pl :: * - actions used by CTs T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.connector/org/cs3/prolog/connector/process/process_observe.pl ::% if they need to take additional actions on registration of an observer T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.connector/org/cs3/prolog/connector/internal/process/socket/consult_server.pl :: ( handle_exception(InStream,OutStream,Error,Action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.common/pl/pdt_search_WORK_IN_PROGRESS.pl :: * for "Find All Declarations" (Ctrl+G) action * T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.common/pl/pdt_search.pl :: * for "Find All Declarations" (Ctrl+G) action * T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/pdt.common/pl/callgraph/pdt_prolog_codewalk.pl ::% * undefined(+Action) T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/pdt_server/consult_server.pl :: ( handle_exception(InStream,OutStream,Error,Action), T:/opt/logicmoo_workspace/packs_sys/logicmoo_base/prolog/logicmoo/common_logic/common_logic_loader.pl :: ::- thread_local(t_l ::kif_action_mode/1). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/MIndiGolog/sitcalc.pl ::%% Situation Calculus with Natural Actions. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/MIndiGolog/program.pl ::%% Carry out the necessary sequence of actions to place one object T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/MIndiGolog/mindigolog.pl ::%% Situation Calculus with Natural Actions T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/MIndiGolog/main.pl ::%% Natural Actions, from sitcalc.pl T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/MIndiGolog/domain.pl ::%% in the Concurrent, Temporal Situation Calculus with Natural Actions. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_percept.pl ::stripped_term(MAction, Action) ::- strip_module(MAction, _, Action), MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_implies.pl ::implications(Knower, attempts(_Agent, Action), Preconds, Effects) ::- nonvar(Action), !, implications(Knower, Action, Preconds, Effects). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_examine.pl ::% action = attempts it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_eng2txt.pl :: action_doer(Context, Likely), Agent=Likely. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_eng2cmd_frame.pl :: Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_edit.pl ::% invoke_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_data.pl.bak :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_data.pl.bak :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction, Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_percept.pl ::stripped_term(MAction, Action) ::- strip_module(MAction, _, Action), MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_implies.pl ::implications(Knower, attempts(_Agent, Action), Preconds, Effects) ::- nonvar(Action), !, implications(Knower, Action, Preconds, Effects). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_examine.pl ::% action = attempts it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_eng2txt.pl :: action_doer(Context, Likely), Agent=Likely. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_eng2cmd_frame.pl :: Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_edit.pl ::% invoke_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_data.pl.bak :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_data.pl.bak :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction, Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new3/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_state.pl.bak ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_percept.pl ::stripped_term(MAction, Action) ::- strip_module(MAction, _, Action), MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_implies.pl ::implications(Knower, attempts(_Agent, Action), Preconds, Effects) ::- nonvar(Action), !, implications(Knower, Action, Preconds, Effects). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_examine.pl ::% action = attempts it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_eng2txt.pl :: action_doer(Context, Likely), Agent=Likely. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_eng2cmd_frame.pl :: Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_edit.pl ::% invoke_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_data.pl.bak :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_data.pl.bak :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction, Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new2/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_unused.pro ::action_agent_verb_subject_prep_object(Action, Agent, Verb, Thing, At, Thing2) ::- T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_unused.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_plan.pl :: serialize_plan(Knower, Agent, NewPlan, Actions), !, T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_percept.pl.bak ::stripped_term(MAction, Action) ::- strip_module(MAction, _, Action), MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_percept.pl ::stripped_term(MAction, Action) ::- strip_module(MAction, _, Action), MAction\==Action. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_main.pl.bak :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_implies.pl ::implications(Knower, attempts(_Agent, Action), Preconds, Effects) ::- nonvar(Action), !, implications(Knower, Action, Preconds, Effects). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_examine.pl ::% action = attempts it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_eng2txt.pl :: action_doer(Context, Likely), Agent=Likely. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_eng2cmd_frame.pl :: Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_edit.pl ::% invoke_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction, Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv12.pro ::logical2eng(_Agent, failure(Action), ['Action failed ::', Action]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/episodic_memory.sav_new/adv12.pro ::% bugout(' ADDED ~w to orderings.~n', [before(I, K)], planner). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/agi_lib/pipeline.pl ::%It also may further isolate out the actions and recombine them to perceive them as new action sequences T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/agi_lib/doc_print.pl ::% Ran with (base) root@mail ::/opt/logicmoo_workspace/packs_sys/logicmoo_ec/prolog/ec_planner# swipl -f /opt/logicmoo_workspace/.swiplrc -l ec_config.pl T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/agi_lib/doc_print.pl :: [(precept),(action),change(state)]]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/domain_wumpus.pl ::% the paper "Asynchronous Knowledge with Hidden Actions in the Situation T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/domain_party.pl ::% Enumerates primitive actions, and the types of their arguments. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/domain_cake.pl ::%% in the Concurrent, Temporal Situation Calculus with Natural Actions. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/adv_mindi2.pl :: ::- discontiguous(prim_action/1). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/adv_mindi.pl ::% Natural Actions, from sitcalc.pl T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/adv_lexicon.pl ::thetaRole(be, be_57, duration_of_tt, 1, subj_tt, action_tt, "", "", 0). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/adv_abdemo_id.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/adv_abdemo_id.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/adv_abdemo.pl :: It's assumed that all primitive actions (two argument happens) are T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/prolog/abduction/adv_abdemo.pl :: In effect this implements a partial-order planner. not(clipped) facts T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_telnet.pl :: set_stream(user_input, eof_action(eof_code)), !. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_state.pl ::% for the "TheSims" bot AI which will make the bots do what TheSims characters do... (they dont use the planner they use a simple priority routine) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_plan.pl ::%% action_invoke_goals( ?Agent, ?ARG2, ?Mem0) is semidet. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_plan.pl :: dbug(planner, '~w :: no goals exist~n', [Agent]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_physics.pl :: ::- nop(ensure_loaded('adv_action')). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_percept.pl ::%% stripped_term( ?MAction, ?Action) is semidet. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_main.pl :: ::- ensure_loaded(adv_action). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_log2eng.pl ::logic2eng(_Context, Doing, [Agent, does, Did|More]) ::- is_type_functor(action, Doing), Doing=..[Did, Agent|More]. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_io.pl ::%bugs([general, printer, planner, autonomous]). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_implies.pl ::implications(Knower, attempts(_Agent, Action), Preconds, Effects) ::- nonvar(Action), !, implications(Knower, Action, Preconds, Effects). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_functors.pl ::%type_functor(action, get_advstate_db(list(state))). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_functors.pl ::% Access ot planner ops T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_floyd.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_examine.pl ::% action = attempts it to find out T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_eng2txt.pl :: action_doer(Context, Likely), Agent=Likely. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_eng2cmd_frame.pl :: Action-), toward(Vector-up), to(Doee), of( T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_eng2cmd.pl ::eng2cmd(Agent, Words, Logic, Mem) ::- reframed_call( eng2action, Agent, Words, Logic, Mem). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_edit.pl ::% invoke_metacmd(Doer, Action, S0, S1) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_data.pl :: class_desc(["like Floyd the robot will, instances will automatically use its planner T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_data.pl :: class_desc(["agents of this type/class call decide_action/3 hooks (and per plugin)"])]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_behaviour_tree.pl ::%% :: ::=( ?Action, ?Action) is semidet. T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_axiom.pl ::aXiom(MAction, S0, S9) ::- stripped_term(MAction, Action), !, trace, aXiom(Action, S0, S9). T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_agent.pl ::% Agent :: request(Action, Action_Id) T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_agent.pl :: dbug(planner, 'adding ~w goal ~w~n', [Agent, Goal]), T:/opt/logicmoo_workspace/packs_sys/logicmoo_agi/pldoc/episodic_memory/adv_action.pl :: ::- dynamic(mu_global ::agent_last_action/3). T:/opt/logicmoo_workspace/packs_sys/instant_prolog_docs/prolog/logicmoo_autodoc.pl :: autodoc_file(library(episodic_memory/'adv_action.pl')), T:/opt/logicmoo_workspace/packs_sys/instant_prolog_docs/prolog/instant_prolog_docs.pl ::longer_sumry(act, 'Single Doer Action'). T:/opt/logicmoo_workspace/packs_sys/eggdrop/t/foofy_bot.pl ::wave ::- irc_action("waves"). T:/opt/logicmoo_workspace/packs_sys/eggdrop/prolog/eggdrop_irc.pl ::irc_action(IDEA) ::- say([' ::ACTION ',IDEA]). T:/opt/logicmoo_workspace/packs_sys/eggdrop/prolog/eggdrop2.pl ::ircEvent(DEST,_User,ctcp("ACTION",W)) ::- T:/opt/logicmoo_workspace/packs_sys/eggdrop/prolog/eggdrop.pl ::ircEvent(DEST,_User,ctcp("ACTION",W)) ::- T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/utils/states_explorer.pl :: ::- use_module('../engine/interpreter.P',[flat_sequence/2, action_/1, event_pred/1, abstract_numbers/2, user_prolog_clause/2]). T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysLate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysEarlyTricky.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseNoComplications.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerDefaults.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCuresRep.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/swish/lps_server_UI.pl :: interpreter ::query_thread(LPS_ID, lps_server_UI ::provide_events_get_fluents_events_actions(InputEvents,Timeless,_Result), Cycle, Result), T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/utils/states_explorer.pl :: ::- use_module('../engine/interpreter.P',[flat_sequence/2, action_/1, event_pred/1, abstract_numbers/2, user_prolog_clause/2]). T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysLate.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbasePaysEarlyTricky.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseNoComplications.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerDefaults.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCuresRep.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/utils/moreTestResults/CLOUT_workshop/loanAgreementPostConditionsRTbaseBorrowerCures.pl_.P.lpst :: ::-dynamic lps_test_result/3,lps_test_result_item/3,lps_test_action_ancestor/3,lps_test_options/1. T:/opt/logicmoo_workspace/packs_sys/.HIDE~lps_corner.savHacked/lps_corner.savHacked/swish/lps_server_UI.pl :: interpreter ::query_thread(LPS_ID, lps_server_UI ::provide_events_get_fluents_events_actions(InputEvents,Timeless,_Result), Cycle, Result), T:/opt/logicmoo_workspace/packs_lib/xlibrary/prolog/ontrace.pl ::user ::prolog_trace_interception(Port, Frame, PC, Action) ::- T:/opt/logicmoo_workspace/packs_lib/xlibrary/prolog/concurrent_forall.pl ::%! concurrent_forall( ::Cond, ::Action) is semidet. T:/opt/logicmoo_workspace/packs_lib/trill/prolog/utility_translation.pl ::% this predicate will perform the appropriate actions. T:/opt/logicmoo_workspace/packs_lib/rocksdb/rocksdb/tools/db_crashtest.py :: parser.add_argument("--simple", action="store_true") T:/opt/logicmoo_workspace/packs_lib/rocksdb/rocksdb/tools/block_cache_analyzer/block_cache_pysim_test.py :: action = random.randint(0, 10) T:/opt/logicmoo_workspace/packs_lib/rocksdb/rocksdb/tools/advisor/test/test_rule_parser.py :: def test_suggestion_missing_action(self) :: T:/opt/logicmoo_workspace/packs_lib/rocksdb/rocksdb/tools/advisor/advisor/rule_parser.py :: class Action(Enum) :: T:/opt/logicmoo_workspace/packs_lib/rocksdb/rocksdb/tools/advisor/advisor/db_config_optimizer.py :: def apply_action_on_value(old_value, action, suggested_values) :: T:/opt/logicmoo_workspace/packs_lib/rocksdb/rocksdb/build_tools/precommit_checker.py ::parser.add_argument('--ignore_failure', action='store_true', default=False, T:/opt/logicmoo_workspace/packs_lib/rocksdb/rocksdb/build_tools/amalgamate.py :: parser.add_argument("-I", action="append", dest="include_paths", help="include paths for private headers") T:/opt/logicmoo_workspace/packs_lib/rocksdb/prolog/rocksdb.pl :: rocks_batch/2, % +RocksDB, +Actions T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/pitaind.pl :: op(1150,fx,action) T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/pita.pl :: op(1150,fx,action), T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/mcintyre.pl :: deal_with_actions(ActL,M,UC,CA), T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/examples/viral.pl :: ::- action has/1. T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/examples/truel.pl ::% What is the best action for a? T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/examples/simpson.pl :: ::- action drug/0. T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/examples/rmc.pl ::% H :: is the history of actions (list) T:/opt/logicmoo_workspace/packs_lib/cplint/prolog/examples/gpl.pl ::% H :: is the history of actions (list) T:/opt/logicmoo_workspace/modified_sys/prologmud_samples/prolog/prologmud_sample_games/run_mud_server.pl.bak :: '--planner', % Load any planners T:/opt/logicmoo_workspace/modified_sys/prologmud_samples/prolog/prologmud_sample_games/run_mud_server.pl.bak :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/modified_sys/prologmud_samples/prolog/prologmud_sample_games/run_mud_server.pl :: '--planner', % Load any planners T:/opt/logicmoo_workspace/modified_sys/prologmud_samples/prolog/prologmud_sample_games/run_mud_server.pl :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/modified_sys/logicmoo_utils/prolog/file_scope.pl.bak :: do_eof_actions/2, T:/opt/logicmoo_workspace/modified_sys/logicmoo_utils/prolog/file_scope.pl :: do_eof_actions/2, T:/opt/logicmoo_workspace/modified_sys/logicmoo_ec/prolog/logicmoo_lps.pl.bak :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/modified_sys/logicmoo_ec/prolog/logicmoo_lps.pl.bak :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/modified_sys/logicmoo_ec/prolog/logicmoo_lps.pl :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/modified_sys/logicmoo_ec/prolog/logicmoo_lps.pl :: %listing(db ::actions/1), T:/opt/logicmoo_workspace/modified_sys/logicmoo_ec/prolog/logicmoo_ec.pl.bak :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/modified_sys/logicmoo_ec/prolog/logicmoo_ec.pl :: ::- reexport(logicmoo_planner). T:/opt/logicmoo_workspace/modified_sys/logicmoo_base/prolog/logicmoo/plarkc/logicmoo_i_cyc_rewriting.pl ::builtin_rn('ActionQualifyingFunction', rtActionQualifyingFunction). T:/opt/logicmoo_workspace/modified_sys/logicmoo_base/prolog/logicmoo/pfc/system_basic.pfc.pl ::ttTypeType(ttActionType,comment("Types of actions such PostureChangingAction")). T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/xref/xrftty.pl :: actionchar(+, +, -), T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/traveller/traveller.pl :: warn( run, 'There are no clauses for'...T<>'\'s actions' ). T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/tokenise.pl ::to change the escape action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/sdo_output.pl :: You may want to alter the action here so it's cleverer about T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/sdo.pl ::Its action is undefined if the file can't be opened, read, etc. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/script.pl ::representing the action ``Cross reference the explanation concerning T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/screen_edit.pl :: Generate a screen-update action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/output_to_chars.pl ::Goal's current output stream. Action is undefined (calls 'bug') if T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/output.pl ::If Term is uninstantiated, action is undefined (in fact, we call 'bug'). T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/monopoly.pl :: bankruptcy_action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/files.pl ::You can change this action by asserting extra clauses for prolog_error. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/control.pl ::The Tutor frequently needs to perform some action for each solution T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/commands.pl ::answer_question's action depends on which mode the Tutor is in. If in T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/bug.pl :: action1 T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/arrays.pl ::succeeds. If Goal fails, the action is undefined (a call to 'bug'). Not T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/source/and_or.pl ::is called. This adapts its action depending on Mode. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/xref/xrftty.pl :: actionchar(+, +, -), T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/traveller/traveller.pl :: warn( run, 'There are no clauses for'...T<>'\'s actions' ). T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/tokenise.pl ::to change the escape action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/sdo_output.pl :: You may want to alter the action here so it's cleverer about T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/sdo.pl ::Its action is undefined if the file can't be opened, read, etc. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/script.pl ::representing the action ``Cross reference the explanation concerning T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/screen_edit.pl :: Generate a screen-update action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/output_to_chars.pl ::Goal's current output stream. Action is undefined (calls 'bug') if T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/output.pl ::If Term is uninstantiated, action is undefined (in fact, we call 'bug'). T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/monopoly.pl :: bankruptcy_action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/files.pl ::You can change this action by asserting extra clauses for prolog_error. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/control.pl ::The Tutor frequently needs to perform some action for each solution T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/commands.pl ::answer_question's action depends on which mode the Tutor is in. If in T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/bug.pl :: action1 T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/arrays.pl ::succeeds. If Goal fails, the action is undefined (a call to 'bug'). Not T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/source/and_or.pl ::is called. This adapts its action depending on Mode. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/files/autotest/autotest.pl :: Term is a goal plus its specified (expected) action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/tutor/autotest/autotest.pl :: Term is a goal plus its specified (expected) action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/esl/tinydef.pro ::block( Actions ) --> [begin], actions(Actions), [end]. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/esl/classy.pro :: If it requests an explanation or other action, T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/utilities.pl ::% Utilities for planners. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/test1.pl :: ::- reconsult('planner-me-gr.pl'). T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/test.pl :: ::- reconsult('plannersp.pl'). T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/plannersp.pl ::s( Goals -> NextAction, NewGoals -> Action, 1) ::- % All costs are 1 T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/plannersp.pl ::% MODULE :: planner-ME-GR-SP.p T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner.pl ::% MODULE :: planner-ME-GR.p T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner.pl :: achieves( Action, Goal), T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me.pl ::Subj :: planner-ME.pl T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me.pl :: conc( PrePlan, [ Action | PostPlan], Plan), % Divide plan T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me-gr.pl ::% MODULE :: planner-ME-GR.p T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me-gr.pl :: conc( PrePlan, [Action], Plan), % Divide plan (breadth-1st) T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me-gr-sp.pl ::s( Goals -> NextAction, NewGoals -> Action, 1) ::- % All costs are 1 T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me-gr-sp.pl ::% MODULE :: planner-ME-GR-SP.p T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me-gp.pl ::Subj :: planner-ME-GP.pl T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/planner-me-gp.pl :: conc( PrePlan, [Action | PostPlan], Plan), % Divide plan T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/blocks-world.pl ::% Definition of action move(Block,From,To) in blocks world T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/bratko/blocks-world.pl ::% This relation is only used by the "Goal Regression" planner. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/autotest/autotest.pl :: Term is a goal plus its specified (expected) action. T:/opt/logicmoo_workspace/Mirrors/www.j-paine.org/prolog/asn/io.pl :: Action undefined if F is already open, or can't be opened. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/ps_compile.pl :: fast_bagof( (Cond=>Action), (Cond=>Action), Rules ), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/ps1.pl :: rule_vs_action( Rule, Action ), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/ps.pl :: rule_vs_action( Rule, Action ), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/exec.pl :: restart_process( Co, Action ). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/eden_core.pl ::By using the save option, you can direct that perceptions and actions T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/warplan.pl ::You also need to supply specifications of each action. Give these by T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/warplan.pl ::a stronger planner if anyone has one. (This is not criticism of Warren - T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/very_simple_bug.pl ::square, smell() returns a direction which has the same name as an action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/talk_bug.pl ::think( Action ) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/search_bug.pl ::think( Action ) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/planning_bug.pl ::This is the first version, and is still very experimental. The planner T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/planning_bug.pl ::representation for states, action descriptions, and meanings. Those used T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/output.pl ::If Term is uninstantiated, action is undefined (in fact, we call 'bug'). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/manual_bug.pl ::simply reads and performs actions as you type them. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/exec_bug.pl ::decides to obey an action. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/control.pl ::The Tutor frequently needs to perform some action for each solution T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/plog/bugs/awm_to_objects.pl ::that it be used in an abstraction-based planner such as ABSTRIPS. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/path_to_moves.pl ::and the bug's initial heading, and it returns a list of actions, and a T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/output.pl ::If Term is uninstantiated, action is undefined (in fact, we call 'bug'). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/manual_bug.pl ::simply reads and performs actions as you type them. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/files.pl ::You can change this action by asserting extra clauses for prolog_error. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden_core.pl ::By using the save option, you can direct that perceptions and actions T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/ps_compile.pl :: fast_bagof( (Cond=>Action), (Cond=>Action), Rules ), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/ps1.pl :: rule_vs_action( Rule, Action ), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/ps.pl :: rule_vs_action( Rule, Action ), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/path_to_moves.pl ::and the bug's initial heading, and it returns a list of actions, and a T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/output.pl ::If Term is uninstantiated, action is undefined (in fact, we call 'bug'). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/manual_bug.pl ::simply reads and performs actions as you type them. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/files.pl ::You can change this action by asserting extra clauses for prolog_error. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/eden_core.pl ::By using the save option, you can direct that perceptions and actions T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/control.pl ::The Tutor frequently needs to perform some action for each solution T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/bug.pl :: action1 T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/eden2/awm_to_objects.pl ::that it be used in an abstraction-based planner such as ABSTRIPS. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/control.pl ::The Tutor frequently needs to perform some action for each solution T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/bug.pl :: action1 T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/testbeds/eden/awm_to_objects.pl ::that it be used in an abstraction-based planner such as ABSTRIPS. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/write.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/var_names.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/valvar.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/unravel.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/tempalloc.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/registers.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/read_procs.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/qc1.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/pretrans.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/permvars.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/permalloc.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/peephole.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/ol.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/objvar.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/misc.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/interpret_term.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/index.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/fresh_copy.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/flatten_or_once.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/dynamic.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/compile_procs.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/built_in.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/qu_pl/qp3.2/qc1.sics/src/alive.pl :: * loss of use, data or profits, whether in an action of contract, negligence T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/reasonng/atp/systems/plaisted/tests.pl ::% Actions :: climb, go, drop, grab T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pleuk/Pleuk/Sort/sortmodule.pl ::and the real action is in the global endcoding routines called as a posthook to the T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pleuk/Pleuk/SLE/slemenus.pl :: [prompt = 'Template expansion limit exceeded. Action?', T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pleuk/Pleuk/Code/pstream_filters.pl ::eccs_spf_check_body(sensitize(SPF, _Action)) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pleuk/Pleuk/Code/pmenux.pl ::eccs_construct_menu_list([command(Command, _Action)|Rest], [Atom|RestAtoms]) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pleuk/Pleuk/Code/pgmviews.pl ::eccs_gm_spf_measure(sensitize(Obj, _Action), Metrics, Dims) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pleuk/Pleuk/Code/pdc.pl ::sensitive(SPF, Action) T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pleuk/Pleuk/Code/C/Xsicstus.pl.gm :: eccs_gm_do_select1_do_action(Text, Button, Select, List), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pappi/pappi/USEnglishGLR.pl :: ::- ensure_loaded(actionUSEnglish). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pappi/pappi/SpanishGLR.pl :: ::- ensure_loaded(actionSpanish). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pappi/pappi/JapaneseGLR.pl :: ::- ensure_loaded(actionJapanese). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pappi/pappi/GermanGLR.pl :: ::- ensure_loaded(actionGerman). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pappi/pappi/FrenchGLR.pl :: ::- ensure_loaded(actionFrench). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pappi/pappi/DutchGLR.pl :: ::- ensure_loaded(actionDutch). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/pappi/pappi/doc/l&u.phf ::content :: Loaded actionUSEnglish T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/linger/shell.pl ::if(Condition,Action) ::- call(Condition),call(Action). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/linger/new/shell.pro ::if(Condition,Action) ::- call(Condition),call(Action). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/hdrug/v1/library/show.pl ::prompting(Generator,Name,Action) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/hdrug/v1/library/command.pl ::prompting(Generator,Name,Action) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/hdrug/Hdrug/Prolog/show.pl ::prompting(Generator,Name,Action) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/hdrug/Hdrug/Prolog/library/command.pl ::prompting(Generator,Name,Action) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/hdrug/Hdrug/Applications/Ale/ale.pl :: nl,write('Action(add,noadd,go(-#),quiet,break,dtr-#,abort)? '), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/flex/flex-2.4.3/MISC/Atari/Atari.patches :: - the short action_file_name has been "flexXXXXXX.tmp", but that's too T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/av/av/feature.parser/"lalr.parser.lisp" ::(defstruct rule no mother daughters action) T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/misc/lq_text/v112g/lq-text1.12gamma/src/wordslike.project ::setopt list_action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/misc/lq_text/v112g/lq-text1.12gamma/src/sabre.project.menu ::setopt list_action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/misc/lq_text/v112g/lq-text1.12gamma/src/saber.project-all ::setopt list_action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/misc/lq_text/v112g/lq-text1.12gamma/src/saber.project ::setopt list_action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/misc/lq_text/v110/lq-text/src/saber.project ::setopt list_action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/bookcode/nlp_pp/earleys.pl ::predictor(_). % then succeed with no further action. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/bookcode/nlp_pp/earley.pl ::predictor(_). % then succeed with no further action. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/bookcode/nlp_pp/dbquery.pl :: action(W,X^Q), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/xerion/v30/3.0/bp-3.1.patch ::+ * AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/snns/v31/SNNSv3.1/xgui/sources/ui_key.ph ::FlagType ui_key_action; /* used for MOVE and COPY to tell the T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/snns/v31/SNNSv3.1/xgui/sources/ui_action.ph :: FILE :: ui_action.ph T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/snns/v30/SNNSv3.0/xgui/sources/ui_key.ph ::FlagType ui_key_action; /* used for MOVE and COPY to tell the T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/snns/v30/SNNSv3.0/xgui/sources/ui_event.ph ::FlagType ui_key_action; /* which action :: MOVE or COPY */ T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/snns/v30/SNNSv3.0/xgui/sources/ui_action.ph :: FILE :: ui_action.ph T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/rcs/v42/patches/rcs_v4.2.patch.1 :: XtAddActions(actionsList, XtNumber(actionsList)); T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/planet/ref/ref.parameter ::debug (step through procedure actions) = off T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/systems/planet/planet/ref/ref.parameter ::debug (step through procedure actions) = off T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/cns/neural/bam.pas :: { no action taken } T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/neural/cns/adaline/adal.prn :: response function from the single neuron's discrete action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/learning/systems/mobal/v22/hyp_news/HyperNeWS1.4/src/lib/prolog/demo.pl ::hn_message('PrologHelp' ::button('NextButton'),'Action',_) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/learning/systems/miles/miles/xm.pl :: xtAddActions([action(label_ok,changeSelectedLabels,LabelChangeDialog)]), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/worlds/changable.pl ::changable(action/2). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/tps/interface.pl :: fetchNewAction(orient(Action),lr,'$equation'(_C,[L=R]),_,Reverse, T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/terms/terms.pl ::interFaceOrPragmaOp(action/2). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/specVars/rename.pl :: * rename((SA,OA,_),(action(A,EqR))) * T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/specVars/combine.pl ::combine(W1,W2,_W3,(action(A,E))) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/rg/rg_env.pl :: write('Action (";" for more choices, otherwise ) :: '), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/make/make.QProlog.pl :: ::- compileL('completion/action.pl'). T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/inout/in.pl :: allowedEliminationTime,actionDefault,action,act]), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/completion/order.pl ::The following actions may be taken ::",['$equation'(C,[L=R])]), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/completion/eqCompletion.pl :: assertz(actionNew(orient(n),'$equation'(CN,[LN=RN]))), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/completion/dbscheme.pl :: * actions to be performed after creation of object * T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/completion/complCom.pl :: * - completion of a specification using a action file T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/src/cec/completion/action.pl :: * file :: action.pl T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/lib/cec/standard/standard.poly3.q2.0 :: ::-dynamic action/2. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/lib/cec/standard/standard.poly2.q2.0 :: ::-dynamic action/2. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/cec/cec/lib/cec/standard/standard.poly1.q2.0 :: ::-dynamic action/2. T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/back/Back52/btl.pl ::t5out_error_output(domain(Term,Action)) ::- T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/kr/systems/kl_one/back/Back52/abox.pl ::%% a5rev_update_ibox(+Action, +LHS) T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/icot/symbolic/unix/vpim/src/functions/f_event_throw_goal_in_cluster.psl.c :: Goal_Request_Action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/icot/symbolic/unix/compiler/generate.pl :: action_code(Linear,VarAL,_,R1,R2,L0,L2,Susp,Info0,Info1), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/icot/kbms_clp/pimos/src/GNU/flex-2.3.7/MISC/Atari.patches :: - the short action_file_name has been "flexXXXXXX.tmp", but that's too T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/genetic/gp/systems/gp_pl/gp.pl ::maximum_actions(30). % Number of actions each individual is T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/fuzzy/systems/cncl/ezd/doc/ezd.psf ::/cb{pop}def % action on unknown char -- nothing for now T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/salvini/writef.pl ::% certain formatting actions. The following sequences result in T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/salvini/utilities.pl :: write('No action taken!!!'), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/salvini/explore.pl :: builds up a trace of its actions. (from an idea in 'Bratko, 1986') T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/mike/v203/MIKEv2.03/mikev203.pl :: 6. Forward chaining (right hand side actions) T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/mike/v203/MIKEv2.03/demo3.pl ::a halt is added at the end of the RHS actions. */ T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/mike/old/minimike.pl ::in working memory), and then perform the associated right-hand-side actions T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/mike/old/fc_exec.pl :: findall1((rule RULE forward if COND then ACTIONS), /* given this pattern */ T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/mike/old/engine2.pl :: 6. Forward chaining (right hand side actions) T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/mike/old/engine1.pl :: 6. Forward chaining (right hand side actions) T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/babylon/v22/Babylon-2.2-for-tar/Docs-and-Readme/index-sorted.plain ::execute-menu-action, function, ./io/basic/b-menu T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/amzi/programs/xsip/retefoop/retepred.pro :: rul(N,TokenList,Actions), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/amzi/programs/xsip/retefoop/retefoop.pro ::% actions to take based on commands T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/amzi/programs/xsip/oops/oops.pro ::% actions to take based on commands T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/expert/systems/amzi/programs/xsip/foops/foops.pro ::% actions to take based on commands T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/edu/pail/pail/rules/kidnap.pail ::(rule-action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/edu/pail/pail/data-files/rules/kidnap.pail ::(rule-action T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/doc/bib/uka/AI/log.prog.85.bib :: languages (PLANNER and PROLOG) and actor languages T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/doc/bib/uka/AI/log.prog.85.bib :: context-free grammar rules. Subsequently, actions can T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/agents/viewgen/viewgen/ViewGen/pl/utils.pl ::% TAs == a list of tests and actions T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/agents/viewgen/viewgen/ViewGen/pl/reader.pl ::% Act = the rule action... T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/agents/viewgen/viewgen/ViewGen/pl/lsyntax.pl ::% the definition, and terminated by the start of the action list T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/agents/viewgen/vf_hetis/vf-hetis/lib/utils/xreference.pl :: actionchar(+, +, -), T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/agents/viewgen/vf_hetis/vf-hetis/lib/predicates/cond_1.pl ::% Purpose :: TAList is a list of Test-Action pairs, i.e., a clause T:/opt/logicmoo_workspace/Mirrors/www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/agents/viewgen/vf_hetis/vf-hetis/lib/collections/synread.pl ::% the definition, and terminated by the start of the action list T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/systems/BinProlog3.0/src/top.pl :: ttyin(get_code(A)),user_action(A,Ok),ttynl. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/systems/BinProlog3.0/progs/pbench.pl ::% how many Iterations of the Action and its Control to perform. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/systems/BinProlog3.0/cparser/stdio.pl ::open_options([eof_action(error)|L],S) ::- open_options(L,S). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/quintus/ref_1.0/indexer/low.pl :: parse_spec(Arity, Spec, Head, Test, Action, Hashes), T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/quintus/ref_1.0/indexer/indexed.pl ::non_indexed_pred(Mod, Head, Goal, Action) ::- T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/src/system.pl ::% ol_do_project(+Action, +Project, +WhichFiles, ?BaseLanguage, ?Extension) -- T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/xref/xrftty.pl :: actionchar(+, +, -), T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/traveller/traveller.pl :: warn( run, 'There are no clauses for'...T<>'\'s actions' ). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/tokenise.pl ::to change the escape action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/sdo_output.pl :: You may want to alter the action here so it's cleverer about T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/sdo.pl ::Its action is undefined if the file can't be opened, read, etc. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/script.pl ::representing the action ``Cross reference the explanation concerning T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/screen_edit.pl :: Generate a screen-update action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/output_to_chars.pl ::Goal's current output stream. Action is undefined (calls 'bug') if T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/output.pl ::If Term is uninstantiated, action is undefined (in fact, we call 'bug'). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/monopoly.pl :: bankruptcy_action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/files.pl ::You can change this action by asserting extra clauses for prolog_error. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/control.pl ::The Tutor frequently needs to perform some action for each solution T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/commands.pl ::answer_question's action depends on which mode the Tutor is in. If in T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/bug.pl :: action1 T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/arrays.pl ::succeeds. If Goal fails, the action is undefined (a call to 'bug'). Not T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/source/and_or.pl ::is called. This adapts its action depending on Mode. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tutor/autotest/autotest.pl :: Term is a goal plus its specified (expected) action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/turtle/turtle.pl :: nl, write('primitive actions... For example, it already knows how to square(X), and'), T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/xrftty.pl :: actionchar(+, +, -), T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/writef.pl ::% certain formatting actions. The following sequences result in T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/trace.pl :: % the specified action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/toplevel.pl ::% process_file(Action) notes that the file has been loaded. Note that T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/subtra.pl ::/* The Actions */ T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/rules.pl :: rule(Name,Condition, Action), % Find a production rule T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/imisce.pl ::continue. % This is one of the actions for error/3 T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/files.pl :: open_file(File, Mode, Action) T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/tools/advice.pl ::% advise(Predicate, Port, Action) T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/shapiro/shapiro.pl :: % (Answer, Action)-pairs. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/salvini/writef.pl ::% certain formatting actions. The following sequences result in T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/salvini/utilities.pl :: write('No action taken!!!'), T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/salvini/explore.pl :: builds up a trace of its actions. (from an idea in 'Bratko, 1986') T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/plaisted/tests.pl ::% Actions :: climb, go, drop, grab T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/peirera/peirera.pl ::% how many Iterations of the Action and its Control to perform. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/peirera/driver.pl ::% how many Iterations of the Action and its Control to perform. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/linger/shell.pl ::if(Condition,Action) ::- call(Condition),call(Action). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/linger/new/shell.pro ::if(Condition,Action) ::- call(Condition),call(Action). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/exec.pl :: restart_process( Co, Action ). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/eden_core.pl ::By using the save option, you can direct that perceptions and actions T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/warplan.pl ::You also need to supply specifications of each action. Give these by T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/warplan.pl ::a stronger planner if anyone has one. (This is not criticism of Warren - T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/very_simple_bug.pl ::square, smell() returns a direction which has the same name as an action T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/talk_bug.pl ::think( Action ) ::- T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/search_bug.pl ::think( Action ) ::- T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/planning_bug.pl ::This is the first version, and is still very experimental. The planner T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/planning_bug.pl ::representation for states, action descriptions, and meanings. Those used T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/output.pl ::If Term is uninstantiated, action is undefined (in fact, we call 'bug'). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/manual_bug.pl ::simply reads and performs actions as you type them. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/exec_bug.pl ::decides to obey an action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/control.pl ::The Tutor frequently needs to perform some action for each solution T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/eden/plog/bugs/awm_to_objects.pl ::that it be used in an abstraction-based planner such as ABSTRIPS. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/autotest/autotest.pl :: Term is a goal plus its specified (expected) action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/libraries/imperial_college/asn/io.pl :: Action undefined if F is already open, or can't be opened. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/sterling_shapiro/c14/cn_21.pl :: member([Action|Args],Story), T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/sterling_shapiro/c14/cn_12.pl ::% Program 14.12 :: Testing the depth-first planner T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/sterling_shapiro/c14/cn_11.pl ::% Program 14.11 :: A depth-first planner T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/sterling_shapiro/c14/cn_11.pl :: The Plan of actions transforms State1 into State2. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/strips_strips.pl ::% U0 is the bound on the number of actions going into achieve_all T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/strips_strips.pl ::% A SIMPLE STRIPS PLANNER USING STRIPS NOTATION (Figure 8.2) T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/regr_strips_sim.pl ::% A SIMPLE REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION (Figure 8.4) T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/regr_strips.pl ::% A REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/popsim.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/popsim.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/popold3.pl ::% PARTIAL ORDER PLANNER THAT USES STRIP REPRESENTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/popold3.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/popold2.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/popold1.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/pop_sics.pl ::% PARTIAL ORDER PLANNER THAT USES STRIP REPRESENTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/pop_sics.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/pop.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION (Figures 8.5 & 8.6) T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/pop.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/delrob_strips.pl ::% ACTIONS T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/delrob_sitc.pl ::% ACTION PRECONDITIONS T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/Blocks_world/strips_holds.pl ::% A SIMPLE STRIPS PLANNER FOR ACTIONS IN HOLDS NOTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/Blocks_world/regr_strips_sim.pl ::% A SIMPLE REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/Blocks_world/regr_strips.pl ::% A REGRESSION PLANNER FOR ACTIONS IN STRIPS NOTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/Blocks_world/regr_holds.pl ::% A SIMPLE REGRESSION PLANNER FOR ACTIONS IN HOLDS NOTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/Blocks_world/pop.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch8/Blocks_world/blocks-strips.pl ::% FOR PARTIAL ORDER PLANNER T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch11/nnl_t1.pl ::% New case with unknown user action :: T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/ch11/dtlearn_t1.pl ::val(e1,user_action,skips). val(e1,author,known). val(e1,thread,new). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop_t.pl ::% ACTIONS T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop3a.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop3a.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop3.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop3.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop2.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop2.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop.pl ::% PARTIAL ORDER PLANNER using STRIPS REPRESENTATION (Section C.5) T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/poole_mackworth_goebel/code/apc/pop.pl ::% that is a precondition of action instance index NA. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/gazdar_mellish/plan_gen.pl ::% actions to achieve a goal, but stops as soon as it finds an T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/gazdar_mellish/plan_gen.pl :: planner(Id,Actions). T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/gazdar_mellish/disambig.ptr :: PP :: arg0 :: type === action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/gazdar_mellish/airlines.ptr :: W :: sem :: body :: action === printout, T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/covington_nute_vellino/planner.pl ::/* PLANNER.PL */ T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/covington/earleys.pl ::predictor(_). % then succeed with no further action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/covington/earley.pl ::predictor(_). % then succeed with no further action. T:/opt/logicmoo_workspace/Mirrors/ftp.ims.uni-stuttgart.de/pub/languages/prolog/code_from_books/covington/dbquery.pl :: action(W,X^Q), T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/mlt/ML-Program-Library/foil/foil.pl ::% incurred in or about any such claim, action, or proceeding T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/mlt/HyperNeWS/HyperNeWS1.4/src/lib/prolog/demo.pl ::hn_message('PrologHelp' ::button('NextButton'),'Action',_) ::- T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/generic/WEB/email.pl :: T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/generic/WEB/Email.pl :: T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/specs/c/sql/sql.pars ::embedded_exception_declaration = WHENEVER condition exception_action . T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/specs/c/c++/c++.pars ::implemented, the constructor semantic actions must be able to process T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/y0.puma :: ActionPart , HasSelector , HasAttributes , NoCodeAttr , T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/sem.puma :: ChildCount, AttributeCount, ActionCount :: INTEGER; T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/oag.puma :: (Instance^[i2].Action = Action) THEN T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/mod5.puma :: IF (Action # ADR (Action)) AND NOT (Virtual IN Properties) THEN T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/mod4.puma :: IF Action # ADR (Action) THEN GenEvaluator (Action); END; !! T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/mod3.puma :: IF Action # ADR (Action) THEN GenEvaluator (Action); END; !! T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/mod0.puma :: ActionPart , HasSelector , HasAttributes , NoCodeAttr , T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/c5.puma :: IF (Action # ADR (Action)) AND NOT (Virtual IN Properties) THEN T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/c4.puma :: IF Action # ADR (Action) THEN GenEvaluator (Action); END; !! T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/c3.puma :: IF Action # ADR (Action) THEN GenEvaluator (Action); END; !! T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cocktail/cg/src/c0.puma :: ActionPart , HasSelector , HasAttributes , NoCodeAttr , T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/xchange/outgoing/perlmod/MpCCICore/Textfile.pm :: return 0; # no action under UNIX right now T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/xchange/outgoing/perlmod/MpCCICore/MSWinMPICH.pm ::sub _mpd_action($) T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/xchange/outgoing/perlmod/MpCCICore/License.pm :: my $action = shift; T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/xchange/outgoing/perlmod/MpCCICmds/Playback.pm :: # Specific actions in Init :: T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/xchange/outgoing/perlmod/MpCCICmds/mpccish.pm ::# exit # exit the shell without further action T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/MpCCI-3.0.3/sdk/mpcci-3.0.3-sdk-linux-amd64/examples/ex3/ex3.pre ::# This is a trivial example of a pre-action file which is T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/MpCCI-3.0.3/sdk/mpcci-3.0.3-sdk-linux-amd64/examples/ex3/ex3.post ::# This is a trivial example of a post-action file which is T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/MpCCI-3.0.3/sdk/mpcci-3.0.3-sdk-linux-amd64/bin/MpCCI.pm :: perform_prepost_actions T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/MpCCI-3.0.3/sdk/mpcci-3.0.3-sdk-linux-amd64/bin/ccirun.prepost ::# post actions specified for each process group. T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/cispar/MpCCI-3.0.3/sdk/mpcci-3.0.3-sdk-linux-amd64/bin/ccirun.pl :: # get_n_lines check_existence perform_prepost_actions T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/ais/publications/BehaviorEngineering/jdk/jre/lib/content-types.properties ::# :: ::= 'browser' | 'application' | 'save' | 'unknown' T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/adaptor/old_versions/StmtDeps.puma ::* - traverse t and make action for every variable * T:/opt/logicmoo_workspace/Mirrors/ftp.fraunhofer.de/archive/gmd/adaptor/old_versions/ReplaceExp.puma ::static int action;