Sciweavers

710 search results - page 106 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
ICLP
1997
Springer
13 years 12 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
CPAIOR
2009
Springer
14 years 2 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
IPPS
1999
IEEE
14 years 3 hour ago
Marshaling/Demarshaling as a Compilation/Interpretation Process
Marshaling is the process through which structured values are serialized into a stream of bytes; demarshaling converts this stream of bytes back to structured values. Most often, ...
Christian Queinnec
ADC
2004
Springer
105views Database» more  ADC 2004»
14 years 1 months ago
Do Clarity Scores for Queries Correlate with User Performance?
Recently the concept of a clarity score was introduced in order to measure the ambiguity of a query in relation to the collection in which the query issuer is seeking information ...
Andrew Turpin, William R. Hersh
JSS
2010
215views more  JSS 2010»
13 years 6 months ago
Analyzing architectural styles
The backbone of many software architectures and component integration frameworks is an architectural style that provides a domain-specific design vocabulary and a set of constrai...
Jung Soo Kim, David Garlan