Published:
May 2002
Proceedings:
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2002)
Volume
Issue:
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2002)
Track:
All Papers
Downloads:
Abstract:
A near-propositional CNF formula is a first-order formula (in clause normal form) with a finite Herbrand universe. For this class of problems, the validity problem can be decided by a combination of grounding and propositional reasoning. However, naive approaches to grounding can generate extremely large ground formulae. We investigate various means to reduce the number of ground instances generated and show that we can increase the number of problems that can be handled with reasonable resources.
FLAIRS
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2002)
ISBN 978-1-57735-141-2
Published by The AAAI Press, Menlo Park, California