Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

107

ILP
2001
Springer

favoriteEmaildiscussreport

143views Automated Reasoning» more ILP 2001»

Induction of Stable Models

15 years 3 months ago

Induction of Stable Models

Download www.dc.fi.udc.es

In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models semantics. A logic program in this non-monotonic semantics can be contradictory or can have one or several models. We provide a complete characterization on the hypotheses solution to induction of this kind of programs.

Ramón P. Otero

Real-time Traffic

Automated Reasoning | ILP 2001 | Inductive Logic Programming | Logic Program | Normal Logic Programs |

claim paper

Related Content

» Stable and compact inductance modeling of 3D interconnect structures

» Compact and stable modeling of partial inductance and reluctance matrices

» SPIE Sparse Partial Inductance Extraction

» Evolutionary Stability for Large Populations and Backward Induction

» Onchip interconnect modeling by wire duplication

» Controlled Flux Results in Stable Decision Trees

» Partial drift detection using a rule induction framework

» Efficient inductance extraction using circuitaware techniques

» A Perspective on Inductive Databases

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	ILP
Authors	Ramón P. Otero

Comments (0)