Sciweavers

134 search results - page 23 / 27
» Meronymy Extraction Using An Automated Theorem Prover
Sort
View
ILP
2007
Springer
15 years 3 months ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
NFM
2011
209views Formal Methods» more  NFM 2011»
14 years 4 months ago
Formalizing Probabilistic Safety Claims
A safety claim for a system is a statement that the system, which is subject to hazardous conditions, satisfies a given set of properties. Following work by John Rushby and Bev Li...
Heber Herencia-Zapana, George Hagen, Anthony Narka...
SAT
2010
Springer
125views Hardware» more  SAT 2010»
15 years 1 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
TPHOL
2009
IEEE
15 years 4 months ago
Psi-calculi in Isabelle
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
Jesper Bengtson, Joachim Parrow
ECBS
2006
IEEE
119views Hardware» more  ECBS 2006»
15 years 3 months ago
A Model Transformation Approach for Design Pattern Evolutions
The evolution of a design pattern typically involves the addition or removal of a group of modeling elements, such as classes, attributes, operations, and relationships. However, ...
Jing Dong, Sheng Yang, Kang Zhang