Back to Results
First PageMeta Content
Model theory / Metalogic / Logic in computer science / Formal languages / Temporal logic / Well-formed formula / First-order logic / Symbol / Satisfiability / Logic / Mathematical logic / Theoretical computer science


SATISFIABILITY GAMES FOR BRANCHING-TIME LOGICS OLIVER FRIEDMANN, MARKUS LATTE, AND MARTIN LANGE e-mail address: {oliver.friedmann, markus.latte}@ifi.lmu.de Department of Computer Science, Ludwig-Maximilians-University Mu
Add to Reading List

Document Date: 2013-08-22 12:16:49

Open Document

File Size: 534,59 KB

Share Result on Facebook

Currency

pence / /

/

Event

Product Recall / Product Issues / /

Facility

University Munich / University of Kassel / /

IndustryTerm

machinery / temporal logic machinery / important tool / axiom systems / transition systems / important applications / /

OperatingSystem

Xp / /

Organization

European Research Council / European Union / African Union / Department of Computer Science / School of Electrical Engineering and Computer Science / University of Kassel / /

Person

MARTIN LANGE / MARKUS LATTE / Oliver Friedmann / TIME LOGICS OLIVER FRIEDMANN / /

Position

player / /

Product

CTL∗ / /

Technology

obtained algorithms / /

SocialTag