A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae

Proof Systems for Effectively Propositional Logic

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning

An Improvement of Herbrand's theorem and its application to model generation theorem proving

Journal of Computer Science and Technology

Grounding FO and FO(ID) with bounds

Journal of Artificial Intelligence Research

Boolean formulas of simple conceptual graphs SGBF

GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning