SlideShare una empresa de Scribd logo
1 de 8
Descargar para leer sin conexión
A SAT ENCODING FOR SOLVING GAMES
WITH ENERGY OBJECTIVES
Raffaella Gentilini
Dip. di Matematica e Informatica, Universit`a di Perugia,
Via Vanvitelli 1, Perugia (IT)

ABSTRACT
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.

1. INTRODUCTION
Energy games (EG) are two-players games played on weighted graphs, where the integer weight
associated to each edge represents the corresponding energy gain/loss. The arenas of energy
games are endowed of two types of vertices: in player 0 (resp. player 1) vertices, player 0 (resp.
player 1) chooses the successor vertex from the set of outgoing edges and the game results in an
infinite path through the graph. Given an initial credit of energy c, the objective of player 0 is to
maintain the sum of the weights (the energy level) positive. The decision problem for EG asks,
given a weighted game graph with initial vertex v 0, if there exists an initial credit for which
player 0 wins from v 0.
Energy games have been introduced in [3, 2] to model the synthesis problem within the design of
reactive systems that work in resource-constrained environments. Beside their applicability to the
modeling of quantitative problems for computer aided design, EG have tight connections with
important problems in game theory and logic. For instance, they are log-space equivalent to
mean-payoff games (MPG) [2], another kind of quantitative two-player game very well studied
both in economics and in computer science. The latter are characterized by a theoretically
engaging complexity status, being one of the few inhabitants of the complexity class NP∩coNP
(for which the inclusion in P is still an open problem). Moreover, parity games [4, 6]—
notoriously known as poly-time equivalent to the model-checking problem for the modal mucalculus—are in turn poly-time reducible to MPG and EG. It is a long-standing open question to
know whether the model-checking problem for the modal mu-calculus is in P.
The algorithm with the currently best (pseudopolynomial) complexity for solving EG (and MPG
via log-space reduction) is based on the so-called notion of energy progress measure [7].
David C. Wyld et al. (Eds) : CST, ITCS, JSE, SIP, ARIA, DMS - 2014
pp. 45–52, 2014. © CS & IT-CSCP 2014

DOI : 10.5121/csit.2014.4105
46

Computer Science & Information Technology (CS & IT)

Progress measures for weighted graphs are functions that impose local conditions to ensure global
properties of the graph. A notion of parity progress measure [6] was previously exploited in [6]
for the algorithmic analysis of parity games and reconsidered in [5] to devise a SAT encoding of
the corresponding games, motivated by the considerable success that using SAT solvers has had
in symbolic verification. As a matter of fact, clever heuristics implemented in nowadays SAT
solvers can result in algorithms that are very efficient in practice. Furthermore, there are
fragments of SAT that can be solved in polynomial time. Hence, the reduction in [5] opens up a
new possibility for showing inclusion of parity games in P.
Motivated by analogous reasons, in this paper 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. Tight upper bounds on
the sizes of our reductions are also reported.
The paper is organized as follows.We recall the notions of energy games and energy progress
measure in Section 2. Section 3 and Section 4 develop the reductions from energy games to
difference logic and pure SAT, respectively, reporting tight bounds on the sizes of the
corresponding reductions.

2. PRELIMINARIES
Computer Science & Information Technology (CS & IT)

47
48

Computer Science & Information Technology (CS & IT)

2.1 Difference Logic

3. ENCODING EG WINNING STRATEGIES IN DIFFERENCE LOGIC
Computer Science & Information Technology (CS & IT)

49
50

Computer Science & Information Technology (CS & IT)

4. SOLVING ENERGY GAMES BY A REDUCTION TO SAT
Computer Science & Information Technology (CS & IT)

51

5. CONCLUSIONS
We devise efficient encodings of the energy games problem into the satisfiability problem for
formulas of difference logic and pure propositional logic in conjunctive normal form. Tight upper
bounds on the sizes of the given reductions are also reported. Due to the success of nowadays
SAT solvers in symbolic verification, the proposed encodings could result in algorithms that are
very efficient in practice. Furthermore, they could open up new possibilities for devising tight
bounds on the complexity of the energy games problem, as there are fragments of SAT that can
be solved in polynomial time.
52

Computer Science & Information Technology (CS & IT)

REFERENCES
[1]
[2]

[3]
[4]
[5]
[6]
[7]
[8]

A. Ehrenfeucht and J. Mycielski. International journal of game theory. Positional Strategies for
Mean-Payoff Games, 8:109–113, 1979.
P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite runs in weighted timed
automata with energy constraints. In Proc. of FORMATS: Formal Modeling and Analysis of Timed
Systems, LNCS 5215, pages 33–47. Springer, 2008.
A. Chakrabarti, L. de Alfaro, T. A. Henzinger, and M. Stoelinga. Resource interfaces. In Proc. of
EMSOFT: Embedded Software, LNCS 2855, pages 117–133. Springer, 2003.
Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. of STOC: Symposium on
Theory of Computing, pages 60–65. ACM, 1982.
Keijo Heljanko, Misa Kein¨anen, Martin Lange, and Ilkka Niemel¨a. Solving parity games by a
reduction to sat. J. Comput. Syst. Sci., 78(2):430–440, March 2012.
M. Jurdzinski. Small progress measures for solving parity games. In Proceedings of STACS:
Theoretical Aspects of Computer Science, LNCS 1770, pages 290–301. Springer, 2000.
L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, and J-F. Raskin. Faster algorithms for mean payoff
games. Formal Methods in System Design, 38(2):97–118, 2011.
Moez Mahfoudh, Peter Niebert, Eugene Asarin, and Oded Maler. A satisfiability checker for
difference logic. In 5-th Int. Symp. on the Theory and Applications of Satisfliability Testing, 2002.

Más contenido relacionado

La actualidad más candente

IRJET- Optimization of 1-Bit ALU using Ternary Logic
IRJET- Optimization of 1-Bit ALU using Ternary LogicIRJET- Optimization of 1-Bit ALU using Ternary Logic
IRJET- Optimization of 1-Bit ALU using Ternary LogicIRJET Journal
 
Some fixed point results for cone metric space
Some fixed point results for cone metric spaceSome fixed point results for cone metric space
Some fixed point results for cone metric spaceAlexander Decker
 
A Preference Model on Adaptive Affinity Propagation
A Preference Model on Adaptive Affinity PropagationA Preference Model on Adaptive Affinity Propagation
A Preference Model on Adaptive Affinity PropagationIJECEIAES
 
FUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONS
FUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONSFUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONS
FUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONSijcsity
 
A0311010106
A0311010106A0311010106
A0311010106theijes
 
Combinatorial optimization CO-4
Combinatorial optimization CO-4Combinatorial optimization CO-4
Combinatorial optimization CO-4man003
 
Dimensionality reduction by matrix factorization using concept lattice in dat...
Dimensionality reduction by matrix factorization using concept lattice in dat...Dimensionality reduction by matrix factorization using concept lattice in dat...
Dimensionality reduction by matrix factorization using concept lattice in dat...eSAT Journals
 
An Approach to Mathematically Establish the Practical Use of Assignment Probl...
An Approach to Mathematically Establish the Practical Use of Assignment Probl...An Approach to Mathematically Establish the Practical Use of Assignment Probl...
An Approach to Mathematically Establish the Practical Use of Assignment Probl...ijtsrd
 
Fault diagnosis using genetic algorithms and
Fault diagnosis using genetic algorithms andFault diagnosis using genetic algorithms and
Fault diagnosis using genetic algorithms andeSAT Publishing House
 
Reproducibility and differential analysis with selfish
Reproducibility and differential analysis with selfishReproducibility and differential analysis with selfish
Reproducibility and differential analysis with selfishtuxette
 
Dynamic approach to k means clustering algorithm-2
Dynamic approach to k means clustering algorithm-2Dynamic approach to k means clustering algorithm-2
Dynamic approach to k means clustering algorithm-2IAEME Publication
 
Paper introduction to Combinatorial Optimization on Graphs of Bounded Treewidth
Paper introduction to Combinatorial Optimization on Graphs of Bounded TreewidthPaper introduction to Combinatorial Optimization on Graphs of Bounded Treewidth
Paper introduction to Combinatorial Optimization on Graphs of Bounded TreewidthYu Liu
 

La actualidad más candente (18)

IRJET- Optimization of 1-Bit ALU using Ternary Logic
IRJET- Optimization of 1-Bit ALU using Ternary LogicIRJET- Optimization of 1-Bit ALU using Ternary Logic
IRJET- Optimization of 1-Bit ALU using Ternary Logic
 
Some fixed point results for cone metric space
Some fixed point results for cone metric spaceSome fixed point results for cone metric space
Some fixed point results for cone metric space
 
A Preference Model on Adaptive Affinity Propagation
A Preference Model on Adaptive Affinity PropagationA Preference Model on Adaptive Affinity Propagation
A Preference Model on Adaptive Affinity Propagation
 
Bm35359363
Bm35359363Bm35359363
Bm35359363
 
FUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONS
FUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONSFUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONS
FUZZY ROUGH INFORMATION MEASURES AND THEIR APPLICATIONS
 
A0311010106
A0311010106A0311010106
A0311010106
 
Unit .6
Unit .6Unit .6
Unit .6
 
Combinatorial optimization CO-4
Combinatorial optimization CO-4Combinatorial optimization CO-4
Combinatorial optimization CO-4
 
Unit .3
Unit .3Unit .3
Unit .3
 
Dimensionality reduction by matrix factorization using concept lattice in dat...
Dimensionality reduction by matrix factorization using concept lattice in dat...Dimensionality reduction by matrix factorization using concept lattice in dat...
Dimensionality reduction by matrix factorization using concept lattice in dat...
 
1710.09780avi widgerson
1710.09780avi widgerson1710.09780avi widgerson
1710.09780avi widgerson
 
An Approach to Mathematically Establish the Practical Use of Assignment Probl...
An Approach to Mathematically Establish the Practical Use of Assignment Probl...An Approach to Mathematically Establish the Practical Use of Assignment Probl...
An Approach to Mathematically Establish the Practical Use of Assignment Probl...
 
Fuzzy c-means
Fuzzy c-meansFuzzy c-means
Fuzzy c-means
 
Fault diagnosis using genetic algorithms and
Fault diagnosis using genetic algorithms andFault diagnosis using genetic algorithms and
Fault diagnosis using genetic algorithms and
 
Reproducibility and differential analysis with selfish
Reproducibility and differential analysis with selfishReproducibility and differential analysis with selfish
Reproducibility and differential analysis with selfish
 
Application of transportation problem under pentagonal neutrosophic environment
Application of transportation problem under pentagonal neutrosophic environmentApplication of transportation problem under pentagonal neutrosophic environment
Application of transportation problem under pentagonal neutrosophic environment
 
Dynamic approach to k means clustering algorithm-2
Dynamic approach to k means clustering algorithm-2Dynamic approach to k means clustering algorithm-2
Dynamic approach to k means clustering algorithm-2
 
Paper introduction to Combinatorial Optimization on Graphs of Bounded Treewidth
Paper introduction to Combinatorial Optimization on Graphs of Bounded TreewidthPaper introduction to Combinatorial Optimization on Graphs of Bounded Treewidth
Paper introduction to Combinatorial Optimization on Graphs of Bounded Treewidth
 

Destacado

Allah Tala Ke 99 Sifati Naam
Allah Tala Ke 99 Sifati NaamAllah Tala Ke 99 Sifati Naam
Allah Tala Ke 99 Sifati NaamFaryal Shah
 
A quality of service management in distributed feedback control scheduling ar...
A quality of service management in distributed feedback control scheduling ar...A quality of service management in distributed feedback control scheduling ar...
A quality of service management in distributed feedback control scheduling ar...csandit
 
Malaysian charter on human rights
Malaysian charter on human rightsMalaysian charter on human rights
Malaysian charter on human rightsS Ahabat Rakyat
 
Carolynn Recommendation
Carolynn RecommendationCarolynn Recommendation
Carolynn RecommendationCarolynn Wicks
 
K_Toto_resume-1-20-2016
K_Toto_resume-1-20-2016K_Toto_resume-1-20-2016
K_Toto_resume-1-20-2016Kristina Toto
 
piojos y liendres
piojos y liendres piojos y liendres
piojos y liendres skinner2015
 

Destacado (12)

ankur01
ankur01ankur01
ankur01
 
Trabalhos Budweiser
Trabalhos BudweiserTrabalhos Budweiser
Trabalhos Budweiser
 
Córdoba la llana.
Córdoba la llana.Córdoba la llana.
Córdoba la llana.
 
Equipo 5 la nube uvm
Equipo 5 la nube uvmEquipo 5 la nube uvm
Equipo 5 la nube uvm
 
2013年台灣心律不整防治宣導週
2013年台灣心律不整防治宣導週2013年台灣心律不整防治宣導週
2013年台灣心律不整防治宣導週
 
Allah Tala Ke 99 Sifati Naam
Allah Tala Ke 99 Sifati NaamAllah Tala Ke 99 Sifati Naam
Allah Tala Ke 99 Sifati Naam
 
A quality of service management in distributed feedback control scheduling ar...
A quality of service management in distributed feedback control scheduling ar...A quality of service management in distributed feedback control scheduling ar...
A quality of service management in distributed feedback control scheduling ar...
 
Malaysian charter on human rights
Malaysian charter on human rightsMalaysian charter on human rights
Malaysian charter on human rights
 
Carolynn Recommendation
Carolynn RecommendationCarolynn Recommendation
Carolynn Recommendation
 
No.219 english
No.219 englishNo.219 english
No.219 english
 
K_Toto_resume-1-20-2016
K_Toto_resume-1-20-2016K_Toto_resume-1-20-2016
K_Toto_resume-1-20-2016
 
piojos y liendres
piojos y liendres piojos y liendres
piojos y liendres
 

Similar a A sat encoding for solving games with energy objectives

A SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVES
A SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVESA SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVES
A SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVEScscpconf
 
HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...
HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...
HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...ijsc
 
Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...
Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...
Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...ijsc
 
A Hybrid Algorithm for Solving the Economic Dispatch Problem.pdf
A Hybrid Algorithm for Solving the Economic Dispatch Problem.pdfA Hybrid Algorithm for Solving the Economic Dispatch Problem.pdf
A Hybrid Algorithm for Solving the Economic Dispatch Problem.pdfraj20072
 
An Approach For Solving Multi-Objective Assignment Problem With Interval Para...
An Approach For Solving Multi-Objective Assignment Problem With Interval Para...An Approach For Solving Multi-Objective Assignment Problem With Interval Para...
An Approach For Solving Multi-Objective Assignment Problem With Interval Para...Dustin Pytko
 
Application of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatchApplication of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatchCemal Ardil
 
Interpolation of-geofield-parameters
Interpolation of-geofield-parametersInterpolation of-geofield-parameters
Interpolation of-geofield-parametersCemal Ardil
 
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...ijmnct
 
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...ijmnct
 
Interior Dual Optimization Software Engineering with Applications in BCS Elec...
Interior Dual Optimization Software Engineering with Applications in BCS Elec...Interior Dual Optimization Software Engineering with Applications in BCS Elec...
Interior Dual Optimization Software Engineering with Applications in BCS Elec...BRNSS Publication Hub
 
ON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMS
ON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMSON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMS
ON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMScscpconf
 
MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...
MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...
MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...cscpconf
 
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization Technique
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization TechniqueDynamic Economic Dispatch Assessment Using Particle Swarm Optimization Technique
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization TechniquejournalBEEI
 
PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...
PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...
PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...ijfls
 
Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...
Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...
Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...paperpublications3
 
A hybrid bacterial foraging and modified particle swarm optimization for mode...
A hybrid bacterial foraging and modified particle swarm optimization for mode...A hybrid bacterial foraging and modified particle swarm optimization for mode...
A hybrid bacterial foraging and modified particle swarm optimization for mode...IJECEIAES
 

Similar a A sat encoding for solving games with energy objectives (20)

A SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVES
A SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVESA SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVES
A SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVES
 
A Case Study of Economic Load Dispatch for a Thermal Power Plant using Partic...
A Case Study of Economic Load Dispatch for a Thermal Power Plant using Partic...A Case Study of Economic Load Dispatch for a Thermal Power Plant using Partic...
A Case Study of Economic Load Dispatch for a Thermal Power Plant using Partic...
 
schedule
scheduleschedule
schedule
 
HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...
HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...
HYBRID PARTICLE SWARM OPTIMIZATION FOR SOLVING MULTI-AREA ECONOMIC DISPATCH P...
 
Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...
Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...
Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch P...
 
A Hybrid Algorithm for Solving the Economic Dispatch Problem.pdf
A Hybrid Algorithm for Solving the Economic Dispatch Problem.pdfA Hybrid Algorithm for Solving the Economic Dispatch Problem.pdf
A Hybrid Algorithm for Solving the Economic Dispatch Problem.pdf
 
An Approach For Solving Multi-Objective Assignment Problem With Interval Para...
An Approach For Solving Multi-Objective Assignment Problem With Interval Para...An Approach For Solving Multi-Objective Assignment Problem With Interval Para...
An Approach For Solving Multi-Objective Assignment Problem With Interval Para...
 
Application of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatchApplication of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatch
 
Interpolation of-geofield-parameters
Interpolation of-geofield-parametersInterpolation of-geofield-parameters
Interpolation of-geofield-parameters
 
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
 
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
SOLVING OPTIMAL COMPONENTS ASSIGNMENT PROBLEM FOR A MULTISTATE NETWORK USING ...
 
40120130406008
4012013040600840120130406008
40120130406008
 
Interior Dual Optimization Software Engineering with Applications in BCS Elec...
Interior Dual Optimization Software Engineering with Applications in BCS Elec...Interior Dual Optimization Software Engineering with Applications in BCS Elec...
Interior Dual Optimization Software Engineering with Applications in BCS Elec...
 
ON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMS
ON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMSON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMS
ON THE DUALITY FEATURE OF P-CLASS PROBLEMS AND NP COMPLETE PROBLEMS
 
KMAP PAPER (1)
KMAP PAPER (1)KMAP PAPER (1)
KMAP PAPER (1)
 
MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...
MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...
MIXED 0−1 GOAL PROGRAMMING APPROACH TO INTERVAL-VALUED BILEVEL PROGRAMMING PR...
 
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization Technique
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization TechniqueDynamic Economic Dispatch Assessment Using Particle Swarm Optimization Technique
Dynamic Economic Dispatch Assessment Using Particle Swarm Optimization Technique
 
PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...
PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...
PREDICTIVE EVALUATION OF THE STOCK PORTFOLIO PERFORMANCE USING FUZZY CMEANS A...
 
Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...
Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...
Combination of Immune Genetic Particle Swarm Optimization algorithm with BP a...
 
A hybrid bacterial foraging and modified particle swarm optimization for mode...
A hybrid bacterial foraging and modified particle swarm optimization for mode...A hybrid bacterial foraging and modified particle swarm optimization for mode...
A hybrid bacterial foraging and modified particle swarm optimization for mode...
 

Último

Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintMahmoud Rabie
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPathCommunity
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8DianaGray10
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsSafe Software
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopBachir Benyammi
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Will Schroeder
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Brian Pichman
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDELiveplex
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024D Cloud Solutions
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 

Último (20)

Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership Blueprint
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation Developers
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8
 
20150722 - AGV
20150722 - AGV20150722 - AGV
20150722 - AGV
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
20230104 - machine vision
20230104 - machine vision20230104 - machine vision
20230104 - machine vision
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 Workshop
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
 
Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )Building Your Own AI Instance (TBLC AI )
Building Your Own AI Instance (TBLC AI )
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 

A sat encoding for solving games with energy objectives

  • 1. A SAT ENCODING FOR SOLVING GAMES WITH ENERGY OBJECTIVES Raffaella Gentilini Dip. di Matematica e Informatica, Universit`a di Perugia, Via Vanvitelli 1, Perugia (IT) ABSTRACT 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. 1. INTRODUCTION Energy games (EG) are two-players games played on weighted graphs, where the integer weight associated to each edge represents the corresponding energy gain/loss. The arenas of energy games are endowed of two types of vertices: in player 0 (resp. player 1) vertices, player 0 (resp. player 1) chooses the successor vertex from the set of outgoing edges and the game results in an infinite path through the graph. Given an initial credit of energy c, the objective of player 0 is to maintain the sum of the weights (the energy level) positive. The decision problem for EG asks, given a weighted game graph with initial vertex v 0, if there exists an initial credit for which player 0 wins from v 0. Energy games have been introduced in [3, 2] to model the synthesis problem within the design of reactive systems that work in resource-constrained environments. Beside their applicability to the modeling of quantitative problems for computer aided design, EG have tight connections with important problems in game theory and logic. For instance, they are log-space equivalent to mean-payoff games (MPG) [2], another kind of quantitative two-player game very well studied both in economics and in computer science. The latter are characterized by a theoretically engaging complexity status, being one of the few inhabitants of the complexity class NP∩coNP (for which the inclusion in P is still an open problem). Moreover, parity games [4, 6]— notoriously known as poly-time equivalent to the model-checking problem for the modal mucalculus—are in turn poly-time reducible to MPG and EG. It is a long-standing open question to know whether the model-checking problem for the modal mu-calculus is in P. The algorithm with the currently best (pseudopolynomial) complexity for solving EG (and MPG via log-space reduction) is based on the so-called notion of energy progress measure [7]. David C. Wyld et al. (Eds) : CST, ITCS, JSE, SIP, ARIA, DMS - 2014 pp. 45–52, 2014. © CS & IT-CSCP 2014 DOI : 10.5121/csit.2014.4105
  • 2. 46 Computer Science & Information Technology (CS & IT) Progress measures for weighted graphs are functions that impose local conditions to ensure global properties of the graph. A notion of parity progress measure [6] was previously exploited in [6] for the algorithmic analysis of parity games and reconsidered in [5] to devise a SAT encoding of the corresponding games, motivated by the considerable success that using SAT solvers has had in symbolic verification. As a matter of fact, clever heuristics implemented in nowadays SAT solvers can result in algorithms that are very efficient in practice. Furthermore, there are fragments of SAT that can be solved in polynomial time. Hence, the reduction in [5] opens up a new possibility for showing inclusion of parity games in P. Motivated by analogous reasons, in this paper 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. Tight upper bounds on the sizes of our reductions are also reported. The paper is organized as follows.We recall the notions of energy games and energy progress measure in Section 2. Section 3 and Section 4 develop the reductions from energy games to difference logic and pure SAT, respectively, reporting tight bounds on the sizes of the corresponding reductions. 2. PRELIMINARIES
  • 3. Computer Science & Information Technology (CS & IT) 47
  • 4. 48 Computer Science & Information Technology (CS & IT) 2.1 Difference Logic 3. ENCODING EG WINNING STRATEGIES IN DIFFERENCE LOGIC
  • 5. Computer Science & Information Technology (CS & IT) 49
  • 6. 50 Computer Science & Information Technology (CS & IT) 4. SOLVING ENERGY GAMES BY A REDUCTION TO SAT
  • 7. Computer Science & Information Technology (CS & IT) 51 5. CONCLUSIONS We devise efficient encodings of the energy games problem into the satisfiability problem for formulas of difference logic and pure propositional logic in conjunctive normal form. Tight upper bounds on the sizes of the given reductions are also reported. Due to the success of nowadays SAT solvers in symbolic verification, the proposed encodings could result in algorithms that are very efficient in practice. Furthermore, they could open up new possibilities for devising tight bounds on the complexity of the energy games problem, as there are fragments of SAT that can be solved in polynomial time.
  • 8. 52 Computer Science & Information Technology (CS & IT) REFERENCES [1] [2] [3] [4] [5] [6] [7] [8] A. Ehrenfeucht and J. Mycielski. International journal of game theory. Positional Strategies for Mean-Payoff Games, 8:109–113, 1979. P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba. Infinite runs in weighted timed automata with energy constraints. In Proc. of FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS 5215, pages 33–47. Springer, 2008. A. Chakrabarti, L. de Alfaro, T. A. Henzinger, and M. Stoelinga. Resource interfaces. In Proc. of EMSOFT: Embedded Software, LNCS 2855, pages 117–133. Springer, 2003. Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. of STOC: Symposium on Theory of Computing, pages 60–65. ACM, 1982. Keijo Heljanko, Misa Kein¨anen, Martin Lange, and Ilkka Niemel¨a. Solving parity games by a reduction to sat. J. Comput. Syst. Sci., 78(2):430–440, March 2012. M. Jurdzinski. Small progress measures for solving parity games. In Proceedings of STACS: Theoretical Aspects of Computer Science, LNCS 1770, pages 290–301. Springer, 2000. L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, and J-F. Raskin. Faster algorithms for mean payoff games. Formal Methods in System Design, 38(2):97–118, 2011. Moez Mahfoudh, Peter Niebert, Eugene Asarin, and Oded Maler. A satisfiability checker for difference logic. In 5-th Int. Symp. on the Theory and Applications of Satisfliability Testing, 2002.