Sciweavers

2410 search results - page 39 / 482
» Multiset Ordering Constraints
Sort
View
EMNLP
2008
15 years 5 months ago
Attacking Decipherment Problems Optimally with Low-Order N-gram Models
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
Sujith Ravi, Kevin Knight
JOLLI
2007
79views more  JOLLI 2007»
15 years 4 months ago
Supplementing Entity Coherence with Local Rhetorical Relations for Information Ordering
This paper investigates whether the model of local rhetorical coherence suggested in Knott et al. (2001) can boost the performance of the Centering-based metrics of entity coheren...
Nikiforos Karamanis
CP
2009
Springer
16 years 5 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
CADE
2001
Springer
16 years 4 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager
CP
2005
Springer
15 years 10 months ago
Incremental Algorithms for Local Search from Existential Second-Order Logic
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
Magnus Ågren, Pierre Flener, Justin Pearson