Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Removed errors to make the build pass #418

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
May 28, 2017
Merged

Removed errors to make the build pass #418

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
b5bb68e
removed flake8 errors
articuno12 Mar 25, 2017
8841515
fixed remaining flake8 errors
articuno12 Mar 29, 2017
a28bb21
fixed loop
articuno12 Mar 31, 2017
001bcd4
added space
articuno12 Mar 31, 2017
138b8d1
Merge branch 'master' into flake8
norvig May 28, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion csp.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -339,7 +339,6 @@ def topological_sort(X, root):
visited shows the state (visited - not visited) of nodes

"""
nodes = X.variables
neighbors = X.neighbors

visited = defaultdict(lambda: False)
Expand Down
20 changes: 18 additions & 2 deletions logic.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -845,8 +845,24 @@ def subst(s, x):
return Expr(x.op, *[subst(s, arg) for arg in x.args])


def fol_fc_ask(KB, alpha): # TODO
raise NotImplementedError
def fol_fc_ask(KB, alpha):
"""A simple forward-chaining algorithm. [Figure 9.3]"""
new = []
while new is not None:
for rule in KB.clauses:
p, q = parse_definite_clause(standardize_variables(rule))
for p_ in KB.clauses:
if p != p_:
for theta in KB.clauses:
if subst(theta, p) == subst(theta, p_):
q_ = subst(theta, q)
if not unify(q_, KB.sentence in KB) or not unify(q_, new):
new.append(q_)
phi = unify(q_, alpha)
if phi is not None:
return phi
KB.tell(new)
return None


def standardize_variables(sentence, dic=None):
Expand Down