activity
20062023
most citedAlgorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

93 citations · 141 across the 18 of their papers we have counts for

collaborators
Showing cs.LOShow all

12 papers · 1 filter

cs.LO2020

Model checking and model synthesisfrom partial models: a logic-based perspective

Valentin Goranko

I consider the following generic scenario: an abstract model M of some 'real' system is only partially presented, or partially known to us, and we have to ensure that the actual sy…

cs.LO2020

The temporal logic of coalitional goal assignments in concurrent multi-player games

Sebastian Enqvist, Valentin Goranko

We introduce and study a natural extension of the Alternating time temporal logic ATL, called Temporal Logic of Coalitional Goal Assignments (TLCGA). It features just one, but quit…

cs.LO2017★ 1 cited

A logic for temporal conditionals and a solution to the Sea Battle Puzzle

Fengkui Ju, Gianluca Grilletti, Valentin Goranko

Temporal reasoning with conditionals is more complex than both classical temporal reasoning and reasoning with timeless conditionals, and can lead to some rather counter-intuitive…

cs.LO2014★ 6 cited

Optimal Tableaux Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-time Temporal Logic ATL+

Serenella Cerrito, Amélie David, Valentin Goranko

We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the fu…

cs.LO2013★ 25 cited

How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract)

Nils Bulling, Valentin Goranko

We propose a logical framework combining a game-theoretic study of abilities of agents to achieve quantitative objectives in multi-player games by optimizing payoffs or preferences…

cs.LO2012

Tableau-based decision procedure for the multi-agent epistemic logic with all coalitional operators for common and distributed knowledge

Mai Ajspur, Valentin Goranko, Dmitry Shkatov

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi-agent epistemic logic CMAEL(CD) with operators for common a…