189 search results - page 12 / 38 » Similarity-Guided Clause Generalization |
82
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...
GECON
2008
Springer
15 years 25 days ago
2008
Springer
A Service Level Agreement (SLA) is an electronic contract between a service user and a provider, and specifies the service to be provided, Quality of Service (QoS) properties that...
DAC
2007
ACM
16 years 22 days ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
DAC
2003
ACM
16 years 22 days ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
ICML
2007
IEEE
16 years 17 days ago
2007
IEEE
Markov logic networks (MLNs) are a statistical relational model that consists of weighted firstorder clauses and generalizes first-order logic and Markov networks. The current sta...