Sciweavers

1144 search results - page 4 / 229
» Logic programming for combinatorial problems
Sort
View
WLP
2004
Springer
14 years 28 days ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták
KR
2010
Springer
14 years 11 days ago
Modelling Combinatorial Auctions in Linear Logic
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
Daniele Porello, Ulle Endriss
AMAI
2004
Springer
13 years 7 months ago
Logical Preference Representation and Combinatorial Vote
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
Jérôme Lang
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
AGP
2003
IEEE
14 years 27 days ago
Interpreting Abduction in CLP
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...