OpenCog

  • Category
  • Discussion
  • View source
  • History
 
  • Personal tools
    • Create account
    • Log in
  • Navigation
    • Home
    • Map of wiki
    • Code
  • Tools
    • What links here
    • Related changes
    • Special pages
    • Printable version
    • Permanent link
    • Page information

Category:Graph rewriting

From OpenCog
Jump to: navigation, search

Articles that in some way pertain to graph re-writing. The primary focus is a move to the unified rule engine.

Pages in category "Graph rewriting"

The following 23 pages are in this category, out of 23 total.

A

  • AbsentLink
  • Atom relationships

C

  • ChoiceLink

D

  • DefineLink
  • DontExecLink
  • DualLink

E

  • Expressing PLN Rules As Atoms

G

  • GetLink
  • GlobNode

I

  • Idea: Approximate Pattern Matching
  • Idea: Recursive Unification using the Pattern Matcher
  • Idea: Reduct for hypergraphs

M

  • MapLink

P

  • Pattern matching
  • PresentLink

Q

  • QuoteLink

R

  • RelEx Dependency Relationship Extractor

S

  • SatisfactionLink and BindLink

U

  • UnquoteLink
  • URE Control Policy
  • URE historical discussion

V

  • VariableNode
  • Virtual links
Retrieved from "https://wiki.opencog.org/wikihome/index.php?title=Category:Graph_rewriting&oldid=20670"
Categories:
  • Infrastructure Documentation
  • URE
GNU Free Documentation License 1.2
Powered by MediaWiki
  • This page was last edited on 31 December 2015, at 05:26.
  • Content is available under GNU Free Documentation License 1.2 unless otherwise noted.
  • Privacy policy
  • About OpenCog
  • Disclaimers