1039 search results - page 92 / 208 » Query reformulation with constraints |
252
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
134
Voted
EDOC
2003
IEEE
15 years 10 months ago
2003
IEEE
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
134
Voted
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
In a previous paper, we laid out the vision of declarative datadriven coordination (D3C) where users are provided with novel abstractions that enable them to communicate and coord...
142
click to vote
ICNP
2005
IEEE
15 years 10 months ago
2005
IEEE
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...
182
Voted
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...