Back to Results
First PageMeta Content
Mathematical logic / XML / Formal languages / Metalogic / Interpretation / First-order logic / Well-formed formula / Symbol / XPath / Logic / Mathematics / Model theory


XPath Typing Using a Modal Logic with Converse for Finite Trees Pierre Genev`es Nabil Laya¨ıda Alan Schmitt
Add to Reading List

Document Date: 2006-12-17 11:49:32

Open Document

File Size: 303,32 KB

Share Result on Facebook

City

Report / Cambridge / Nice / London / Darmstadt / New York / /

Company

Y def Sa / IEEE Computer Society Press / VF / MIT Press / siblingKfchild(F ) def Sa / Database Systems / def Sa / siblingKnsibling(F ) def Sa / JdescendantKF def Sa / siblingKpsibling(F ) def Sa / ACM Press / JancestorKF def Sa / /

Country

Germany / France / United States / United Kingdom / /

/

Facility

University of Pennsylvania / /

IndustryTerm

security applications / satisfiability testing algorithm / satisfiability algorithm / relational products / Graph-based algorithms / /

OperatingSystem

Windows XP / /

Organization

V F / University of Pennsylvania / MIT / /

Person

XHTML DTD / J. Edmund M. Clarke / Alan Schmitt / Nabil Laya¨ıda Alan / /

Position

author / qualifier / official / /

Product

Sq JpKf / /

ProgrammingLanguage

XML / L / J / XSLT / XPath / K / /

ProvinceOrState

Pennsylvania / New York / /

Technology

Programming Language Technologies / Functional Programming / Object-Oriented Programming / XML / satisfiability algorithm / RAM / JAVA / DTD / satisfiability testing algorithm / html / Graph-based algorithms / SMIL / XSLT / /

URL

http /

SocialTag