Sciweavers

5595 search results - page 4 / 1119
» Comparing Subsumption Optimizations
Sort
View
CADE
2009
Springer
14 years 5 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
DLOG
2011
12 years 8 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan
IJACTAICIT
2010
151views more  IJACTAICIT 2010»
13 years 2 days ago
The Comparative Study of Software Optimal Release Time Based on Burr Distribution
It is great practical interest to decide when to stop testing a software system in development phase and transfer it to the user. This problem is called as the optimal software re...
Hee-Cheul Kim, Hyoung-Keun Park
COLING
2010
13 years 7 days ago
Automatic analysis of semantic similarity in comparable text through syntactic tree matching
We propose to analyse semantic similarity in comparable text by matching syntactic trees and labeling the alignments according to one of five semantic similarity relations. We pre...
Erwin Marsi, Emiel Krahmer
DLOG
2010
13 years 3 months ago
The Logical Difference For Fuzzy EL+ Ontologies
Abstract. Ontologies undergo changes for reasons such as changes in knowledge, meeting varying application requirements. Thus, for different versions of a considered ontology, it i...
Shasha Feng, Yonggang Zhang, Dantong Ouyang, Haiya...