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

DOI10.1007/978-3-642-33353-8_22zbMATH Open1361.68233OpenAlexW91551036MaRDI QIDQ2915079FDOQ2915079

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

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

zbMATH Keywords

integer linear programmingabductioncost-based abductioncutting plane inference

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Cutting-plane training of structural SVMs
• Markov logic networks
• 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
• An efficient LP-based admissible heuristic for cost-based abduction

Cited In (2)

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

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)