Back to Results
First PageMeta Content
Formal languages / Logical syntax / Model theory / Linear temporal logic / Well-formed formula / Interpretation / Function / Computation tree logic / Logic programming / Logic / Metalogic / Temporal logic


A Efficiently Deciding µ-calculus with Converse over Finite Trees ` , CNRS Pierre Geneves Nabil Laya¨ıda, Inria Alan Schmitt, Inria
Add to Reading List

Document Date: 2015-02-04 13:59:05

Open Document

File Size: 588,45 KB

Share Result on Facebook

City

Inria / Grenoble / New York / /

Company

ACM Inc. / /

Country

France / United States / /

Currency

USD / /

/

Facility

Penn Plaza / /

/

IndustryTerm

composition law / online demonstration / satisfiability algorithm / generic tool / satisfiability-testing algorithm / /

Person

Nils Gesbert / Emerson / Pierre Genev / Dexter Kozen / Pierre Genev`es / Nabil Laya / Nabil Laya¨ıda / Dana Scott / Clarke / Jaco de Bakker / Pierre Geneves Nabil Laya / Alan Schmitt / Pierre Geneves / /

/

Position

General / Corresponding author / /

ProgrammingLanguage

XPath / /

ProvinceOrState

New York / /

Technology

XML / satisfiability algorithm / satisfiability-testing algorithm / /

URL

http /

SocialTag