Sciweavers

3446 search results - page 80 / 690
» A Reasoning Algorithm for pD*
Sort
View
DLOG
2011
14 years 5 months ago
Correcting Access Restrictions to a Consequence More Flexibly
Recent research has shown that labeling ontologies can be useful for restricting the access to some of the axioms and their implicit consequences. However, the labeling of the axio...
Eldora, Martin Knechtel, Rafael Peñaloza
DLOG
2011
14 years 5 months ago
A Technique for Handling the Right Hand Side of Complex RIAs
This paper examines a new technique based on tableau, that allows one to introduce composition of roles from the right hand side of complex role inclusion axioms (RIAs). Our motiva...
Milenko Mosurovic, Nenad Krdzavac
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 1 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
CSL
2010
Springer
15 years 2 months ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
ICALP
2004
Springer
15 years 6 months ago
A Faster Algorithm for Minimum Cycle Basis of Graphs
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...