public void Test4()
{
ObjectVariableTerm x = new ObjectVariable('x');
IndividualConstantTerm <RationalNumber> half =
(IndividualConstant <RationalNumber>)(new RationalNumber(1, 2));
IndividualConstantTerm <RationalNumber>
one = (IndividualConstant <RationalNumber>)(new RationalNumber(1, 1));
var pr1 = new PredicateFormula(Predicates.More, x, half);
var pr2 = new PredicateFormula(Predicates.Less, x, one);
var f1 = new PropositionalConnectiveFormula(Conjunction.GetInstance(), pr1, pr2);
var f2 = new QuantifierFormula(ExistentialQuantifier.GetInstance(), x, f1);
IndividualConstantTerm <int> two = new IndividualConstant <int>(2);
var xSqr = new FunctionTerm(Functions.Pow, x, two);
var pr3 = new PredicateFormula(Predicates.MoreZero, xSqr);
var pr4 = new PredicateFormula(Predicates.EqualZero, x);
var f3 = new PropositionalConnectiveFormula(Disjunction.GetInstance(), pr3, pr4);
var f = new PropositionalConnectiveFormula(Conjunction.GetInstance(), f2, f3);
var actual = SimpleTarskiAlgorithm.QuantifiersElimination(f);
Formula expected = f3;
Formula expected1 = new PropositionalConnectiveFormula(Disjunction.GetInstance(), pr4, pr3);
Assert.IsTrue(expected.Equals(actual) || expected1.Equals(actual));
}
private static void CalcUnaryPropositionalConnective(Stack <object> stack, UnaryPropositionalConnective connective)
{
if (stack.Count < 1)
{
throw new ArgumentException($"one formula was expected for {connective}");
}
try
{
var right = (Formula)stack.Pop();
var newFormula = new PropositionalConnectiveFormula(connective, right);
stack.Push(newFormula);
}
catch (Exception)
{
throw new ArgumentException($"one formula was expected for {connective}");
}
}
private static void CalcBinaryPropositionalConnective(Stack <object> stack, BinaryPropositionalConnective connective)
{
if (stack.Count < 2)
{
throw new ArgumentException($"two formulas were expected for {connective}");
}
try
{
var right = (Formula)stack.Pop();
var left = (Formula)stack.Pop();
var newFormula = new PropositionalConnectiveFormula(connective, left, right);
stack.Push(newFormula);
}
catch (Exception)
{
throw new ArgumentException($"two formulas were expected for {connective}");
}
}
public void Test2()
{
ObjectVariableTerm x = new ObjectVariable('x');
IndividualConstantTerm <RationalNumber> half =
(IndividualConstant <RationalNumber>)(new RationalNumber(1, 2));
IndividualConstantTerm <RationalNumber> one = (IndividualConstant <RationalNumber>) new RationalNumber(1, 1);
var pr1 = new PredicateFormula(Predicates.More, x, half);
var pr2 = new PredicateFormula(Predicates.Less, x, one);
var f1 = new PropositionalConnectiveFormula(Conjunction.GetInstance(), pr1, pr2);
var f2 = new QuantifierFormula(ExistentialQuantifier.GetInstance(), x, f1);
var actual = SimpleTarskiAlgorithm.QuantifiersElimination(f2);
var expected = new PredicateFormula(True.GetInstance());
Assert.AreEqual(expected, actual);
}
