Induction of stable models

DOI10.1007/3-540-44797-0_16MaRDI QIDQ4796703zbMATH OpenFDO

Authors Ramón P. Otero

Publication date 3 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44797-0_16

Mathematics Subject Classification ID

Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Induction from answer sets in nonmonotonic logic programs
• Stable inference as intuitionistic validity
• R-stable models for logic programs
• psmodels: Stable models based on pertinence
• Thirteen Definitions of a Stable Model

Cited in

(18)

• Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
• The complexity and generality of learning answer set programs
• Brave induction: a logical framework for learning from incomplete information
• Inductive general game playing
• Inductive learning of answer set programs
• Brave Induction
• Thirteen Definitions of a Stable Model
• Learning Stochastic Logical Automaton
• Short note preferred extensions are partial stable models
• Inductive equivalence in clausal logic and nonmonotonic logic programming
• Stable models are generated by a stable chain
• Exploiting answer set programming with external sources for meta-interpretive learning
• Learning weak constraints in answer set programming
• scientific article; zbMATH DE number 800808 (Why is no real title available?)
• Induction from answer sets in nonmonotonic logic programs
• Logic-based learning of answer set programs
• Incremental learning of event definitions with inductive logic programming
• Nonmonotonic abductive inductive learning

This page was built for publication: Induction of stable models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796703)