Sciweavers

111 search results - page 7 / 23
» Definability in Logic and Rough Set Theory
Sort
View
AAAI
2000
13 years 8 months ago
Towards a Logic-Based Theory of Argumentation
There are a number of frameworks for modelling argumentation in logic. They incorporate formal representation of individual arguments and techniques for comparing conflicting argu...
Philippe Besnard, Anthony Hunter
ICLP
2009
Springer
14 years 8 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
RSCTC
2004
Springer
237views Fuzzy Logic» more  RSCTC 2004»
14 years 25 days ago
An Automated Multi-spectral MRI Segmentation Algorithm Using Approximate Reducts
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
Sebastian Widz, Kenneth Revett, Dominik Slezak
FSKD
2008
Springer
113views Fuzzy Logic» more  FSKD 2008»
13 years 8 months ago
Incremental Knowledge Base for Uncertain Reasoning
Evidence theory has been widely applied to uncertain reasoning. However, the evidence space and hypothesis space are each defined as a fixed set. If the theory is applied to solve...
Qingxiang Wu, Xi Huang, David A. Bell, Guilin Qi, ...
CIE
2008
Springer
13 years 9 months ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova