Login / Signup

Solving disjunctive temporal problems with preferences using maximum satisfiability.

Marco MarateaLuca Pulina
Published in: AI Commun. (2012)
Keyphrases
  • disjunctive temporal
  • maximum satisfiability
  • upper bound
  • optimization problems
  • np complete
  • temporal information
  • graph coloring