46 search results - page 2 / 10 » Combinatorial Problems for Horn Clauses |
ADC
2006
Springer
13 years 11 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
EMNLP
2010
13 years 3 months ago
2010
Even the entire Web corpus does not explicitly answer all questions, yet inference can uncover many implicit answers. But where do inference rules come from? This paper investigat...
TOCL
2008
13 years 5 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
AAAI
1994
13 years 6 months ago
1994
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...