.
FRDCSA | internal codebases | PSE
Homepage

[Project image]
PSE

Architecture Diagram: GIF

Jump to: Project Description | Parent Description | Capabilities

Project Description

Now that verber is functioning in terms of generating reasonable plans based on synthesized domains, it makes sense to integrate the output of pse into verber. pse is not a fully functional system, and lacks a precise semantics. It mainly requires unfinished work from corpus - i.e. a corpus of todo items. A basic approach we are looking at is modelling everything within Cyc, and using the HTN planning incorporated with Cyc to develop initial plans which can be refined using verber.

Capabilities

  • Develop an emacs major mode for spse2 or at least pse which interfaces with it.
  • Add to the pse-assigned to the ability to offer to someone that they work on a task, and if they accept, the ability to pay them the agreed upon price, and state the time duration on the offer. Have a pool of workers who offer to do the work.
  • Fix the pse system.
  • Go over pse stuff and try to iron them out so that we can use pse for reasoning about goals as well, even in an application such as NLU
  • Develop pse capabilities to interact with the SPSE system.
  • Agenda: pse-X> pse-X> Fri Sep 24 13:00:00 CDT 2010
    ("due-date-for-entry" "150346" "3 hours")
  • Agenda: pse-X> pse-X> Thu Sep 23 13:00:00 CDT 2010
    ("due-date-for-entry" "150298" "3 hours")
  • Agenda: pse-X> pse-X> Wed Sep 22 13:00:00 CDT 2010
    ("due-date-for-entry" "150223" "3 hours")
  • Agenda: pse-X> pse-X> Tue Sep 21 13:00:00 CDT 2010
    ("due-date-for-entry" "150176" "3 hours")
  • Agenda: pse-X> pse-X> Mon Sep 20 13:00:01 CDT 2010
    ("due-date-for-entry" "150119" "3 hours")
  • Agenda: pse-X> pse-X> Sun Sep 19 13:00:04 CDT 2010
    ("due-date-for-entry" "150024" "3 hours")
  • Agenda: pse-X> pse-X> Fri Sep 17 13:00:01 CDT 2010
    ("due-date-for-entry" "149942" "3 hours")
  • Agenda: pse-X> pse-X> Thu Sep 16 13:00:00 CDT 2010
    ("due-date-for-entry" "149877" "3 hours")
  • Agenda: pse-X> pse-X> Wed Sep 15 13:00:02 CDT 2010
    ("due-date-for-entry" "149597" "3 hours")
  • Agenda: pse-X> pse-X> Tue Sep 14 13:00:02 CDT 2010
    ("due-date-for-entry" "149548" "3 hours")
  • Agenda: pse-X> pse-X> Sun Sep 12 13:00:00 CDT 2010
    ("due-date-for-entry" "149439" "3 hours")
  • Agenda: pse-X> pse-X> Sat Sep 11 13:00:02 CDT 2010
    ("due-date-for-entry" "149340" "3 hours")
  • Agenda: pse-X> pse-X> Thu Sep 9 13:00:00 CDT 2010
    ("due-date-for-entry" "149139" "3 hours")
  • Agenda: pse-X> pse-X> Mon Sep 6 13:00:02 CDT 2010
    ("due-date-for-entry" "149013" "3 hours")
  • Agenda: pse-X> pse-X> Sun Sep 5 13:00:04 CDT 2010
    ("due-date-for-entry" "148968" "3 hours")
  • Agenda: pse-X> pse-X> Thu Sep 2 13:00:02 CDT 2010
  • Agenda: pse-X> pse-X> Wed Sep 1 13:00:00 CDT 2010
    ("due-date-for-entry" "148717" "3 hours")
  • KBS, MySQL:freekbs:default assert ("due-date-for-entry" "select * from messages where Contents like '%Agenda: pse-X> pse-X> Tue Aug 31 13:00:03 CDT 2010%' 148659" "3 hours")
  • Agenda: pse-X> pse-X> Tue Aug 31 13:00:03 CDT 2010
  • KBS, MySQL:freekbs:default assert ("due-date-for-entry" "select * from messages where Contents like '%Agenda: pse-X> pse-X> Mon Aug 30 13:00:00 CDT 2010%' 148583" "3 hours")
  • Agenda: pse-X> pse-X> Mon Aug 30 13:00:00 CDT 2010
  • KBS, MySQL:freekbs:default assert ("due-date-for-entry" "select * from messages where Contents like '%Agenda: pse-X> pse-X> Sun Aug 29 13:00:00 CDT 2010%' 148530" "3 hours")
  • Agenda: pse-X> pse-X> Sun Aug 29 13:00:00 CDT 2010
  • KBS, MySQL:freekbs:default assert ("due-date-for-entry" "select * from messages where Contents like '%Agenda: pse-X> pse-X> Sat Aug 28 13:00:00 CDT 2010%' 148478" "3 hours")
  • Agenda: pse-X> pse-X> Sat Aug 28 13:00:00 CDT 2010
  • KBS, MySQL:freekbs:default assert ("due-date-for-entry" "select * from messages where Contents like '%Agenda: pse-X> pse-X> Fri Aug 27 13:00:00 CDT 2010%' 148427" "3 hours")
  • Agenda: pse-X> pse-X> Fri Aug 27 13:00:00 CDT 2010
  • KBS, MySQL:freekbs:default assert ("due-date-for-entry" "select * from messages where Contents like '%Agenda: pse-X> pse-X> Thu Aug 26 13:00:00 CDT 2010%' 148363" "3 hours")
  • Agenda: pse-X> pse-X> Thu Aug 26 13:00:00 CDT 2010
  • Agenda: pse-X> pse-X> Wed Aug 25 13:00:00 CDT 2010
    ("due-date-for-entry" "148289" "3 hours")
  • Agenda: pse-X> pse-X> Tue Aug 24 13:00:00 CDT 2010
    ("due-date-for-entry" "148215" "3 hours")
  • Agenda: pse-X> pse-X> Mon Aug 23 13:00:00 CDT 2010
    ("due-date-for-entry" "148157" "3 hours")
  • Agenda: pse-X> pse-X> Sun Aug 22 13:00:00 CDT 2010
    ("due-date-for-entry" "148076" "3 hours")
  • Agenda: pse-X> pse-X> Wed Aug 18 13:00:09 CDT 2010
  • Agenda: pse-X> pse-X> Tue Aug 17 13:00:02 CDT 2010
  • Agenda: pse-X> pse-X> Mon Aug 16 13:00:01 CDT 2010
    ("due-date-for-entry" "147804" "3 hours")
  • Agenda: pse-X> pse-X> Sun Aug 15 13:00:08 CDT 2010
  • Agenda: pse-X> pse-X> Sat Aug 14 13:00:15 CDT 2010
  • Agenda: pse-X> pse-X> Fri Aug 13 13:00:01 CDT 2010
    ("due-date-for-entry" "147594" "3 hours")
  • Agenda: pse-X> pse-X> Thu Aug 12 13:00:10 CDT 2010
    ("due-date-for-entry" "147492" "3 hours")
  • KBS, pse-x query ("due-date-for-entry" ?X ?Y)
  • Agenda: pse-X> pse-X> Wed Aug 11 13:00:02 CDT 2010
    ("due-date-for-entry" "147394" "3 hours")
  • Agenda: pse-X> pse-X> Tue Aug 10 13:00:11 CDT 2010
    ("due-date-for-entry" "147198" "3 hours")
  • Agenda: pse-X> pse-X> Sat Aug 7 13:00:00 CDT 2010
    ("due-date-for-entry" "146597" "3 hours")
  • Agenda: pse-X> pse-X> Thu Aug 5 13:00:03 CDT 2010
    ("due-date-for-entry" "146352" "3 hours")
  • Agenda: pse-X> pse-X> Wed Aug 4 13:00:00 CDT 2010
    ("due-date-for-entry" "146118" "3 hours")
  • Agenda: pse-X> pse-X> Tue Aug 3 13:00:00 CDT 2010
    ("due-date-for-entry" "145956" "3 hours")
  • Agenda: pse-X> pse-X> Sun Aug 1 13:00:00 CDT 2010
    ("due-date-for-entry" "145866" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jul 31 13:00:02 CDT 2010
    ("due-date-for-entry" "145787" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jul 30 19:22:10 CDT 2010
    ("due-date-for-entry" "145676" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jul 26 13:00:00 CDT 2010
    ("due-date-for-entry" "145645" "3 hours")
  • Agenda: pse-X> pse-X> Sun Jul 25 13:00:02 CDT 2010
    ("due-date-for-entry" "145597" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jul 24 13:00:00 CDT 2010
    ("due-date-for-entry" "145555" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jul 23 13:00:00 CDT 2010
    ("due-date-for-entry" "145511" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jul 19 13:00:00 CDT 2010
    ("due-date-for-entry" "145205" "3 hours")
  • Agenda: pse-X> pse-X> Sun Jul 18 13:00:00 CDT 2010
    ("due-date-for-entry" "145133" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jul 17 13:00:00 CDT 2010
    ("due-date-for-entry" "145068" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jul 16 13:00:00 CDT 2010
    ("due-date-for-entry" "144882" "3 hours")
  • Agenda: pse-X> pse-X> Thu Jul 15 13:00:00 CDT 2010
    ("due-date-for-entry" "144669" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jul 14 13:00:00 CDT 2010
  • Agenda: pse-X> pse-X> Mon Jul 12 13:00:01 CDT 2010
    ("due-date-for-entry" "144451" "3 hours")
  • Agenda: pse-X> pse-X> Sun Jul 11 13:00:00 CDT 2010
    ("due-date-for-entry" "144372" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jul 10 13:00:00 CDT 2010
    ("due-date-for-entry" "143942" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jul 9 13:00:00 CDT 2010
    ("due-date-for-entry" "143881" "3 hours")
  • Agenda: pse-X> pse-X> Tue Jul 6 13:00:00 CDT 2010
    ("due-date-for-entry" "143729" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jul 5 13:00:01 CDT 2010
  • Agenda: pse-X> pse-X> Sun Jul 4 13:00:01 CDT 2010
    ("due-date-for-entry" "143435" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jul 3 13:00:01 CDT 2010
    ("due-date-for-entry" "143389" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jul 2 13:00:00 CDT 2010
    ("due-date-for-entry" "143339" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jun 30 13:00:00 CDT 2010
    ("due-date-for-entry" "143033" "3 hours")
  • Agenda: pse-X> pse-X> Tue Jun 29 13:00:00 CDT 2010
    ("due-date-for-entry" "142678" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jun 28 13:00:00 CDT 2010
    ("due-date-for-entry" "142549" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jun 26 13:00:00 CDT 2010
    ("due-date-for-entry" "142003" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jun 25 13:00:00 CDT 2010
    ("due-date-for-entry" "141636" "3 hours")
  • Agenda: pse-X> pse-X> Thu Jun 24 13:00:00 CDT 2010
    ("due-date-for-entry" "141327" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jun 23 13:00:00 CDT 2010
    ("due-date-for-entry" "141277" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jun 21 13:00:00 CDT 2010
    ("due-date-for-entry" "141137" "3 hours")
  • Agenda: pse-X> pse-X> Sun Jun 20 13:00:00 CDT 2010
    ("due-date-for-entry" "141085" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jun 19 13:00:01 CDT 2010
    ("due-date-for-entry" "141043" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jun 18 13:00:00 CDT 2010
    ("due-date-for-entry" "140898" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jun 16 13:00:01 CDT 2010
  • Agenda: pse-X> pse-X> Tue Jun 15 13:00:00 CDT 2010
    ("due-date-for-entry" "140625" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jun 9 13:00:00 CDT 2010
    ("due-date-for-entry" "140128" "3 hours")
  • Agenda: pse-X> pse-X> Tue Jun 8 13:00:00 CDT 2010
    ("due-date-for-entry" "140031" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jun 7 13:00:01 CDT 2010
    ("due-date-for-entry" "139978" "3 hours")
  • Agenda: pse-X> pse-X> Sun Jun 6 13:00:01 CDT 2010
    ("due-date-for-entry" "139928" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jun 5 13:00:00 CDT 2010
    ("due-date-for-entry" "139788" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jun 4 13:00:00 CDT 2010
    ("due-date-for-entry" "139286" "3 hours")
  • Agenda: pse-X> pse-X> Thu Jun 3 13:00:00 CDT 2010
    ("due-date-for-entry" "138775" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jun 2 13:00:01 CDT 2010
  • Agenda: pse-X> pse-X> Tue Jun 1 13:00:00 CDT 2010
    ("due-date-for-entry" "138416" "3 hours")
  • Agenda: pse-X> pse-X> Fri May 28 13:00:00 CDT 2010
    ("due-date-for-entry" "138195" "3 hours")
  • Agenda: pse-X> pse-X> Thu May 27 13:00:01 CDT 2010
    ("due-date-for-entry" "138048" "3 hours")
  • Agenda: pse-X> pse-X> Wed May 26 13:00:01 CDT 2010
    ("due-date-for-entry" "137998" "3 hours")
  • Agenda: pse-X> pse-X> Tue May 25 13:00:00 CDT 2010
    ("due-date-for-entry" "137948" "3 hours")
  • Agenda: pse-X> pse-X> Mon May 24 13:00:00 CDT 2010
    ("due-date-for-entry" "137900" "3 hours")
  • Agenda: pse-X> pse-X> Sun May 23 13:00:00 CDT 2010
    ("due-date-for-entry" "137745" "3 hours")
  • Agenda: pse-X> pse-X> Sat May 22 13:00:01 CDT 2010
    ("due-date-for-entry" "137687" "3 hours")
  • Agenda: pse-X> pse-X> Thu May 20 13:00:00 CDT 2010
    ("due-date-for-entry" "137086" "3 hours")
  • Agenda: pse-X> pse-X> Mon May 17 13:00:01 CDT 2010
    ("due-date-for-entry" "137028" "3 hours")
  • Agenda: pse-X> pse-X> Sun May 16 13:00:00 CDT 2010
    ("due-date-for-entry" "136982" "3 hours")
  • Agenda: pse-X> pse-X> Sat May 15 13:00:00 CDT 2010
    ("due-date-for-entry" "136940" "3 hours")
  • Agenda: pse-X> pse-X> Fri May 14 13:00:01 CDT 2010
  • Agenda: pse-X> pse-X> Thu May 13 13:00:02 CDT 2010
    ("due-date-for-entry" "136658" "3 hours")
  • Agenda: pse-X> pse-X> Wed May 12 13:00:02 CDT 2010
  • Agenda: pse-X> pse-X> Mon May 10 13:00:02 CDT 2010
  • Agenda: pse-X> pse-X> Sun May 9 13:00:02 CDT 2010
  • Agenda: pse-X> pse-X> Fri May 7 13:00:01 CDT 2010
    ("due-date-for-entry" "135776" "3 hours")
  • Agenda: pse-X> pse-X> Thu May 6 13:00:00 CDT 2010
    ("due-date-for-entry" "135467" "3 hours")
  • Agenda: pse-X> pse-X> Wed May 5 13:00:01 CDT 2010
    ("due-date-for-entry" "135399" "3 hours")
  • Agenda: pse-X> pse-X> Mon May 3 13:00:00 CDT 2010
    ("due-date-for-entry" "134388" "3 hours")
  • Agenda: pse-X> pse-X> Sun May 2 13:00:00 CDT 2010
    ("due-date-for-entry" "134340" "3 hours")
  • Agenda: pse-X> pse-X> Sat May 1 13:00:01 CDT 2010
    ("due-date-for-entry" "134296" "3 hours")
  • Agenda: pse-X> pse-X> Fri Apr 30 13:00:01 CDT 2010
    ("due-date-for-entry" "134192" "3 hours")
  • Agenda: pse-X> pse-X> Wed Apr 28 13:00:00 CDT 2010
  • Agenda: pse-X> pse-X> Tue Apr 27 13:00:01 CDT 2010
    ("due-date-for-entry" "133899" "3 hours")
  • Agenda: pse-X> pse-X> Thu Apr 22 13:00:02 CDT 2010
    ("due-date-for-entry" "133154" "3 hours")
  • Agenda: pse-X> pse-X> Wed Apr 21 13:00:01 CDT 2010
    ("due-date-for-entry" "132420" "3 hours")
  • Agenda: pse-X> pse-X> Tue Apr 20 13:00:00 CDT 2010
    ("due-date-for-entry" "132337" "3 hours")
  • Agenda: pse-X> pse-X> Mon Apr 19 13:00:01 CDT 2010
    ("due-date-for-entry" "132247" "3 hours")
  • Agenda: pse-X> pse-X> Sat Apr 17 13:00:00 CDT 2010
    ("due-date-for-entry" "132080" "3 hours")
  • Agenda: pse-X> pse-X> Fri Apr 16 13:00:00 CDT 2010
    ("due-date-for-entry" "132006" "3 hours")
  • Agenda: pse-X> pse-X> Thu Apr 15 13:00:00 CDT 2010
    ("due-date-for-entry" "131182" "3 hours")
  • Agenda: pse-X> pse-X> Sun Apr 11 13:00:00 CDT 2010
    ("due-date-for-entry" "131085" "3 hours")
  • Agenda: pse-X> pse-X> Sat Apr 10 13:00:00 CDT 2010
    ("due-date-for-entry" "131043" "3 hours")
  • Agenda: pse-X> pse-X> Fri Apr 9 13:00:00 CDT 2010
    ("due-date-for-entry" "129975" "3 hours")
  • Agenda: pse-X> pse-X> Thu Apr 8 13:00:00 CDT 2010
    ("due-date-for-entry" "129665" "3 hours")
  • Agenda: pse-X> pse-X> Wed Apr 7 13:00:00 CDT 2010
    ("due-date-for-entry" "129550" "3 hours")
  • Agenda: pse-X> pse-X> Sat Apr 3 13:00:00 CDT 2010
  • Agenda: pse-X> pse-X> Tue Mar 30 13:00:01 CDT 2010
    ("due-date-for-entry" "129396" "3 hours")
  • Agenda: pse-X> pse-X> Mon Mar 29 13:00:01 CDT 2010
    ("due-date-for-entry" "129287" "3 hours")
  • Agenda: pse-X> pse-X> Sun Mar 28 13:00:31 CDT 2010
    ("due-date-for-entry" "128950" "3 hours")
  • Agenda: pse-X> pse-X> Fri Mar 26 13:00:00 CDT 2010
    ("due-date-for-entry" "127558" "3 hours")
  • Agenda: pse-X> pse-X> Thu Mar 25 13:00:00 CDT 2010
    ("due-date-for-entry" "127512" "3 hours")
  • Agenda: pse-X> pse-X> Sat Mar 13 13:00:00 CST 2010
    ("due-date-for-entry" "127461" "3 hours")
  • Agenda: pse-X> pse-X> Fri Mar 12 13:00:00 CST 2010
    ("due-date-for-entry" "127417" "3 hours")
  • Agenda: pse-X> pse-X> Thu Mar 11 13:00:01 CST 2010
    ("due-date-for-entry" "127369" "3 hours")
  • Agenda: pse-X> pse-X> Wed Mar 10 13:00:00 CST 2010
    ("due-date-for-entry" "127323" "3 hours")
  • Agenda: pse-X> pse-X> Tue Mar 2 13:00:00 CST 2010
    ("due-date-for-entry" "127236" "3 hours")
  • Agenda: pse-X> pse-X> Mon Mar 1 13:00:00 CST 2010
    ("due-date-for-entry" "127187" "3 hours")
  • Agenda: pse-X> pse-X> Sun Feb 28 13:00:00 CST 2010
    ("due-date-for-entry" "127129" "3 hours")
  • Agenda: pse-X> pse-X> Sat Feb 27 13:00:00 CST 2010
    ("due-date-for-entry" "127087" "3 hours")
  • Agenda: pse-X> pse-X> Fri Feb 26 13:00:00 CST 2010
    ("due-date-for-entry" "126948" "3 hours")
  • Agenda: pse-X> pse-X> Thu Feb 25 13:00:00 CST 2010
    ("due-date-for-entry" "126646" "3 hours")
  • Agenda: pse-X> pse-X> Wed Feb 24 13:00:00 CST 2010
    ("due-date-for-entry" "126580" "3 hours")
  • Agenda: pse-X> pse-X> Tue Feb 23 13:00:00 CST 2010
    ("due-date-for-entry" "126542" "3 hours")
  • Agenda: pse-X> pse-X> Thu Feb 18 13:00:00 CST 2010
    ("due-date-for-entry" "125968" "3 hours")
  • Agenda: pse-X> pse-X> Sat Feb 13 13:00:00 CST 2010
    ("due-date-for-entry" "125863" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jan 25 13:00:01 CST 2010
    ("due-date-for-entry" "125760" "3 hours")
  • Agenda: pse-X> pse-X> Sun Jan 24 13:00:00 CST 2010
    ("due-date-for-entry" "125715" "3 hours")
  • Agenda: pse-X> pse-X> Sat Jan 23 13:00:00 CST 2010
    ("due-date-for-entry" "125673" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jan 13 13:00:00 CST 2010
    ("due-date-for-entry" "125622" "3 hours")
  • Agenda: pse-X> pse-X> Fri Jan 1 13:00:00 CST 2010
    ("due-date-for-entry" "125548" "3 hours")
  • Agenda: pse-X> pse-X> Thu Dec 31 13:00:00 CST 2009
    ("due-date-for-entry" "125492" "3 hours")
  • Agenda: pse-X> pse-X> Thu Dec 24 13:00:00 CST 2009
    ("due-date-for-entry" "125378" "3 hours")
  • Agenda: pse-X> pse-X> Wed Dec 23 13:00:01 CST 2009
    ("due-date-for-entry" "125193" "3 hours")
  • Agenda: pse-X> pse-X> Tue Dec 22 13:00:00 CST 2009
    ("due-date-for-entry" "124815" "3 hours")
  • Agenda: pse-X> pse-X> Sun Dec 13 13:00:00 CST 2009
    ("due-date-for-entry" "124784" "3 hours")
  • Agenda: pse-X> pse-X> Sat Dec 12 13:00:00 CST 2009
    ("due-date-for-entry" "124741" "3 hours")
  • Agenda: pse-X> pse-X> Fri Dec 11 13:00:00 CST 2009
    ("due-date-for-entry" "124697" "3 hours")
  • Agenda: pse-X> pse-X> Thu Dec 10 13:00:00 CST 2009
    ("due-date-for-entry" "124654" "3 hours")
  • Agenda: pse-X> pse-X> Mon Dec 7 13:00:00 CST 2009
    ("due-date-for-entry" "124614" "3 hours")
  • Agenda: pse-X> pse-X> Sun Dec 6 13:00:00 CST 2009
    ("due-date-for-entry" "124564" "3 hours")
  • Agenda: pse-X> pse-X> Sat Dec 5 13:00:00 CST 2009
    ("due-date-for-entry" "124521" "3 hours")
  • Agenda: pse-X> pse-X> Fri Dec 4 13:00:00 CST 2009
    ("due-date-for-entry" "124478" "3 hours")
  • Agenda: pse-X> pse-X> Tue Dec 1 13:00:00 CST 2009
    ("due-date-for-entry" "124429" "3 hours")
  • Agenda: pse-X> pse-X> Sun Nov 29 13:00:00 CST 2009
  • Agenda: pse-X> pse-X> Sat Nov 28 13:00:00 CST 2009
  • Agenda: pse-X> pse-X> Fri Nov 27 13:00:01 CST 2009
  • Agenda: pse-X> pse-X> Thu Nov 26 13:00:11 CST 2009
    ("due-date-for-entry" "123148" "3 hours")
  • Agenda: pse-X> pse-X> Wed Nov 25 13:00:02 CST 2009
  • Agenda: pse-X> pse-X> Mon Nov 23 13:00:00 CST 2009
    ("due-date-for-entry" "122024" "3 hours")
  • Agenda: pse-X> pse-X> Sun Nov 22 13:00:00 CST 2009
    ("due-date-for-entry" "121977" "3 hours")
  • Agenda: pse-X> pse-X> Sat Nov 21 13:00:00 CST 2009
    ("due-date-for-entry" "121936" "3 hours")
  • Agenda: pse-X> pse-X> Fri Nov 20 13:00:00 CST 2009
  • Agenda: pse-X> pse-X> Thu Nov 19 13:00:01 CST 2009
  • Agenda: pse-X> pse-X> Wed Nov 18 13:00:02 CST 2009
  • Agenda: pse-X> pse-X> Thu Nov 12 13:00:00 CST 2009
    ("due-date-for-entry" "120855" "3 hours")
  • Agenda: pse-X> pse-X> Tue Nov 10 13:00:00 CST 2009
    ("due-date-for-entry" "120333" "3 hours")
  • Agenda: pse-X> pse-X> Mon Nov 9 13:00:01 CST 2009
    ("due-date-for-entry" "119922" "3 hours")
  • Agenda: pse-X> pse-X> Sun Nov 8 14:59:33 CST 2009
    ("due-date-for-entry" "119869" "3 hours")
  • Agenda: pse-X> pse-X> Sat Nov 7 13:00:00 CST 2009
    ("due-date-for-entry" "119584" "3 hours")
  • Agenda: pse-X> pse-X> Fri Nov 6 13:00:01 CST 2009
    ("due-date-for-entry" "119438" "3 hours")
  • Agenda: pse-X> pse-X> Thu Nov 5 13:00:00 CST 2009
    ("due-date-for-entry" "118770" "3 hours")
  • Agenda: pse-X> pse-X> Fri Oct 30 13:00:01 CDT 2009
    ("due-date-for-entry" "118658" "3 hours")
  • Agenda: pse-X> pse-X> Thu Oct 29 13:00:00 CDT 2009
  • Agenda: pse-X> pse-X> Wed Oct 28 13:00:03 CDT 2009
    ("due-date-for-entry" "116868" "3 hours")
  • Agenda: pse-X> pse-X> Tue Oct 27 13:00:03 CDT 2009
    ("due-date-for-entry" "116115" "3 hours")
  • Agenda: pse-X> pse-X> Mon Oct 26 13:00:03 CDT 2009
    ("due-date-for-entry" "115948" "3 hours")
  • Agenda: pse-X> pse-X> Mon Oct 26 13:00:00 CDT 2009
    ("due-date-for-entry" "115943" "3 hours")
  • Agenda: pse-X> pse-X> Thu Oct 22 13:00:00 CDT 2009
    ("due-date-for-entry" "115460" "3 hours")
  • Agenda: pse-X> pse-X> Mon Oct 5 13:00:00 CDT 2009
  • Agenda: pse-X> pse-X> Thu Oct 1 13:00:00 CDT 2009
    ("due-date-for-entry" "114583" "3 hours")
  • Agenda: pse-X> pse-X> Tue Sep 29 13:00:00 CDT 2009
    ("due-date-for-entry" "114430" "3 hours")
  • Agenda: pse-X> pse-X> Mon Sep 28 13:00:01 CDT 2009
    ("due-date-for-entry" "114099" "3 hours")
  • Agenda: pse-X> pse-X> Sat Aug 22 13:00:00 CDT 2009
    ("due-date-for-entry" "113715" "3 hours")
  • Agenda: pse-X> pse-X> Fri Aug 21 13:00:00 CDT 2009
    ("due-date-for-entry" "113671" "3 hours")
  • Agenda: pse-X> pse-X> Thu Aug 20 13:00:01 CDT 2009
    ("due-date-for-entry" "113620" "3 hours")
  • Agenda: pse-X> pse-X> Wed Aug 19 13:00:00 CDT 2009
    ("due-date-for-entry" "113557" "3 hours")
  • Agenda: pse-X> pse-X> Sun Aug 9 13:00:00 CDT 2009
    ("due-date-for-entry" "113472" "3 hours")
  • Agenda: pse-X> pse-X> Sat Aug 8 13:00:00 CDT 2009
    ("due-date-for-entry" "113395" "3 hours")
  • Agenda: pse-X> pse-X> Fri Aug 7 13:00:00 CDT 2009
    ("due-date-for-entry" "113347" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jul 8 13:00:00 CDT 2009
    ("due-date-for-entry" "113236" "3 hours")
  • Agenda: pse-X> pse-X> Tue Jul 7 13:00:01 CDT 2009
    ("due-date-for-entry" "113189" "3 hours")
  • Agenda: pse-X> pse-X> Tue Jun 16 13:00:00 CDT 2009
    ("due-date-for-entry" "113135" "3 hours")
  • Agenda: pse-X> pse-X> Wed Jun 10 13:00:01 CDT 2009
    ("due-date-for-entry" "113091" "3 hours")
  • Agenda: pse-X> pse-X> Sun Jun 7 13:00:00 CDT 2009
    ("due-date-for-entry" "113039" "3 hours")
  • Agenda: pse-X> pse-X> Mon Jun 1 13:00:00 CDT 2009
    ("due-date-for-entry" "112998" "3 hours")
  • Agenda: pse-X> pse-X> Fri May 29 13:00:00 CDT 2009
    ("due-date-for-entry" "112926" "3 hours")
  • Agenda: pse-X> pse-X> Tue May 26 13:00:00 CDT 2009
    ("due-date-for-entry" "112858" "3 hours")
  • Agenda: pse-X> pse-X> Sat May 16 13:00:00 CDT 2009
    ("due-date-for-entry" "112773" "3 hours")
  • Agenda: pse-X> pse-X> Thu May 14 13:00:00 CDT 2009
    ("due-date-for-entry" "112735" "3 hours")
  • Agenda: pse-X> pse-X> Sun May 10 13:00:00 CDT 2009
    ("due-date-for-entry" "112650" "3 hours")
  • Agenda: pse-X> pse-X> Tue Apr 28 13:00:00 CDT 2009
    ("due-date-for-entry" "112162" "3 hours")
  • Agenda: pse-X> pse-X> Wed Apr 22 13:00:01 CDT 2009
    ("due-date-for-entry" "112074" "3 hours")
  • Agenda: pse-X> pse-X> Tue Apr 21 13:00:00 CDT 2009
    ("due-date-for-entry" "112015" "3 hours")
  • Agenda: pse-X> pse-X> Thu Apr 16 13:00:00 CDT 2009
    ("due-date-for-entry" "111967" "3 hours")
  • Agenda: pse-X> pse-X> Wed Apr 15 13:00:00 CDT 2009
    ("due-date-for-entry" "111927" "3 hours")
  • Agenda: pse-X> pse-X> Mon Apr 13 13:00:01 CDT 2009
    ("due-date-for-entry" "111890" "3 hours")
  • Agenda: pse-X> pse-X> Sun Apr 12 13:00:00 CDT 2009
    ("due-date-for-entry" "111853" "3 hours")
  • Agenda: pse-X> pse-X> Thu Apr 9 13:00:00 CDT 2009
    ("due-date-for-entry" "111732" "3 hours")
  • Be sure to incorporate Eclipse's Mylyn into verber/pse
  • Agenda: pse-X> pse-X> Tue Apr 7 13:00:00 CDT 2009
    ("due-date-for-entry" "111669" "3 hours")
  • Agenda: pse-X> pse-X> Wed Apr 1 13:00:00 CDT 2009
    ("due-date-for-entry" "111644" "3 hours")
  • Agenda: pse-X> pse-X> Mon Mar 30 13:00:01 CDT 2009
    ("due-date-for-entry" "111596" "3 hours")
  • Agenda: pse-X> pse-X> Fri Mar 27 13:00:00 CDT 2009
    ("due-date-for-entry" "111487" "3 hours")
  • Agenda: pse-X> pse-X> Thu Mar 26 13:00:01 CDT 2009
    ("due-date-for-entry" "111210" "3 hours")
    ("skipped" "111210")
  • Agenda: pse-X> pse-X> Tue Mar 24 13:00:00 CDT 2009
    ("due-date-for-entry" "111140" "3 hours")
    ("skipped" "111140")
  • Agenda: pse-X> pse-X> Mon Mar 23 13:00:01 CDT 2009
    ("due-date-for-entry" "111089" "3 hours")
    ("skipped" "111089")
  • Agenda: pse-X> pse-X> Sun Mar 22 13:00:01 CDT 2009
    ("due-date-for-entry" "111051" "3 hours")
    ("skipped" "111051")
  • Agenda: pse-X> pse-X> Sat Mar 21 13:00:01 CDT 2009
    ("due-date-for-entry" "110989" "3 hours")
    ("skipped" "110989")
  • Agenda: pse-X> pse-X> Fri Mar 20 13:00:00 CDT 2009
    ("due-date-for-entry" "110879" "3 hours")
    ("skipped" "110879")
  • Develop an Eclipse interface for pse/verber
  • Agenda: pse-X> pse-X> Thu Mar 19 13:00:00 CDT 2009
    ("due-date-for-entry" "110826" "3 hours")
    ("skipped" "110826")
  • Agenda: pse-X> pse-X> Wed Mar 18 13:00:00 CDT 2009
    ("due-date-for-entry" "110774" "3 hours")
  • Agenda: pse-X> pse-X> Tue Mar 17 13:00:01 CDT 2009
    ("due-date-for-entry" "110618" "3 hours")
    ("skipped" "110618")
  • Agenda: pse-X> pse-X> Mon Mar 16 13:00:00 CDT 2009
    ("due-date-for-entry" "110339" "3 hours")
    ("completed" "110339")
  • Agenda: pse-X> pse-X> Sun Mar 15 13:00:01 CDT 2009
    ("due-date-for-entry" "110291" "3 hours")
    ("skipped" "110291")
  • Agenda: pse-X> pse-X> Fri Mar 13 13:00:00 CDT 2009
    ("due-date-for-entry" "110009" "3 hours")
    ("skipped" "110009")
  • Agenda: pse-X> pse-X> Wed Mar 11 13:00:00 CDT 2009
    ("due-date-for-entry" "109827" "3 hours")
    ("skipped" "109827")
  • Agenda: pse-X> pse-X> Tue Mar 10 13:00:00 CDT 2009
    ("due-date-for-entry" "109410" "3 hours")
    ("skipped" "109410")
  • Agenda: pse-X> pse-X> Mon Mar 9 13:00:00 CDT 2009
    ("due-date-for-entry" "108947" "3 hours")
    ("skipped" "108947")
  • Agenda: pse-X> pse-X> Sat Mar 7 13:00:00 CST 2009
    ("due-date-for-entry" "108859" "3 hours")
    ("skipped" "108859")
  • Agenda: pse-X> pse-X> Thu Mar 5 13:00:00 CST 2009
    ("due-date-for-entry" "108128" "3 hours")
    ("skipped" "108128")
  • KBS, pse-x all-assertions
  • Agenda: pse-X> pse-X> Wed Mar 4 13:00:00 CST 2009
    ("due-date-for-entry" "107904" "3 hours")
    ("skipped" "107904")
  • Agenda: pse-X> pse-X> Tue Mar 3 13:00:00 CST 2009
    ("due-date-for-entry" "107790" "3 hours")
    ("skipped" "107790")
  • KBS, pse-x-test assert ("depends" "1" "2")
  • Agenda: pse-X> pse-X> Mon Mar 2 13:00:01 CST 2009
    ("due-date-for-entry" "107656" "3 hours")
    ("skipped" "107656")
  • Agenda: pse-X> pse-X> Sun Mar 1 13:00:00 CST 2009
    ("due-date-for-entry" "107521" "3 hours")
    ("skipped" "107521")
  • KBS, pse-x all-asserted-knowledge
  • KBS, pse-x query (?X)
  • KBS, pse-x query (eases ?X ?Y)
  • KBS, pse-x query ("eases")
  • KBS, pse-x query ("eases" ?X)
  • KBS, pse-x assert ("eases" 107405 107420)
  • KBS, pse-x query ("eases" ?X ?Y)
  • KBS, pse-x query (nil)
  • KBS, pse-x query ()
  • Agenda: pse-X> pse-X> Sat Feb 28 13:00:00 CST 2009
    ("due-date-for-entry" "107323" "3 hours")
    ("skipped" "107323")
  • Write a system for authorization requests... or rather, opinion requests, for pse tasks.
  • Create special ushell-mode key bindings for freekbs, pse, etc.
  • Write code to email people tasks that are assigned to them by pse.
  • Have pse break goals into multiple goals when necessary.
  • Tomorrow, then first thing, have the todo list pop up. We can have todo lists popping up for now in liu of score/pse working really.
  • Maybe its getting time to get field goal working. Now obviously, fieldgoal depends on pse.
  • Existing task completion cycles should fuel the direction of the pse.
  • There are a few things I could work on, and they are related. I can work on the temporal semantics of pse goals in order to improve our ability to satisfy them. Heck maybe you can infer dependencies on the basis of concept/temporal semantics.
  • Add features to manager that enable it to issue instructions to the user before they go to sleep about what to think/dream about consistent with their pse.
  • score or pse should implement critical path and WBS stuff from Schaum's.
  • Create a formal model of well-being, and use that to reduce problems to for pse.
  • pse could consider outcome expectation, variance...
  • In thinking it over, although I want to get verber going, I don't think it is as critical as getting something that determines what the critical path is, i.e., getting pse/score fully operational, to the point where we can assert that things have been done. I don't know that we need to get it to the point where it classifies new items, but that we can specifically annotate existing ones.
  • Take the pse goals and convert them to goal axioms where possible. Use that ontology information from Opt.
  • Maybe it is easy to spot nonsense situations like the one above. Add that to time management system via pse.
  • Could add a few rules somehow to aid classifications, for instance, pse at the beginning is often not a pse requirement, etc.
  • Here is an idea - for every requirement, we can guarantee some axiomitization of that requirement for the purposes of planning. It is through that axiomitization that we can improve pse or whatever that planning system I was working on is called.
  • Insert all sorts of hooks for manager/pse to know the current working context.
  • Get task completion operational in pse.
  • boss/architect should support most of those metrics in the Schaums system. Could use pse for scheduling?
  • Note that in order to determine whether something is working, we look at a few simple things. We know what the work context is from manager, and we know what the current tasks are from score/pse this new thing. So, just ask them from time till time what they got done. Another thing is if a file that is associated with a task is closed, we can queue a question about that task!.
  • /var/lib/myfrdcsa/codebases/internal/unilang/start audience broker clear corpus cso ELog OpenCyc pse unilang-Client
  • Then first thing, have the todo list pop up. We can have todo lists popping up for now in liu of score/pse working really.
  • Event system (which works now) should use pse pop up for reminders
  • So whenever a task is achieved, we report it here, (and once add a new category called completed tasks). By recording it here, and automatically matching it to the task list, we both add new info as well as allow it to automatically mark the task as complete. So pse should fire back a message indicating which tasks that closes and the incremental score!
  • One major criteria is that pse should know that certain entries such as capability requests are generally not as important as other ones.
  • The main advantage of verber is the complex layout reasoning. But to even know what to include into verber depends on pse, so maybe we should focus on that, but, on the other hand, leaving the verber interface open will complicate the development of pse, so perhaps instead should focus on verber. This is just like the Todd Freitag game where he had analysis paralysis.
  • pse should use a command grammer.
  • unilang/pse should also consider the changing landscape of requirements, when asserting these.
  • The pse system should have a mode for recognizing dependencies, and this is where it generates a list of estimated pre and post dependencies for each item, (focusing of course on important items).
  • Obviously pse should use a database.
  • Okay, I have the pse.log file loaded into SQL along with a script to load it for us.
  • (Then we implement the part of pse that does dependency guessing)
  • (We want to get pse working, tonight!)
  • Could add a few rules somehow to aid classifications, for instance, pse at the beginning is often not a pse requirement, etc.
  • Event system (which works now) should use pse pop up for reminders
  • Work on part for classifying tasks into various logics and keeping track of their progress using score/pse, by recording successful completion of tasks.
  • score or pse should implement critical path and WBS stuff from Schaum's.
  • Get task completion operational in pse.
  • Existing task completion cycles should fuel the direction of the pse.
  • One major criteria is that pse should know that certain entries such as capability requests are generally not as important as other ones.
  • Still need to convert existing pse.log to SQL.
  • fix pse-start-showing-goals-when-idle
  • Create a formal model of well-being, and use that to reduce problems to for pse.
  • pse could consider outcome expectation, variance...
  • Inventory management can use freekbs for relational store and world modelling : /var/lib/myfrdcsa/codebases/internal/pse/misc/scheduler/2/domains
  • (Here is the todo for unilang/corpus/pse)
  • /var/lib/myfrdcsa/codebases/internal/unilang/start audience broker clear corpus cso ELog OpenCyc pse unilang-Client
  • /var/lib/myfrdcsa/codebases/internal/unilang/start audience broker clear corpus cso ELog manager OpenCyc pse unilang-Client
  • Be sure to find all instances of pse.log
  • (all other systems, like pse, then reference the SQL table via primary key)
  • Insert all sorts of hooks for manager/pse to know the current working context.
  • KBS, default query ("pse-has-property" ?X ?Y)
  • Setup pse remit.
    ("completed" "86134")
  • Add a system that uses timex3 and sends a message to unilang-client that says something like "Authorize: 3025823 ("pse-due-date" "235523" "1 month")" for something that says "do this next month".
  • Create a snarf function for pse due date stuff that uses time3 annotations to snarf dates from the emacs region.
  • Add a "requestor" model into the pse system
  • pse: Have a system that, while not necessarily forcing you to do things, at least has you look at it by a certain time...
  • KBS, query ("pse-has-property" ?X "habitual")
  • Have the pse agenda system determine when things were accomplished on time.
  • KBS, assert ("pse-property" "very important")
  • Write software for being able to change predicates within KBS. for instance, suppose we realize that "comment" is really better put as "pse-comment" or "goal-comment".
  • KBS, assert ("pse-property" "optional")
  • KBS, assert ("pse-property" "habitual")
  • Write up a document that details all the questions I am having about pse, freekbs, etc
    ("completed" "67915")
  • Have pse email me or some such thing when it becomes true that a goal is completed that is a predepends for another goal, mention the other goal saying, perhaps you should work on this. Or just include it in the list of suggested goals.
  • KBS, MySQL:freekbs:default assert ("comment" "41150" "There is something similar to this in pse, a collection of several todo lists, but it is old.")
  • Start showing people what certain systems are like. For instance pse is like hiveminder.com.
  • What does pse do about circular dependencies?
  • Eventually convert pse to run off of a database, like mysql or postgresql
  • What system should manage internet access planning? pse?
  • Therefore pse should record who posted the goal.
  • Maybe we can use planner-el as the basis for the pse interface.
  • States for pse are finished, not finished, stale, etc.
  • Should have redirects, like pse, tell audience, search goals
  • This would be as a means to disambiguate items. For instance - "create capabilities management system" - is this done? Well, when corpus is done, it will be, but how does pse know that necessarily.
  • pse can from time to time quiz the user about whether certain events have taken place.
  • We can measure the typing rates and improve people's hacker score - which consists of type rate * LOC * pse rating, etc,etc,et
  • In other words, pse ought to affect the world state.
  • Here are some different kinds of pse input. do this when this happens.
  • Another thing is we can have a "skills explorer" or something that maps out accomplishments from pse to job-search.
  • It would be at least possible, perhaps not desirable, to actually use fweb project pages to display output information - for instance, pse, could display public goals through fweb.
  • Note that CELT could be used for audience/Machiavelli/pse, for audience for ACLs, for Machiavelli for who should know what, and for pse for plan information and proof - mixed with CPR (core plan representation) and those kinds of things at teknowledge
    ("rejected" "3673")
  • pse should look at: http://reliant.teknowledge.com/CPR2/Reports/CPR-RFC4/Design.html#_Toc435005567
  • We can use CELT and Snark with pse to ensure that goals are met.
  • Finish classification and get pse basically working.
  • This would list the most recent tasks, which would be useful for determining whether they had been completed or not. Maybe that's how pse should work. These tasks will sit there unless accomplished, since pse will index them and record whether they have been accomplished or not, until such time as the user says they are not accomplished or specifies a dependency.
  • Should set verber up to do that stuff like "verber -t laundry" to launch a task like doing launch. We need a task hierarchy from pse or something. There are certain tasks that are repeatable and we should usually have those in verber.
  • I believe I should get something preliminary going for pse pretty soon - as exported from corpus, for now. So that we can begin to get an agenda in place. From this agenda, and from the interest mapping system, we can start getting activities going.
  • numerous ideas on the subject: should have classes be a type hierarchy. Maybe build a grpahical tool to interactivcely classify these. Convert these system over to kbfs::Cache, keeping a copy of current method. For each icodebase and common (agentified), add a class. For instance, rather than classifying into a vague category, you could classy directly to "pse, goal", etc.
  • Maybe pse should maintain world model?
  • pse or verber should keep track of which goals are currently scheduled by verber, and which have been completed.
  • /var/lib/myfrdcsa/codebases/internal/unilang/start pse OpenCyc unilang-Client
  • Note we can still use HTN's for pse, i.e. cyc, because we can simply state these goals and have a small set of preconditions that just assure tasks are completed.
  • Maybe corpus could handle formalization of everything - from verber and pse entries to?
  • RSR can take as input for productivity output from pse/verber.
  • If I restale a goal pse should recognize this means to reprioritize it.
  • pse should be able to list everything that should be done that morning.
  • pse should take note of what I am doing in order to help me along.
  • Need to have some kind of Emacs pse interface, with features like add task, show priority queue, etc. These tasks could have contexts.
  • With verber looking more complete, a lot of this stuff is more possible. Now we just need to debug pse.
  • pse can handle deconfliction.
  • Note that this very log file is discontinguous and the recent parts are strangely found here: /home/jasayne/.pse/pse.log
  • This protocal can actually be integrated into pse by default!
  • Can use pse to schedule things.
  • We can also use the event system to schedule what we work on. So, for instance, coordinating verber,pse and Event, we can create a plan for going to the robotics club to resolder the connections to the laptop.
  • Have automatic dependency estimation for pse.
  • Since pse doesn't have goals added all that much, calling save after every goal is probably a good idea.
  • I think this strange tmon.out file is being generated with the pse, print command
  • /var/lib/myfrdcsa/codebases/internal/unilang/start pse opencyc unilang-client
  • Here are some of the things we need to do next: fix the way pse craps out all the time, get Clairvoyance working and with some basic document management systems, including for instance authorized reports to ensure back to me that various people are learning various things (based on testing), find some way to get those recipes normalized, get shops up and running and taking inventory of everything I have, add this information to verber, get MDR (minimum detection route) planning operational, get new tagsets for AWB/Predator working, fix problem with script determining perl dependencies, make packages of my systems and upload, fix mini-dinstall problem, write tutorial on agentification, agentify or otherwise get command line bugzilla working, fix up manager with sleep learning capabilities, create a sample course for clairvoyance, and run backup. You're such a lazy guy, you know that?
  • Fix problem with pse
  • Wouldn't it be rather useful if pse were implemented in Scheme or something/
  • pick up some items which WE FORGOT (i.e. pse), and was pulled over by
  • Should have an Emacs interface to pse, which allows us to view goals interactively in a window.
  • possibly use emdros to store pse stuff.
  • can use pse to generate very current agenda data structure, so for instance, it pops up questions: how do we store ftp ls-alr files?
  • should (minimally) distinguish high level goals from small goals for now, or until we can actually get pse fed with everything.
  • should add a "pse, subgraph <CycId>" function to build a nearest neighbor graph of this goal
  • should add a "pse, subgraph " function to build a nearest neighbor graph of this goal
  • Things remaining for gourmet: Finish XML generation code, clean it up. Find-or-create database standardization system, add to recipe managment. Find-or-create a queryable (XML|RDF) database to store recipeml files and provide utilities for searching. Write interface to SR16, as well as other modules and databases for nutrition calculation. Find-or-create solution to the nutrition management problem. Interface to pse to generate meal plans. Find-or-create reinforcement learning to model users tastes. Interface to manager to know when to review a meal. Look into open system for interactively managing food planning by providing a food preparation library.
  • I really need to get cracking. My goal should be to have all messages on pse by tomorrow, also with pse having some features.
  • libxerces2-java does some kind of normalization as reported by apt-cache search -f, but probably not the correct kind, anyway, this so called feature request should be put in the appropriate list. really, in addition to pse, we really have to write NLP systems to recognize problems, feature requests, etc.
  • critic could possibly even use unilang to communicate, say, task dependencies to pse.
  • critic will be dangerous and difficult to write. Maybe make it into an emacs system, or write an abstraction. Is critic really necessary for pse? I don't think so. Really, just move the frdcsa-perl shit into radar, install those pse mods, read their manuals and be done with it. Then you can hanker down on pse again!
  • I am starting to imagine some real interplay between critic and pse
  • here are some dependencies: pse unilang ?, pse myfrdcsa::Conf ?, pse critic?
  • does pse depend on critic?
  • what about pse?
  • aap for pse, autopackage
  • we can use pse to create plan libraries, with abstract specification of common programming tasks or equivalent that guide the user through the process. For instance, that guide with creating a new project.
  • This problem domain is of course entirely out of our capability to solve, so I am writing unilang and pse to make things simpler.
  • Basic plan for now is to use the shops system to finish the telnet communication part of unilang. Then go about trying to get modules installed on our system and reading that manuals for packages that apply to what we are doing. Then go ahead and try to get that part of the system done that sends messages back and forth from pse.
  • Should generate todo files, or equivalent thereof, from pse
  • After pse is finished, we should aim to get myfrdcsa and FRDCSA-dist working, that is, to have working installable packages for everything. Beautiful.
  • The manager systems functions as a goal planning system for persons, much like pse, only that the goals involve satisfying certain properties like getting enough rest, getting a good meal --- haha, we can integrate gourmet and manager here.
  • work on the unilang system has been temporarily abandoned. all concentration going to simply designing algorithms for pse.
  • some things have come to mind - break down the study of pse into smaller, more feasible sections. I.e., at what level are we planning. Use existing research to guide this.
  • The main goals right now are to overwrite unilang with the new version, get that interlanguage stuff to work, then collect and implement basic pse features that can be handled effectively by custom code and/or existing modules, but (probably) little reliance on external code as we can't very well use it yet. Should also make sure that the representational components are independant of the computational components, i.e. don't rely strictly on an XML pipeline.
  • WRT pse.
  • should get a simplistic version of pse running tonight.
  • A natural thing to do is use manager to initiate shifts between fronts and goals that are generated by pse
  • Use information from pse to determine which capabilities are desired, and then start searches for systems that match these capabilities, and use this to direct the search and review process of software.
  • I think I should get shops done and then work solely on pse, with the others naturally being developed.
  • So far pse handles the tactics of planning, but I don't see it handling strategy, that is, unless we create binding formula, and knowledge.
  • I must say, that I wrote a letter today about becoming an interrogator, all of this when I could have been programming this pse system. This is obviously a problem and again, we must patiently, correctively bear through such mistakes. In general, writing should be avoided, programming should be encouraged. This ought to go in manager.
  • Analogize pse to memos in certain ways, given the social componenet.
  • I just realized why there are no such systems, as pse, tey're too poewrful.
  • For now, we ought to simply write that utility based planner for pse.
  • Probably for starters, we should simply figure out the system for pse.


This page is part of the FWeb package.
Last updated Sat Oct 26 16:54:23 EDT 2019 .