129 search results - page 17 / 26 » Benchmarking Reasoners for Multi-Ontology Applications |
C3S2E
2010
ACM
13 years 8 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
JAR
2007
13 years 7 months ago
2007
Abstract. In this paper we study the diagnosis and repair of incoherent terminologies. We define a number of new non-standard reasoning services to explain incoherence through pin...
PPPJ
2009
ACM
14 years 6 days ago
2009
ACM
Reuse distance analysis has been proved promising in evaluating and predicting data locality for programs written in Fortran or C/C++. But its effect has not been examined for ap...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
CCGRID
2002
IEEE
14 years 15 days ago
2002
IEEE
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...