blob: aaf14ebb4af896eb945a03e65c2e12f04b73f601 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
package hu.bme.mit.inf.dslreasoner.logic.model.builder
import hu.bme.mit.inf.dslreasoner.logic.model.logicproblem.LogicProblem
import hu.bme.mit.inf.dslreasoner.logic.model.logicresult.LogicResult
import hu.bme.mit.inf.dslreasoner.logic.model.logicresult.ModelResult
import hu.bme.mit.inf.dslreasoner.workspace.ReasonerWorkspace
import java.util.List
import java.util.TreeSet
import java.util.SortedSet
import java.math.BigDecimal
abstract class LogicReasoner {
def abstract LogicResult solve(LogicProblem problem, LogicSolverConfiguration configuration,
ReasonerWorkspace workspace) throws LogicReasonerException
def abstract List<? extends LogicModelInterpretation> getInterpretations(ModelResult modelResult)
}
public class LogicReasonerException extends Exception {
new(String message, Exception cause) {
super(message, cause)
}
new(Exception cause) {
super("The reasoner has failed", cause)
}
new(String message) {
super(message)
}
}
abstract class LogicSolverConfiguration {
public static val Unlimited = -1;
public static val String UndefinedPath = null
/** The URI string to the independent solver application */
public String solverPath = UndefinedPath
/** Max runtime limit in seconds. */
public int runtimeLimit = Unlimited
/** Max runtime limit in seconds. */
public int memoryLimit = Unlimited
public var TypeScopes typeScopes = new TypeScopes;
public var SolutionScope solutionScope = new SolutionScope
}
/**
* Defines the the size of the generated models. Constant <code>Unlimited</code> defines no upper limit to the type.
*/
public class TypeScopes {
public static val Unlimited = -1;
public var SortedSet<Integer> knownIntegers = new TreeSet
/**
* Sets the number of Integers that has to be used to solve the problem.
*/
public var maxNewIntegers = Unlimited
public var SortedSet<BigDecimal> knownReals = new TreeSet
/**
* Sets the number of Reals that has to be used to solve the problem.
*/
public var maxNewReals = Unlimited
public var SortedSet<String> knownStrings = new TreeSet
/**
* Sets the number of Strings that has to be used to solve the problem.
*/
public var maxNewStrings = Unlimited
/**
* Defines the minimal number of newly added elements. Default value is 0.
*/
public var minNewElements = 0
/**
* Defines the maximal number of newly added elements. Default value is <code>TypeScopes.Unlimited</code>.
*/
public var maxNewElements = Unlimited
}
/**
* Defines the required number of solutions for the problem.
* Constant <code>All</code> defines that all solution for the problem is requested.
*/
public class SolutionScope {
public static val All = -1;
public var numberOfRequiredSolution = 1
}
|
