Solving disjunctive temporal problems with preferences using maximum satisfiability

DOI10.3233/AIC-2012-0527MaRDI QIDQ3164971zbMATH OpenOpenAlexFDO

Authors Marco Maratea, Luca Pulina

Publication date 25 October 2012

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-2012-0527

zbMATH Keywords

disjunctive temporal problemsoptimization

Mathematics Subject Classification ID

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

Recommendations

• Translation-based approaches for solving disjunctive temporal problems with preferences
• 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
• On Solving Soft Temporal Constraints Using SAT Techniques

Cited in

(7)

• Translation-based approaches for solving disjunctive temporal problems with preferences
• On Solving Soft Temporal Constraints Using SAT Techniques
• On restricted disjunctive temporal problems: faster algorithms and tractability frontier
• Solving satisfiability problems with preferences
• An interdisciplinary experimental evaluation on the disjunctive temporal problem
• On the modelling and optimization of preferences in constraint-based temporal reasoning
• Efficient solution techniques for disjunctive temporal reasoning problems

Describes a project that uses

Uses Software

• Yices
• MiniMaxSat

This page was built for publication: Solving disjunctive temporal problems with preferences using maximum satisfiability

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