Translation-based approaches for solving disjunctive temporal problems with preferences

DOI10.1007/S10601-018-9293-6MaRDI QIDQ2331097zbMATH OpenOpenAlexFDO

Authors Enrico Giunchiglia, Marco Maratea, Luca Pulina

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

disjunctive temporal problemspreferences

Mathematics Subject Classification ID

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

Recommendations

• Solving disjunctive temporal problems with preferences using maximum satisfiability
• On the modelling and optimization of preferences in constraint-based temporal reasoning
• Efficient solution techniques for disjunctive temporal reasoning problems
• An interdisciplinary experimental evaluation on the disjunctive temporal problem
• Discrete temporal constraint satisfaction problems
• A translational approach to constraint answer set solving
• Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
• Temporal reasoning with layered preferences
• On restricted disjunctive temporal problems: faster algorithms and tractability frontier

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
• Backtracking algorithms for disjunctions of temporal constraints
• Efficient solution techniques for disjunctive temporal reasoning problems
• Mechanizing Mathematical Reasoning
• On Solving Soft Temporal Constraints Using SAT Techniques
• On the modelling and optimization of preferences in constraint-based temporal reasoning
• Solving disjunctive temporal problems with preferences using maximum satisfiability
• Temporal constraint networks
• The MathSAT5 SMT solver

Cited in

(4)

• Solving disjunctive temporal problems with preferences using maximum satisfiability
• On Solving Soft Temporal Constraints Using SAT Techniques
• On restricted disjunctive temporal problems: faster algorithms and tractability frontier
• On the modelling and optimization of preferences in constraint-based temporal reasoning

Describes a project that uses

Uses Software

• OptiMathSAT
• Yices
• MathSAT5

This page was built for publication: Translation-based approaches for solving disjunctive temporal problems with preferences

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