Skip to main content
SpringerLink
Log in

On the Violation of Circuits in Decomposable Negation Normal Form

  • Conference paper
Book cover AI 2012: Advances in Artificial Intelligence (AI 2012)

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

Included in the following conference series:

  • 3402 Accesses

Abstract

Local Search approaches to constraint satisfaction are based on the ability to compute violation scores. These estimate ’how far’ a given assignment is from satisfying the constraints, and aim at guiding the search towards assignments whose violation will, ultimately, be null. We study the computation of violation functions for Boolean predicates encoded in Decomposable Negation Normal Form, an important class of logical circuits that encode interesting constraints. We show that for these circuits an elegant and efficient violation function first proposed by Z. Stachniak is ”ideal” in a certain sense. We discuss more broadly the notion of ”ideal” violation and discuss the implications of this result.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ågren, M., Flener, P., Pearson, J.: Revisiting constraint-directed search. Information and Computation 207(3), 438–457 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Belov, A., Stachniak, Z.: Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 258–264. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Belov, A., Stachniak, Z.: Improved Local Search for Circuit Satisfiability. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 293–299. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

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

    Google Scholar 

  5. Darwiche, A., Marquis, P.: A knowledge compilation map. J. of Artif. Intel. Research (JAIR) 17, 229–264 (2002)

    MathSciNet  MATH  Google Scholar 

  6. He, J., Flener, P., Pearson, J.: Toward an automaton constraint for local search. In: Workshop on LS Techniques for Constraint Satisfaction, pp. 13–25 (2009)

    Google Scholar 

  7. Järvisalo, M., Junttila, T.A., Niemelä, I.: Justification-Based Local Search with Adaptive Noise Strategies. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 31–46. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Järvisalo, M., Junttila, T.A., Niemelä, I.: Justification-based non-clausal local search for SAT. In: Euro. Conf. on Artif. Intel. (ECAI), pp. 535–539 (2008)

    Google Scholar 

  9. Johnson, D.S.: The NP-completeness column: Finding needles in haystacks. ACM Trans. on Algorithms (TALG) 3(2) (2004)

    Google Scholar 

  10. Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. of Computer and System Sciences 37(1), 79–100 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jung, J.-C., Barahona, P., Katsirelos, G., Walsh, T.: Two encodings of DNNF theories. In: ECAI Workshop on Inference Methods Based on Graphical Structures of Knowledge (2008)

    Google Scholar 

  12. Katsirelos, G., Narodytska, N., Walsh, T.: The weighted grammar constraint. Annals of Operations Research (2010) (to appear)

    Google Scholar 

  13. Muhammad, R., Stuckey, P.J.: A Stochastic Non-CNF SAT Solver. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 120–129. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Pham, D.N., Thornton, J., Sattar, A.: Building structure into local search for SAT. In: Int. Joint. Conf. on Artif. Intel. (IJCAI), pp. 2359–2364 (2007)

    Google Scholar 

  15. Pham, D.N., Thornton, J., Sattar, A.: Efficiently exploiting dependencies in local search for sat. In: AAAI Conf. on Artif. Intel. (AAAI), pp. 1476–1478 (2008)

    Google Scholar 

  16. Quimper, C.-G., Walsh, T.: Decomposing Global Grammar Constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 590–604. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Stachniak, Z.: Going non-clausal. In: Conf. on Theory and Applications of Satisfiability Testing (SAT), pp. 316–322 (2002)

    Google Scholar 

  18. Stachniak, Z., Belov, A.: Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 257–270. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press (2005)

    Google Scholar 

  20. van Hoeve, W.-J.: Over-constrained problems. In: Hybrid optimization: the 10 Years of CPAIOR, ch. 6 (2010) (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research Cambridge, UK

    Lucas Bordeaux

  2. NICTA and University of NSW, Sydney, Australia

    Nina Narodytska

Authors
  1. Lucas Bordeaux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nina Narodytska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, University of New South Wales, 2052, Sydney, NSW, Australia

    Michael Thielscher

  2. School of Computing and Mathematics, University of Western Sydney, 1797, Penrith South DC, NSW, Australia

    Dongmo Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bordeaux, L., Narodytska, N. (2012). On the Violation of Circuits in Decomposable Negation Normal Form. In: Thielscher, M., Zhang, D. (eds) AI 2012: Advances in Artificial Intelligence. AI 2012. Lecture Notes in Computer Science(), vol 7691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35101-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35101-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35100-6

  • Online ISBN: 978-3-642-35101-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation