74 search results - page 8 / 15 » On the Parameterized Complexity of Default Logic and Autoepi... |
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
96
Voted
ECCC
2008
14 years 10 months ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper is a presentation of ONTO-DLP, an extension of Disjunctive Logic Programming (DLP) for complex knowledge modelling. ONTO-DLP enhances DLP by constructs coming from othe...
ICDT
1990
ACM
15 years 2 months ago
1990
ACM
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
CORR
1999
Springer
14 years 10 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...