Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference

DOI10.1007/978-3-642-33353-8_22zbMath1361.68233OpenAlexW91551036MaRDI QIDQ2915079

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

Uses Software

• WordNet

Cites Work

• Unnamed Item
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• The computational complexity of abduction
• A linear constraint satisfaction approach to cost-based abduction
• Cutting-plane training of structural SVMs
• Markov logic networks
• An efficient LP-based admissible heuristic for cost-based abduction

This page was built for publication: Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference