74 search results - page 5 / 15 » On the Parameterized Complexity of Default Logic and Autoepi... |
ASP
2001
Springer
14 years 1 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
AAAI
2012
11 years 11 months ago
2012
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
KR
2000
Springer
14 years 4 days ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...