naga.rules — naga 0.1.0

Defines rule structures and constructors to keep them consistent

check-symbol clj

(check-symbol sym)

Asserts that symbols are unbound variables for a query. Return true if it passes.

create-program clj

(create-program rules axioms)

Inputs: [rules :- [Rule] axioms :- [Axiom]] Returns: Program

Converts a sequence of rules into a program. A program consists of a map of rule names to rules, where the rules have dependencies.

dbg clj

(dbg x)

find-matches clj

(find-matches a [nm sb])

Inputs: [a :- EPVPattern [nm sb] :- [(s/one s/Str "rule-name") (s/one Body "body")]] Returns: [RulePatternPair]

returns a sequence of name/pattern pairs where a matches a pattern in a named rule

mark-unbound clj

(mark-unbound head body)

Convert a head to use fresh vars for any vars that are unbound. Scans the vars in the body to identify which vars are unbound.

match? clj

(match? a b)

Inputs: [a :- EPVPattern b :- EPVPattern] Returns: s/Bool

Does pattern a match pattern b?

Matching clj protocol

compatible clj

(compatible x y)

Returns true if both elements are compatible

named-rule clj

(named-rule name {:keys [head body salience downstream]})

Inputs: [name :- Rule {:keys [head body salience downstream]} :- s/Str] Returns: Rule

Creates a rule the same as an existing rule, with a different name.

r clj macro

(r & [f :as rs])

Create a rule, with an optional name. Var symbols need not be quoted.

rule clj

(rule head body)

(rule head body name)

Inputs: ([head body] [head body name]) Returns: Rule

Creates a new rule