189 search results - page 15 / 38 » Similarity-Guided Clause Generalization |
100
Voted
DAC
2007
ACM
16 years 4 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
128
Voted
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
149
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
127
Voted
JAR
2002
15 years 3 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
141
click to vote
ILP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...