patrick/plasp
Archived
1
0
Fork 0
Code Issues 12 Releases 8 Activity

Implemented simplification of directly nested n-ary expressions of the same type.

Browse Source
This commit is contained in:
Patrick Lühne
2016-09-05 00:37:43 +02:00
parent 79d449d0df
commit 263b611a7b
4 changed files with 70 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
include/plasp/pddl/Expression.h
View File

@@ -112,6 +112,7 @@ class Expression
ExpressionPointer normalized();
virtual ExpressionPointer reduced();
virtual ExpressionPointer negationNormalized();
virtual ExpressionPointer simplified();
ExpressionPointer negated();
virtual void print(std::ostream &ostream) const = 0;

37
include/plasp/pddl/expressions/NAry.h
View File

@@ -35,6 +35,7 @@ class NAry: public ExpressionCRTP<Derived>
ExpressionPointer reduced() override;
ExpressionPointer negationNormalized() override;
ExpressionPointer simplified() override;
void print(std::ostream &ostream) const override;
@@ -145,19 +146,41 @@ inline ExpressionPointer NAry<Derived>::negationNormalized()
m_arguments[i] = m_arguments[i]->negationNormalized();
}
/*// Unify same-type children
for (size_t i = 0; i < m_arguments.size(); i++)
return this;
}
////////////////////////////////////////////////////////////////////////////////////////////////////
template<class Derived>
inline ExpressionPointer NAry<Derived>::simplified()
{
// Associate same-type children, such as (a && (b && c)) == (a && b && c)
for (size_t i = 0; i < m_arguments.size();)
{
m_arguments[i] = m_arguments[i]->simplified();
if (m_arguments[i]->expressionType() != Derived::ExpressionType)
{
i++;
continue;
}
auto &nAryExpression = dynamic_cast<Derived &>(*m_arguments[i]);
auto child = m_arguments[i];
auto &nAryExpression = dynamic_cast<Derived &>(*child);
m_arguments.reserve(m_arguments.size() + nAryExpression.arguments().size());
BOOST_ASSERT(!nAryExpression.arguments().empty());
m_arguments.emplace_back(nAryExpression.arguments());
m_arguments.erase(const_iterator __position)
}*/
// Remove former child by replacing it with the first one of the child
m_arguments[i] = nAryExpression.arguments().front();
// Reserve space for new arguments
m_arguments.reserve(m_arguments.size() + nAryExpression.arguments().size() - 1);
// Copy all but first element
m_arguments.insert(m_arguments.end(), nAryExpression.arguments().begin() + 1, nAryExpression.arguments().end());
}
// TODO: recognize tautologies
return this;
}