Tabling Optimization for Contextual Abduction
Tabling for contextual abduction in logic programming has been introduced as a means to store previously obtained abductive solutions in one context to be reused in another context. This paper identifies a number of issues in the existing implementations of tabling in contextual abduction and aims to mitigate the issues. We propose a new program transformation for integrity constraints to deal with their proper application for filtering solutions while also reducing the table memory usage. We further optimize the table memory usage by selectively picking predicates to table and by pragmatically simplifying the representation of the problem. The evaluation of our proposed approach, on both artificial and real world problems, shows that they improve the scalability of tabled abduction compared to previous implementations.
Code (1)
Similar Papers 제목 키워드 기반
Joint Tabling of Logic Program Abductions and Updates
Abductive logic programs offer a formalism to declaratively represent and reason about problems in a variety of areas: diagnosis, decision making, hypothetical reasoning, etc. On the other hand, logic program updates all…
Decision MakingGreedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem
Timetabling is a problem faced in all higher education institutions. The International Timetabling Competition (ITC) has published a dataset that can be used to test the quality of methods used to solve this problem. A n…
Incorporating Machine Learning to Evaluate Solutions to the University Course Timetabling Problem
Evaluating solutions to optimization problems is arguably the most important step for heuristic algorithms, as it is used to guide the algorithms towards the optimal solution in the solution search space. Research has sh…
BIG-bench Machine LearningregressionEnhancing Genetic Algorithms with Graph Neural Networks: A Timetabling Case Study
This paper investigates the impact of hybridizing a multi-modal Genetic Algorithm with a Graph Neural Network for timetabling optimization. The Graph Neural Network is designed to encapsulate general domain knowledge to …
Graph Neural NetworkRobustness Approaches for the Examination Timetabling Problem under Data Uncertainty
In the literature the examination timetabling problem (ETTP) is often considered a post-enrollment problem (PE-ETTP). In the real world, universities often schedule their exams before students register using information …