Sciweavers

844 search results - page 62 / 169
» Safraless Decision Procedures
Sort
View
ICDT
2003
ACM
127views Database» more  ICDT 2003»
14 years 1 months ago
On Reasoning about Structural Equality in XML: A Description Logic Approach
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
David Toman, Grant E. Weddell
CADE
1990
Springer
14 years 24 days ago
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
Robert S. Boyer, J. Strother Moore
LICS
2000
IEEE
14 years 10 days ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao
FLAIRS
2007
13 years 11 months ago
System Diagnosability Analysis Using p-slop MAP
Researchers have reported successful deployments of diagnosis decision support systems based on Bayesian networks. However, the methodology for evaluating the diagnosability for s...
Tsai-Ching Lu, K. Wojtek Przytula
ICML
2010
IEEE
13 years 9 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos