TestingClauseTheories
An object containing a collection of notable databases to be used when testing Solver functionality.
Alongside PrologStandardExampleTheories (the manual's own worked examples), this gathers hand-written theories exercising cut, conjunction, backtracking, recursion/non-termination and custom list predicates, each paired with its expected goal-to-Solutions mapping; both are consumed by TestSolver via allPrologTestingTheoriesToRespectiveGoalsAndSolutions.
Author
Enrico
Properties
a(A) :- b(A), d(Z). b(B) :- c(B), d(W). d(_). c(1).
A database that implements custom "range" to generate lists; it should test backtracking functionality along with arithmetic
Notable customRangeListGeneratorTheory request goals and respective expected Solutions
A database that implements custom "reverse" over lists; it should test backtracking functionality
Notable customReverseListTheory request goals and respective expected Solutions
A database containing the following rules:
Notable cutConjunctionAndBacktrackingTheory request goals and respective expected Solutions
Halt primitive request goals and respective expected Solutions
A database containing the following rules:
Notable infiniteComputationTheory request goals and respective expected Solutions
A database containing the following rules:
Notable simpleCutAndConjunctionTheory request goals and respective expected Solutions
A database containing the following rules:
Notable simpleCutTheory request goals and respective expected Solutions
A database containing the following facts:
Notable simpleFactTheory request goals and respective expected Solutions
Functions
Collection of all Prolog example (custom created and from Prolog Standard) databases and their respective callable goals with expected solutions