Back to Results
First PageMeta Content
Logic programming / Logic in computer science / Non-classical logic / Structural complexity theory / Complexity classes / Stable model semantics / Answer set programming / Fuzzy logic / Negation / Theoretical computer science / Applied mathematics / Mathematics


Complexity of fuzzy answer set programming under Lukasiewicz semantics Marjon Blondeela,1 , Steven Schockaertb , Dirk Vermeira , Martine De Cockc a Vrije Universiteit Brussel, Department of Computer Science, Pleinlaan 2
Add to Reading List

Document Date: 2013-10-21 12:32:43


Open Document

File Size: 436,33 KB

Share Result on Facebook

City

Brussel / /

Country

United Kingdom / Belgium / /

/

Facility

Cardiff University / Ghent University / /

IndustryTerm

search problem / model combinatorial search problems / pseudo-polynomial time algorithm / negation-as-failure operator / computing / model search problems / continuous systems / polynomial time algorithm / search problems / /

Organization

School of Computer Science and Informatics / Department of Applied Mathematics / Computer Science and Statistics / Cardiff University / Department of Computer Science / Ghent University / Research Foundation / /

Person

Martine De Cock / Steven Schockaertb / Dirk Vermeira / Martine De Cockc / Marjon Blondeela / Dirk Vermeir / Steven Schockaert / /

Position

head / /

Technology

pseudo-polynomial time algorithm / polynomial time algorithm / fuzzy logic / /

SocialTag