SlideShare is now on Android. 15 million presentations at your fingertips.  Get the app

×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

A sat encoding for solving games with energy objectives

by on Dec 30, 2013

  • 244 views

Recently, a reduction from the problem of solving parity games to the satisfiability problem in ...

Recently, a reduction from the problem of solving parity games to the satisfiability problem in
propositional logic (SAT) have been proposed in [5], motivated by the success of SAT solvers in
symbolic verification. With analogous motivations, we show how to exploit the notion of energy
progress measure to devise a reduction from the problem of energy games to the satisfiability
problem for formulas of propositional logic in conjunctive normal form.

Statistics

Views

Total Views
244
Views on SlideShare
244
Embed Views
0

Actions

Likes
0
Downloads
0
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

A sat encoding for solving games with energy objectives A sat encoding for solving games with energy objectives Document Transcript