144 search results - page 28 / 29 » On meta complexity of propositional formulas and proposition... |
IJCAI
2007
13 years 9 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
FUIN
2000
13 years 7 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
DLOG
2004
13 years 8 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...