PPT Slide

• each atomic condition A1 … Am is of form

  • Path( from_node, path_expression, to_node)
    • x5 = | (->*) x7
    • enumerate links to check these
  • NodePredicate(node)
    • CONTAINS “Bob’s Coffee Place” (x5)
    • query a “customizable set of known” search engines

• what queries are computable?

  • those that don’t have to explore the entire web
  • “safe” queries: every variable must be
    • either directly solvable in some atomic condition, OR
    • directly derivable from another in some atomic condition

Previous slide

Next slide

Back to first slide

View graphic version