Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition (Q1621888): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10994-018-5708-2 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1707.02729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsatisfiability-based optimization in clasp / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based MaxSAT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Through Hypothesis Refinement Using Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge Representation, Reasoning and Declarative Problem Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/jmlr.2003.3.4-5.993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4423202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normative design using inductive learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: INDUCTIVE LOGIC PROGRAMMING AS ABDUCTIVE SEARCH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational learning with statistical predicate invention: Better models for hypertext / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured machine learning: the next ten years / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics and complexity of recursive aggregates in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-driven answer set solving: from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abductive Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental learning of event definitions with inductive logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Learning of Answer Set Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning weak constraints in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Learning of Answer Set Programs from Context Dependent Examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Logic Programming: Theory and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: ILP turns 20. Biography and future challenges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-interpretive learning: application to grammatical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic abductive inductive learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brave induction: a logical framework for learning from incomplete information / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10994-018-5708-2 / rank
 
Normal rank

Latest revision as of 23:13, 10 December 2024

scientific article
Language Label Description Also known as
English
Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
scientific article

    Statements

    Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition (English)
    0 references
    0 references
    0 references
    12 November 2018
    0 references
    inductive logic programming
    0 references
    answer set programming
    0 references
    hypothesis generation
    0 references
    rule complexity
    0 references
    best-effort
    0 references
    0 references
    0 references

    Identifiers