Sciweavers

189 search results - page 22 / 38
» Efficient Representation of Adhoc Constraints
Sort
View
ISSRE
2010
IEEE
13 years 8 months ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
CADE
2001
Springer
14 years 10 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
CLP-based protein fragment assembly
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
Alessandro Dal Palù, Agostino Dovier, Feder...
ICLP
2009
Springer
14 years 10 months ago
Attributed Data for CHR Indexing
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
Beata Sarna-Starosta, Tom Schrijvers
AMAI
2008
Springer
13 years 9 months ago
Mixed deterministic and probabilistic networks
Abstract The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to devel...
Robert Mateescu, Rina Dechter