Sciweavers

1058 search results - page 4 / 212
» It's Doomed; We Can Prove It
Sort
View
TC
2010
13 years 7 months ago
Formal Reliability Analysis Using Theorem Proving
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
Osman Hasan, Sofiène Tahar, Naeem Abbasi
XIMEP
2005
ACM
90views Database» more  XIMEP 2005»
14 years 2 months ago
XPath 2.0: It Can Sort!
As XML finds its place in information technology, query languages for XML attract much attention. Among them XPath is the most known. This article reveals a surprising fact that ...
Pavel Hlousek
ADG
2004
Springer
147views Mathematics» more  ADG 2004»
14 years 1 months ago
Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness
Construction of geometrical objects by origami, the Japanese traditional art of paper folding, is enjoyable and intriguing. It attracted the minds of artists, mathematicians and co...
Judit Robu, Tetsuo Ida, Dorin Tepeneu, Hidekazu Ta...
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 8 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
IANDC
2008
122views more  IANDC 2008»
13 years 8 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza