Solving Vehicle Equipment Specification Problems with Answer Set Programming
summary
System named aspcafe converts OVF instances into ASP facts and solves mono- and multi-objective CAFE problems using clingo and asprin. Basic encoding models variability and fuel‑economy constraints compactly; optimized encoding prunes grounding by computing per‑type min/max IWR bounds, dramatically shrinking grounded domains. Experiments use three real instances (small, medium, big), five CAFE thresholds, 3‑hour limits; optimized encoding yields much tighter bounds across all cases, extended encoding finds Pareto fronts for small instances but has difficulty on medium/big.
AI-written summary · about
chapters (14)
- 0:00Intro
- 0:52Vehicle Equipment Specification
- 2:55Input: a CAFE problem instance
- 4:36Input: the number of vehicle models (») and two curves
- 7:22Answer Set Programming (ASP)
- 10:49ASP fact format of a CAFE instance
- 11:36Basic encoding: variability constraints
- 12:33Basic encoding: fuel economy constraints
- 13:42The problem issue of basic encoding
- 16:35Comparison of Basic and Optimized encodings
- 18:47Extended Encoding: objective functions
- 20:51Benchmark results of finding Pareto optimal solutions
- 22:05Conclusion
- 26:32Experiments: Mono-objective CAFE problems
related talks
23mFrom SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Se...
39mSolving the vehicle routing problem for optimizing shipment delivery
41mIntroduction to Constraint Programming
25mSmart Devices and Large Scale Reasoning via ASP: Tools and Applications
41mOptimizing Relational Programs I
01h 24mIntroduction to Constraint Logic Programming
45mProblem Solved! Using Logic Programming to Find Answers
36mApplied Software Engineering Case Diary: Field Lessons in Problem Solving