Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction

DOI10.1080/09528139308953777MaRDI QIDQ4286534zbMATH OpenOpenAlexFDO

Authors Eugene jun. Santos

Publication date 27 March 1994

Published in Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09528139308953777

zbMATH Keywords

abductive reasoningautomated reasoningconstraint satisfactioncost-based abductionexplanation

Mathematics Subject Classification ID

Recommendations

• A linear constraint satisfaction approach to cost-based abduction
• Polynomial solvability of cost-based abduction
• Modeling of constraints in problems of possibilistic linear programming
• On Computing Constraint Abduction Answers
• scientific article; zbMATH DE number 2080319
• Abstraction in constraint optimization problems
• scientific article; zbMATH DE number 1254026
• On the Minimisation of Acyclic Models

Cited in

(9)

• A linear constraint satisfaction approach to cost-based abduction
• Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
• Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction
• Polynomial solvability of cost-based abduction
• Large-scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference
• scientific article; zbMATH DE number 1254026 (Why is no real title available?)
• A framework for building knowledge-bases under uncertainty
• scientific article; zbMATH DE number 1929157 (Why is no real title available?)
• An efficient LP-based admissible heuristic for cost-based abduction

This page was built for publication: Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction

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