Back to Results
First PageMeta Content
Automated planning and scheduling / STRIPS / FO / Constructible universe / Net / IP / Polynomial hierarchy / PSPACE / Function / Mathematics / Applied mathematics / Complexity classes


Journal of Artificial Intelligence Research[removed]432 Submitted 07/08; published[removed]The Computational Complexity of Dominance and Consistency in CP-Nets
Add to Reading List

Document Date: 2008-11-25 12:36:17

Open Document

File Size: 226,29 KB

Share Result on Facebook

City

Toulouse Cedex / /

Company

UPS / Wilson / Venable / Let us / /

Country

France / /

Facility

Computer Science University of Kentucky Lexington / /

IndustryTerm

computing / nondeterministic algorithm / /

Organization

Computer Science University of Kentucky Lexington / EDU Department / AI Access Foundation / /

Person

Jérôme Lang / /

ProvinceOrState

Prince Edward Island / Kentucky / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

artificial intelligence / following nondeterministic algorithm / /

SocialTag