31 search results - page 1 / 7 » On the Complexity of Equational Horn Clauses |
CADE
2005
Springer
14 years 5 months ago
2005
Springer
CTRS
1990
13 years 8 months ago
1990
A new positive-unit theorem-proving procedure for equational Horn clauses is presented. It uses a term ordering to restrict paxamodulation to potentiallymaximal sides of equations...
ADC
2006
Springer
13 years 10 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 ...
TOCL
2008
13 years 4 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...