Skip to main content
SpringerLink
Log in

Normal Forms for Knowledge Compilation

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3488))

Included in the following conference series:

Abstract

A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean function. Reduction strategies are developed that provide a unique reduced factored negation normal form. These compilation techniques work well with negated form as input, and it is shown that any logical formula can be translated into negated form in linear time.

This research was supported in part by the National Science Foundation under grant CCR-0229339.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D’Agostino, M., Mondadori, M.: The taming of the cut. Journal of Logic and Computation 4(3), 285–319 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bryant, R.E.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)

    Article  Google Scholar 

  3. Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Communications 10, 137–150 (1997)

    Google Scholar 

  4. Darwiche, A.: Compiling devices: A structure-based approach. In: Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR 1998), pp. 156–166. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  5. Darwiche, A.: Decomposable negation normal form. J. ACM 48(4), 608–647 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Forbus, K.D., de Kleer, J.: Building Problem Solvers. MIT Press, Cambridge (1993)

    MATH  Google Scholar 

  7. Goubault, J., Posegga, J.: BDDs and automated deduction. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS (LNAI), vol. 869, pp. 541–550. Springer, Heidelberg (1994)

    Google Scholar 

  8. Hsiang, J., Huang, G.S.: Some Fundamental Properties of Boolean Ring Normal Forms. DIMACS series on Discrete Mathematics and Computer Science, vol. 35, The Satisfiability Problem, AMS, pp. 587–602 (1997)

    Google Scholar 

  9. Marquis, P.: Knowledge compilation using theory prime implicates. In: Proc. IJCAI 1995, pp. 837–843. Morgan Kaufmann, San Mateo (1995)

    Google Scholar 

  10. Massacci, F.: Simplification: A General Constraint Propagation Technique for Propositional and Modal Tableau. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 217–232. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Mondadori, M.: Classical Analytical Deduction, part I & II. Annali dell’ Università di Ferrara, Nuova Serie, sezione III, Filosofia, Discussion Paper, n. 1 & 5, Università degli Studi di Ferrara, Italy (1988)

    Google Scholar 

  12. Murray, N.V., Rosenthal, E.: Inference with path resolution and semantic graphs. J. ACM 34(2), 225–254 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  13. Murray, N.V., Rosenthal, E.: Dissolution: Making paths vanish. J. ACM 40(3), 504–535 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Murray, N.V., Rosenthal, E.: Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Hähnle, R., Murray, N.V., Rosenthal, E.: Normal forms for knowledge compilation, Technical Report SUNYA-CS-04-06, Department of Computer Science, University at Albany - SUNY (October 2004)

    Google Scholar 

  16. Ramesh, A., Murray, N.V.: An application of non-clausal deduction in diagnosis. Expert Systems with Applications 12(1), 119–126 (1997)

    Article  MathSciNet  Google Scholar 

  17. Selman, B., Kautz, H.: Knowledge compilation and theory approximation. J. ACM 43(2), 193–224 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Chalmers University of Technology, S-41296, Gothenburg, Sweden

    Reiner Hähnle

  2. Department of Computer Science, State University of New York, Albany, NY, 12222, USA

    Neil V. Murray

  3. Department of Mathematics, University of New Haven, West Haven, CT, 06516, USA

    Erik Rosenthal

Authors
  1. Reiner Hähnle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Neil V. Murray
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erik Rosenthal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIRIS - UFR d’Informatique, Université Claude Bernard Lyon 1, 43, boulevard du 11 novembre 1918, 69622, Villeurbanne, France

    Mohand-Said Hacid

  2. Department of Computer Science, State University of New York, 12222, Albany, NY, USA

    Neil V. Murray

  3. Department of Computer Science, University of North Carolina, 28223, Charlotte, NC, USA

    Zbigniew W. Raś

  4. Shimane University, 89-1 Enya-cho Izumo, 6938501, Shimane, Japan

    Shusaku Tsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hähnle, R., Murray, N.V., Rosenthal, E. (2005). Normal Forms for Knowledge Compilation. In: Hacid, MS., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds) Foundations of Intelligent Systems. ISMIS 2005. Lecture Notes in Computer Science(), vol 3488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11425274_32

Download citation

  • DOI: https://doi.org/10.1007/11425274_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25878-0

  • Online ISBN: 978-3-540-31949-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation