Sciweavers

1578 search results - page 203 / 316
» Induction of Stable Models
Sort
View
TLCA
2005
Springer
14 years 4 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
TPHOL
1998
IEEE
14 years 3 months ago
The Village Telephone System: A Case Study in Formal Software Engineering
In this paper we illustrate the use of formal methods in the development of a benchmark application we call the Village Telephone System which is characteristic of a class of netwo...
Karthikeyan Bhargavan, Carl A. Gunter, Elsa L. Gun...
CINQ
2004
Springer
151views Database» more  CINQ 2004»
14 years 2 months ago
Query Languages Supporting Descriptive Rule Mining: A Comparative Study
Recently, inductive databases (IDBs) have been proposed to tackle the problem of knowledge discovery from huge databases. With an IDB, the user/analyst performs a set of very diffe...
Marco Botta, Jean-François Boulicaut, Cyril...
CIA
2006
Springer
14 years 2 months ago
Market-Inspired Approach to Collaborative Learning
The paper describes a decentralized peer-to-peer multi-agent learning method based on inductive logic programming and knowledge trading. The method uses first-order logic for model...
Jan Tozicka, Michal Jakob, Michal Pechoucek
KDD
1995
ACM
108views Data Mining» more  KDD 1995»
14 years 2 months ago
A Statistical Perspective On Knowledge Discovery In Databases
The quest to nd models usefully characterizing data is a process central to the scienti c method, and has been carried out on many fronts. Researchers from an expanding number of ...
John F. Elder IV, Daryl Pregibon