Sciweavers

851 search results - page 59 / 171
» Inaccessibility in Decision Procedures
Sort
View
CADE
1990
Springer
14 years 29 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 15 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 10 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
APLAS
2010
ACM
13 years 9 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...