31 search results - page 4 / 7 » On the Complexity of Equational Horn Clauses |
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
DIS
2003
Springer
14 years 26 days ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
14 years 1 months ago
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
ENTCS
2006
13 years 7 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
DAM
1999
13 years 7 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...