The computational complexity of abduction
Artificial Intelligence - Special issue on knowledge representation
Temporal reasoning with abductive event calculus
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Executing suspended logic programs
Fundamenta Informaticae - Special issue on foundations of constraint programming
Integrity Checking in Deductive Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Selected Papers from Constraint Programming: Basics and Trends
Integration of Abductive Reasoning and Constraint Optimization in SCIFF
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
HYPROLOG: a new logic programming language with assumptions and abduction
ICLP'05 Proceedings of the 21st international conference on Logic Programming
| Hi-index | 0.00 |
Our query planning application for system integration requires a backward partial-order planner able to deal with non-ground plans in the presence of state constraints. While many partial-order planners exist for the case of independent fluents, partial-order planning with dependent fluents is a significantly more complex problem, which we tackle in an abductive event calculus framework. We show that existing abductive procedures have nonminimality problems that are significant especially in our planning domain and propose an improved abductive procedure to alleviate these problems. We also describe a general transformation from an abductive framework to Constraint Handling Rules (CHRs), which can be used to obtain an efficient implementation.