Translation-based approaches for solving disjunctive temporal problems with preferences

DOI10.1007/s10601-018-9293-6zbMath1468.68201OpenAlexW2810548610MaRDI QIDQ2331097

Luca Pulina, Enrico Giunchiglia, Marco Maratea

Publication date: 25 October 2019

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11567/934437

zbMATH Keywords

preferencesdisjunctive temporal problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Yices
• MathSAT5
• OptiMathSAT

Cites Work

• AI*IA 2013: Advances in artificial intelligence. XIIIth international conference of the Italian Association for Artificial Intelligence, Turin, Italy, December 4--6, 2013. Proceedings
• On the modelling and optimization of preferences in constraint-based temporal reasoning
• Efficient solution techniques for disjunctive temporal reasoning problems
• Temporal constraint networks
• Backtracking algorithms for disjunctions of temporal constraints
• Solving disjunctive temporal problems with preferences using maximum satisfiability
• On Solving Soft Temporal Constraints Using SAT Techniques
• The MathSAT5 SMT Solver
• Mechanizing Mathematical Reasoning