601 search results - page 21 / 121 » Quantified Equality Constraints |
EACL
1989
ACL Anthology
13 years 11 months ago
1989
ACL Anthology
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
HOST
2008
IEEE
14 years 4 months ago
2008
IEEE
—Straightforward implementations of cryptographic algorithms are known to be vulnerable to attacks aimed not at the mathematical structure of the cipher but rather at the weak po...
CSL
2009
Springer
14 years 1 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
PRICAI
1998
Springer
14 years 2 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...