7 search results - page 2 / 2 » tascpl: TAS Solver for Classical Propositional Logic |
JAIR
2010
14 years 10 months ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
103
click to vote
CSCLP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...