Sciweavers

874 search results - page 77 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 7 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin
105
Voted
EOR
2007
159views more  EOR 2007»
15 years 23 days ago
Solving the semi-desirable facility location problem using bi-objective particle swarm
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
Haluk Yapicioglu, Alice E. Smith, Gerry V. Dozier
107
Voted
LPNMR
2001
Springer
15 years 5 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
113
Voted
JUCS
2006
135views more  JUCS 2006»
15 years 23 days ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...
92
Voted
FMSD
2006
104views more  FMSD 2006»
15 years 25 days ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord