Sciweavers

2035 search results - page 4 / 407
» On the complexity of stratified logics
Sort
View
LATA
2012
Springer
13 years 5 months ago
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
ECSQARU
2009
Springer
15 years 1 months ago
Knowledge Base Stratification and Merging Based on Degree of Support
Most operators for merging multiple knowledge bases (where each is a set of formulae) aim to produce a knowledge base as output that best reflects the information available in the ...
Anthony Hunter, Weiru Liu
BIRTHDAY
2008
Springer
15 years 2 days ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
AIR
2006
83views more  AIR 2006»
14 years 10 months ago
A revision-based approach to handling inconsistency in description logics
Recently, the problem of inconsistency handling in description logics has attracted a lot of attention. Many approaches have been proposed to deal with this problem based on existi...
Guilin Qi, Weiru Liu, David A. Bell
JANCL
2002
121views more  JANCL 2002»
14 years 9 months ago
Approximate coherence-based reasoning
ABSTRACT. It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of rea...
Frédéric Koriche