Sciweavers

128 search results - page 12 / 26
» Class Algebra for Ontology Reasoning
Sort
View
JAR
1998
134views more  JAR 1998»
13 years 7 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
DASFAA
2007
IEEE
156views Database» more  DASFAA 2007»
13 years 11 months ago
An Efficient and Scalable Management of Ontology
Abstract. OWL is a recommended language for publishing and sharing ontologies on the Semantic Web. To manage the ontologies, several OWL data management systems have been proposed....
Myung-Jae Park, Jihyun Lee, Chun-Hee Lee, Jiexi Li...
CSL
2005
Springer
14 years 1 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
AIIA
2001
Springer
14 years 6 days ago
Characterising Concept's Properties in Ontologies
Abstract. This paper presents and motivates an extended ontology conceptual model which represents explicitly semantic information about concepts. This model results from explicitl...
Valentina A. M. Tamma, Trevor J. M. Bench-Capon
LICS
2007
IEEE
14 years 1 months ago
Tractability and learnability arising from algebras with few subpowers
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...