Sciweavers

5624 search results - page 70 / 1125
» On Conditional Covering Problem
Sort
View
IJCAI
2007
15 years 7 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
ICST
2010
IEEE
15 years 4 months ago
(Un-)Covering Equivalent Mutants
—Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a test suite fails to detect a mutation, it may also fail to...
David Schuler, Andreas Zeller
CVPR
2010
IEEE
16 years 1 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
GG
2008
Springer
15 years 7 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
CORR
2004
Springer
88views Education» more  CORR 2004»
15 years 6 months ago
Sleeping Beauty Reconsidered: Conditioning and Reflection in Asynchronous Systems
A careful analysis of conditioning in the Sleeping Beauty problem is done, using the formal model for reasoning about knowledge and probability developed by Halpern and Tuttle. Wh...
Joseph Y. Halpern