Sciweavers

1144 search results - page 22 / 229
» Logic programming for combinatorial problems
Sort
View
EMNLP
2007
13 years 9 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
Luke S. Zettlemoyer, Michael Collins
IAT
2006
IEEE
14 years 1 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
CPAIOR
2008
Springer
13 years 9 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
TPLP
2008
118views more  TPLP 2008»
13 years 7 months ago
Logic programming with satisfiability
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming f...
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
ATAL
2010
Springer
13 years 7 months ago
Time constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
Andreas Witzel, Ulle Endriss