use of com.sri.ai.grinder.theory.differencearithmetic.DifferenceArithmeticTheory in project aic-expresso by aic-sri-international.
the class Tests method main.
public void main(String[] args) {
// Theory initialization
theory = new CompoundTheory(new EqualityTheory(false, true), new DifferenceArithmeticTheory(false, false), new LinearRealArithmeticTheory(false, false), new TupleTheory(), new PropositionalTheory());
context = new TrueContext(theory);
context = context.extendWithSymbolsAndTypes("A", "Boolean");
// Testing BFS Expander
println("Testing BFS.");
testingBFS();
// // Testing on standard output (output results on screen)
// println("Testing and printing on screen.");
// testingAndPrintingOnScreen();
println("Running main test.");
runTest();
}
use of com.sri.ai.grinder.theory.differencearithmetic.DifferenceArithmeticTheory in project aic-expresso by aic-sri-international.
the class SampleCommonInterpreterTest method setUp.
@Before
public void setUp() {
// Make tests repeatable
random = new Random(1);
context = new TrueContext(new CompoundTheory(new DifferenceArithmeticTheory(false, false), new LinearRealArithmeticTheory(false, false), new EqualityTheory(false, false), new PropositionalTheory()));
}
use of com.sri.ai.grinder.theory.differencearithmetic.DifferenceArithmeticTheory in project aic-expresso by aic-sri-international.
the class SamplingProceduralAttachmentSingleQuantifierEliminatorTest method test.
@Test
public void test() {
String intervalString = "0..10";
Context context = new TrueContext(new DifferenceArithmeticTheory(true, true));
MultiQuantifierEliminationProblem problem = new DefaultMultiQuantifierEliminationProblem(new Sum(), list(parse("I")), list(parse(intervalString)), parse("I != 3"), parse("I^2"));
SamplingProceduralAttachmentSingleQuantifierEliminator eliminator = new SamplingProceduralAttachmentSingleQuantifierEliminator(new CommonSimplifier(), new Random());
// SHOULD NOT HAVE TO
context = problem.extend(context);
Expression sampler = eliminator.solve(problem, context);
println(sampler);
Rewriter rewriter = new CombiningTopRewriter(new CommonSimplifier(), ProceduralAttachments.getProceduralAttachmentsTopRewriter(context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
println(rewriter.apply(sampler, context));
}
use of com.sri.ai.grinder.theory.differencearithmetic.DifferenceArithmeticTheory in project aic-expresso by aic-sri-international.
the class BoundsTest method declareTheoryContextAndSetOfFactors.
private void declareTheoryContextAndSetOfFactors() {
/* That's how we create a empty bound
* It is useful for abstracting the kind of bound we are talking about:
* if you say to a program that one of his attributes is a bound, you can let the user choose
* between a extensional or intensional representation just by passing the right object as
* argument.
*
* Example:
*
* class foo{
* Bound b
* ...
* public foo(Bound b, ...) {
* this.b = b;
* ...
* }
* }
*
* Use:
* foo object = new foo(new DefaultExtensionalBound(),...);
*
* */
ExpressoConfiguration.setDisplayNumericsExactlyForSymbols(true);
extensionalBound = new DefaultExtensionalBound();
intensionalBound = new DefaultIntensionalBound();
theory = new CompoundTheory(new EqualityTheory(false, true), new DifferenceArithmeticTheory(false, false), new LinearRealArithmeticTheory(false, false), new TupleTheory(), new PropositionalTheory());
context = new TrueContext(theory);
context = context.extendWithSymbolsAndTypes("X", "Boolean");
context = context.extendWithSymbolsAndTypes("Y", "Boolean");
context = context.extendWithSymbolsAndTypes("A", "Boolean");
context = context.extendWithSymbolsAndTypes("B", "Boolean");
context = context.extendWithSymbolsAndTypes("C", "1..5");
// context = context.extendWithSymbolsAndTypes("D","{1,3,4,8}");
// Set of functions
Expression phi1 = parse("if X = true then 1 else if Y = true then 2 else 3");
Expression phi2 = parse("if A = true then if Y = true then 4 else 5 else 6");
Expression phi3 = parse("if X = true then 7 else if B = true then 8 else 9");
Expression phi4 = parse("if B = true then 10 else if A = true then 11 else 12");
Expression phi5 = parse("if C < 4 then 10 else if C = 4 then 11 else 12");
/*
* This is how we create a non empty extensional bound
*/
setOfFactors = new DefaultExtensionalBound(arrayList(phi1, phi2, phi3, phi4, phi5));
// Set of numbers
setOFNumbers = new DefaultExtensionalBound(arrayList(ONE, TWO));
Set<Expression> Factor = new HashSet<Expression>();
model = new Model(Factor);
model.context = model.context.extendWithSymbolsAndTypes("A", "Boolean");
model.context = model.context.extendWithSymbolsAndTypes("B", "Boolean");
model.context = model.context.extendWithSymbolsAndTypes("Q", "Boolean");
model.context = model.context.extendWithSymbolsAndTypes("C", "1..4");
model.context = model.context.extendWithSymbolsAndTypes("D", "6..9");
intensionalSetOfFactors1 = new DefaultIntensionalBound(arrayList(parse("A' in Boolean"), parse("C' in 1..5")), parse("if C = C' then if A = A' then 1 else 4 else 0"), TRUE);
intensionalSetOfFactors2 = DefaultIntensionalBound.simplex(arrayList(parse("A")), model);
intensionalSetOfFactors3 = DefaultIntensionalBound.simplex(arrayList(parse("C"), parse("B")), model);
}
use of com.sri.ai.grinder.theory.differencearithmetic.DifferenceArithmeticTheory in project aic-expresso by aic-sri-international.
the class IntensionalSetFalseConditionToEmptySetSimplifierTest method setUp.
@Before
public void setUp() {
context = new TrueContext(new CompoundTheory(new DifferenceArithmeticTheory(false, false), new TupleTheory()));
IntegerInterval nType = new IntegerInterval(1, 10);
context = (Context) GrinderUtil.extendRegistryWith(map("N", nType.toString()), Arrays.asList(nType), context);
simplifier = new IntensionalSetFalseConditionToEmptySetSimplifier();
}
Aggregations