Sciweavers

236 search results - page 40 / 48
» Reasoning with Prioritized Defaults
Sort
View
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
13 years 5 months ago
Efficient state space exploration: Interleaving stateless and state-based model checking
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
Malay K. Ganai, Chao Wang, Weihong Li
SEMWEB
2010
Springer
13 years 5 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
SOCIALCOM
2010
13 years 5 months ago
Assessing the Value of Contributions in Tagging Systems
-- Assessing the value of individual users' contributions in peer-production systems is paramount to the design of mechanisms that support collaboration and improve users'...
Elizeu Santos-Neto, Flavio Figueiredo, Jussara M. ...
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
CLUSTER
2009
IEEE
14 years 2 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...