Advertisement

Speed-Up Techniques for Negation in Grounding

  • Amir Aavani
  • Shahab Tasharrofi
  • Gulay Unel
  • Eugenia Ternovska
  • David Mitchell
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6355)

Abstract

Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and reasoning systems. One method for grounding is based on an extension of the relational algebra, exploiting the fact that grounding over a given domain is similar to query answering. In this paper, we introduce two methods for speeding up algebraic grounding by reducing the size of tables produced. One method employs rewriting of the formula before grounding, and the other uses a further extension of the algebra that makes negation efficient. We have implemented the methods, and present experimental evidence of their effectiveness.

Keywords

Free Variable Hamiltonian Cycle Relational Algebra Query Answering Negation Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The Asparagus Library of Examples for ASP Programs, http://asparagus.cs.uni-potsdam.de/
  2. 2.
    Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence 162, 89–120 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Cluet, S., Moerkotte, G.: On the complexity of generating optimal left-deep processing trees with cross products. In: Y. Vardi, M., Gottlob, G. (eds.) ICDT 1995. LNCS, vol. 893, pp. 54–67. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  4. 4.
    Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: SIAM-AMC Proceedings of Complexity of Computation, vol. 7, pp. 43–73 (1974)Google Scholar
  5. 5.
    Frisch, A.M., Harvey, W., Jefferson, C., Hernández, B.M., Miguel, I.: Essence: A constraint language for specifying combinatorial problems. Constraints 13(3), 268–306 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Gebser, M., Schaub, T., Thiele, S.: Gringo: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 266–271. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Mohebali, R.: A method for solving np search based on model expansion and grounding. Master’s thesis, Simon Fraser University (2006)Google Scholar
  9. 9.
    Patterson, M., Liu, Y., Ternovska, E., Gupta, A.: Grounding for model expansion in k-guarded formulas with inductive definitions. In: Proc. IJCAI 2007, pp. 161–166 (2007)Google Scholar
  10. 10.
    Wittocx, J., Mariën, M., Denecker, M.: Grounding with bounds. In: Proc. AAAI 2008, pp. 572–577 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Amir Aavani
    • 1
  • Shahab Tasharrofi
    • 1
  • Gulay Unel
    • 1
  • Eugenia Ternovska
    • 1
  • David Mitchell
    • 1
  1. 1.Simon Fraser UniversityCanada

Personalised recommendations