Menu

#3 ExprPred and unification

open
rules (1)
5
2006-10-03
2006-10-03
Petra Malik
No

The current unification algorithm doesn't handle
ExprPred very well. For example, the predicate A \land
B can be parsed as
<ExprPred>
<AndExpr>...</AndExpr>
<ExprPred>
or as
<AndPred>
<ExprPred>...</ExprPred>
<ExprPred>...</ExprPred>
</AndPred>

These are semantically equivalent but don't unifiy at
the moment. It would be nice to improve the
unification so that they do unify.

Discussion


Log in to post a comment.

Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.