1242 search results - page 145 / 249 » The Theory of Grammar Constraints |
102
click to vote
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
105
click to vote
AGP
1999
IEEE
15 years 5 months ago
1999
IEEE
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
92
Voted
DGCI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Existing theories on shape digitization impose strong constraints on feasible shapes and require error-free measurements. We use Delaunay triangulation and -shapes to pro...
EMNLP
2008
15 years 2 months ago
2008
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...
AMAI
2008
Springer
15 years 28 days ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....