semantic_case


INSTANCE semantic_case#1;
	description = "A case for assessing the semantic equivalence of two choice_sets";
	problem = choice_set#6;
	solution = semantic_match_prescription#1;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-choice_set.filc";
END_INSTANCE;

INSTANCE semantic_case#2;
	description = "A case for assessing the semantic equivalence of two comparators";
	problem = comparator#6;
	solution = semantic_match_prescription#2;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-comparator-positive.filc";
END_INSTANCE;

INSTANCE semantic_case#3;
	description = "A case for assessing the semantic equivalence of two comparators";
	problem = comparator#7;
	solution = semantic_match_prescription#3;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-comparator-negative.filc";
END_INSTANCE;

INSTANCE semantic_case#4;
	description = "A case for assessing the semantic equivalence of two conjunctions";
	problem = conjunction#4;
	solution = semantic_match_prescription#4;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-conjunction.filc";
END_INSTANCE;

INSTANCE semantic_case#5;
	description = "A case for assessing the semantic equivalence of two disjunctions";
	problem = inclusive_disjunction#1;
	solution = semantic_match_prescription#5;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-disjunction.filc";
END_INSTANCE;

INSTANCE semantic_case#6;
	description = "A case for assessing the semantic equivalence of two list types";
	problem = list_type#21;
	solution = semantic_match_prescription#6;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-list-lower.filc";
END_INSTANCE;

INSTANCE semantic_case#7;
	description = "A case for assessing the semantic equivalence of two list types";
	problem = list_type#22;
	solution = semantic_match_prescription#7;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-list-upper.filc";
END_INSTANCE;

INSTANCE semantic_case#8;
	description = "A case for assessing the sem.eq. of two unordered aggregation types";
	problem = unordered_aggregation_type#1;
	solution = semantic_match_prescription#8;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-uagg-lower.filc";
END_INSTANCE;

INSTANCE semantic_case#9;
	description = "A case for assessing the sem.eq. of two unordered aggregation types";
	problem = unordered_aggregation_type#2;
	solution = semantic_match_prescription#9;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-uagg-upper.filc";
END_INSTANCE;

INSTANCE semantic_case#10;
	description = "A case for assessing the semantic equivalence of two UNIQUE rules";
	problem = unique_rule#1;
	solution = semantic_match_prescription#10;
	language = express;
	filename = "CASES/EXPRESS/SEMANTIC/semantic-unique.filc";
END_INSTANCE;