Sciweavers

298 search results - page 34 / 60
» A probabilistic approach to default reasoning
Sort
View
ICLP
2009
Springer
16 years 6 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
16 years 25 days 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,...
LPNMR
2009
Springer
16 years 18 days ago
A Module-Based Framework for Multi-language Constraint Modeling
We develop a module-based framework for constraint modeling where it is possible to combine different constraint modeling languages and exploit their strengths in a flexible way. ...
Matti Järvisalo, Emilia Oikarinen, Tomi Janhu...
AGP
2003
IEEE
15 years 11 months ago
Ordered Programs as Abductive Systems
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
Davy Van Nieuwenborgh, Dirk Vermeir
GRAPHICSINTERFACE
2003
15 years 7 months ago
The Effects of Dynamic Transparency on Targeting Performance
Transparency can be used to increase the visibility of a user’s workspace in situations where the space is obscured by floating windows and tool palettes. Dynamic transparency t...
Carl Gutwin, Jeff Dyck, Chris Fedak