2540 search results - page 149 / 508 » Abstract Logics as Dialgebras |
135
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. An extension of the superposition-based E-prover [8] is described. The extension allows terms with integer exponents [3] in the input language. Obviously, this possibilit...
186
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
144
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. We describe the instance store, a system for reasoning about individuals (i.e., instances of classes) in OWL ontologies. By using a hybrid reasoner/database architecture,...
143
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
151
click to vote
MLDM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data an...