Skip to main content
SpringerLink
Log in

Efficient Satisfiability Verification for Conditional Importance Networks

  • Conference paper
  • First Online:
Algorithmic Decision Theory (ADT 2017)

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

Included in the following conference series:

  • 843 Accesses

Abstract

Conditional importance networks (CI-nets) provide a formal framework for modeling and reasoning with qualitative preferences over sets of many variables. Existing approaches for verifying the satisfiability of a CI-net operate on a complete model of the CI-net’s semantics, but the time required to construct this model limits the practical usefulness of CI-nets. We present an algorithm that decides a CI-net’s satisfiability by analyzing a sufficient partial model of its semantics, and we show how to efficiently construct such a model. Our method significantly reduces the average time needed to verify the satisfiability of CI-nets.

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 EPUB and 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

References

  1. Bouveret, S., Endriss, U., Lang, J.: Conditional importance networks: a graphical language for representing ordinal, monotonic preferences over sets of goods. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, Pasadena, California, USA, 11–17 July 2009, pp. 67–72 (2009). http://ijcai.org/papers09/Papers/IJCAI09-022.pdf

  2. Cornelio, C., Loreggia, A., Saraswat, V.A.: Logical conditional preference theories. CoRR abs/1504.06374 (2015). http://arxiv.org/abs/1504.06374

  3. Goldsmith, J., Lang, J., Truszczynski, M., Wilson, N.: The computational complexity of dominance and consistency in CP-nets. JAIR 33, 403–432 (2008)

    Article  MathSciNet  Google Scholar 

  4. Santhanam, G.R., Basu, S., Honavar, V.: Dominance testing via model checking. In: Fox, M., Poole, D. (eds.) Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, 11–15 July 2010. AAAI Press (2010). http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1844

Download references

Author information

Authors and Affiliations

  1. University of Wisconsin-Whitewater, 800 West Main Street, Whitewater, WI, 53190, USA

    Zachary J. Oster

Authors
  1. Zachary J. Oster
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zachary J. Oster .

Editor information

Editors and Affiliations

  1. Heinrich Heine University, Düsseldorf, Germany

    Jörg Rothe

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Oster, Z.J. (2017). Efficient Satisfiability Verification for Conditional Importance Networks. In: Rothe, J. (eds) Algorithmic Decision Theory. ADT 2017. Lecture Notes in Computer Science(), vol 10576. Springer, Cham. https://doi.org/10.1007/978-3-319-67504-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67504-6_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67503-9

  • Online ISBN: 978-3-319-67504-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation