Sciweavers

2022 search results - page 4 / 405
» Complexity of Non-Monotonic Logics
Sort
View
ASP
2005
Springer
14 years 3 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
FLAIRS
2004
13 years 11 months ago
Typicality, Contextual Inferences and Object Determination Logic
We propose a rigorous definition of the notion of typicality, making use of the strict partial order naturally induced among the objects at hand by a given concept. This perspecti...
Michael Freund, Jean-Pierre Desclés, Anca P...
KR
2004
Springer
14 years 3 months ago
Inductive Situation Calculus
Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus using the Lo...
Marc Denecker, Eugenia Ternovska
LATA
2012
Springer
12 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...
EUSFLAT
2009
137views Fuzzy Logic» more  EUSFLAT 2009»
13 years 7 months ago
Parametric Fuzzy Modelling Framework for Complex Data-Inherent Structures
The present article dedicates itself to fuzzy modelling of data
Arne-Jens Hempel, Steffen F. Bocklisch