Sciweavers

3693 search results - page 207 / 739
» Splitting a Logic Program
Sort
View
FMOODS
2003
15 years 7 months ago
Proof Scores in the OTS/CafeOBJ Method
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several ca...
Kazuhiro Ogata, Kokichi Futatsugi
ILP
2005
Springer
15 years 11 months ago
Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models
Abstract. Logical Bayesian Networks (LBNs) have recently been introduced as another language for knowledge based model construction of Bayesian networks, besides existing languages...
Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe...
IJCGA
2008
114views more  IJCGA 2008»
15 years 6 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
CORR
2010
Springer
315views Education» more  CORR 2010»
15 years 1 months ago
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...
Fen Zhou, Miklós Molnár, Bernard Cou...
POPL
2002
ACM
16 years 6 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...