Large-scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference

DOI10.1007/978-3-642-33353-8_22MaRDI QIDQ2915079zbMATH OpenOpenAlexFDO

Authors Naoya Inoue, Kentaro Inui

Publication date 21 September 2012

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33353-8_22

zbMATH Keywords

integer linear programmingabductioncost-based abductioncutting plane inference

Mathematics Subject Classification ID

Integer programming (90C10) Logic in artificial intelligence (68T27)

Recommendations

• A linear constraint satisfaction approach to cost-based abduction
• scientific article; zbMATH DE number 512816
• scientific article; zbMATH DE number 500950
• Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction
• Towards automated first-order abduction: the cut-based approach

Cites work

• scientific article; zbMATH DE number 1175490 (Why is no real title available?)
• A linear constraint satisfaction approach to cost-based abduction
• An efficient LP-based admissible heuristic for cost-based abduction
• Cutting-plane training of structural SVMs
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• Markov logic networks
• The computational complexity of abduction

Cited in

(2)

• Polynomial solvability of cost-based abduction
• Modeling variations of first-order Horn abduction in answer set programming

Describes a project that uses

Uses Software

• WordNet

This page was built for publication: Large-scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference

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