Sciweavers

4126 search results - page 194 / 826
» Set based logic programming
Sort
View
136
Voted
FUZZIEEE
2007
IEEE
15 years 9 months ago
Distance Measure Assisted Rough Set Feature Selection
Abstract— Feature Selection (FS) is a technique for dimensionality reduction. Its aims are to select a subset of the original features of a dataset which are rich in the most use...
Neil MacParthalain, Qiang Shen, Richard Jensen
139
Voted
WLP
1997
Springer
15 years 6 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
138
Voted
IJIT
2004
15 years 3 months ago
Consistent Hybrid Knowledge Representation in Order-Sorted Logic
Abstract-- We consider a hybrid knowledge representation system for ontological knowledge bases in order to maintain knowledge consistency between taxonomic knowledge and assertion...
Nwe Ni Tun, Satoshi Tojo
POPL
2006
ACM
16 years 2 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
DLOG
2010
15 years 17 days ago
On the feasibility of Description Logic knowledge bases with rough concepts and vague instances
Abstract. A usage scenario of bio-ontologies is hypothesis testing, such as finding relationships or new subconcepts in the data linked to the ontology. Whilst validating the hypot...
C. Maria Keet