1667 search results - page 38 / 334 » Extended clause learning |
CADE
2006
Springer
14 years 8 months ago
2006
Springer
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
ALGORITHMICA
2007
13 years 7 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
APAL
2008
13 years 7 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...
ENTCS
2010
13 years 5 months ago
2010
We propose an algebra of languages and transformations as a means for extending s syntactically. The algebra provides a layer of high-level abstractions built on top of languages ...