Sciweavers

1426 search results - page 50 / 286
» Specification of nonmonotonic reasoning
Sort
View
APPROX
2005
Springer
80views Algorithms» more  APPROX 2005»
15 years 3 months ago
On Learning Random DNF Formulas Under the Uniform Distribution
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
Jeffrey C. Jackson, Rocco A. Servedio
NMR
2004
Springer
15 years 3 months ago
A plausible logic which detects loops
Unlike most non-monotonic logics Plausible Logic was designed from the very beginning with computer implementation in mind. But one aspect of implementation was neglected, namely ...
David Billington
NMR
2004
Springer
15 years 3 months ago
A resource bounded default logic
This paper presents statistical default logic, an expansion of classical (i.e., Reiter) default logic that allows us to model common inference patterns found in standard inferenti...
Gregory R. Wheeler
IPPS
2000
IEEE
15 years 2 months ago
The Parallelization of a Knowledge Discovery System with Hypergraph Representation
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDEDpronounced indee...
Jennifer Seitzer, James P. Buckley, Yi Pan, Lee A....
AIIA
1997
Springer
15 years 1 months ago
Introducing Abduction into (Extensional) Inductive Logic Programming Systems
We propose an approach for the integration of abduction and induction in Logic Programming. In particular, we show how it is possible to learn an abductive logic program starting f...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...