Sciweavers

934 search results - page 78 / 187
» Elementary Sets of Logic Programs
Sort
View
CP
2006
Springer
15 years 1 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
CONCURRENCY
2008
60views more  CONCURRENCY 2008»
14 years 10 months ago
Steering via the image in local, distributed and collaborative settings
Computational steering is a valuable mechanism for scientific investigation in which the parameters of a running program can be altered and the results visualized immediately. In ...
J. D. Wood, H. Wright
AGP
1998
IEEE
15 years 1 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
ASP
2005
Springer
15 years 3 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
106
Voted
JAR
2007
142views more  JAR 2007»
14 years 10 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler