A MINSAT Approach for Learning in Logic Domains

DOI10.1287/ijoc.14.1.20.7709zbMath1238.68044OpenAlexW2068848220MaRDI QIDQ2884520

Giovanni Felici, Klaus Truemper

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9bbace90d19d124201b33c78998c2ad6bf55a963

zbMATH Keywords

supervised learninglogic programminginductive inferenceminimum-cost satisfiability problem

Mathematics Subject Classification ID

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

Related Items

Supervised classification and mathematical optimization ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ Operations research and data mining ⋮ Probability logic and optimization SAT: The PSAT and CPA models

Uses Software

• UCI-ml
• Leibniz

This page was built for publication: A MINSAT Approach for Learning in Logic Domains