4401 search results - page 258 / 881 » Computing with Default Logic |
130
click to vote
STACS
2000
Springer
15 years 9 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
176
click to vote
CCIA
2008
Springer
15 years 7 months ago
2008
Springer
Since electronic and open environments became a reality, computational trust and reputation models have attracted increasing interest in the field of multiagent systems (MAS). Some...
150
click to vote
CF
2008
ACM
15 years 7 months ago
2008
ACM
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
141
click to vote
ATS
2005
IEEE
15 years 7 months ago
2005
IEEE
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
179
click to vote
GCC
2007
Springer
15 years 7 months ago
2007
Springer
In recent years, the rapid growth of m-commerce is being driven by various emerging mobile applications and services. Among them, mobile information service is considered to be on...