公开(公告)号：US20130173653A1

公开(公告)日：2013-07-04

申请号：US13341883

申请日：2011-12-30

申请人： Brian Beckman ,  Eyal Ofek ,  Gur Kimchi ,  Elad Gerson ,  Richard A. Clawson

发明人： Brian Beckman ,  Eyal Ofek ,  Gur Kimchi ,  Elad Gerson ,  Richard A. Clawson

IPC分类号： G06F17/30

CPC分类号： G06Q10/04 ,  G06Q10/063 ,  G06Q10/109

摘要： A sequence of events may be planned by drawing on knowledge of existing sequences of events, and combining those events in accordance with a set of constraints. In one example, the sequences of events are events in a social agenda, such as dinner, drinks, movie, etc. Actual social agendas that users have carried out are monitored (with the users' permission), and these events are stored in a database. A sequence of events may be referred to as an existing path. Using the database, a system can respond to a query such as “plan an evening in Seattle,” or “plan an evening in that includes a movie” by querying the database to determine what sequences have already happened, and either retrieving an existing sequence or synthesizing a new one from existing sequences.

摘要翻译： 可以通过利用现有事件序列的知识来计划事件序列，并且根据一组约束来组合这些事件。 在一个例子中，事件序列是社会议程中的事件，例如晚餐，饮料，电影等。用户执行的实际社会议程被监视（经用户许可），并且这些事件被存储在 数据库。 事件序列可以被称为现有路径。 使用数据库，系统可以通过查询数据库来确定已经发生了哪些序列，并且检索现有的序列来响应查询，例如“在西雅图计划一个晚上”或“计划包含电影的晚上” 或从现有序列合成新的。