Sciweavers

139 search results - page 6 / 28
» Models of set theory with definable ordinals
Sort
View
CONCUR
2010
Springer
13 years 9 months ago
Theory by Process
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Yuxi Fu
LPAR
2007
Springer
14 years 1 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
TSMC
2010
13 years 2 months ago
Incomplete Multigranulation Rough Set
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
Yuhua Qian, Jiye Liang, Chuangyin Dang
AMAI
2006
Springer
13 years 7 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
IEEEICCI
2006
IEEE
14 years 1 months ago
Rough Set Method Based on Multi-Granulations
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
Y. H. Qian, J. Y. Liang