2145 search results - page 53 / 429 » Lax Logical Relations |
DAC
2004
ACM
14 years 11 months ago
2004
ACM
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
KSEM
2010
Springer
13 years 8 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
SIAMCOMP
2000
13 years 9 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
PODS
2009
ACM
14 years 10 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
JACM
2000
13 years 10 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...