Skip to main content

Qualitative Constraint Enforcement in Advanced Policy Specification

  • Conference paper

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

Abstract

We consider advanced policy description specifications in the context of Answer Set Programming (ASP). Motivated by our application scenario, we further extend an existing policy description language, so that it allows for expressing preferences among sets of objects. This is done by extending the concept of ordered disjunctions to cardinality constraints. We demonstrate that this extension is obtained by combining existing ASP techniques and show how it allows for handling advanced policy description specifications.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chomicki, J., Lobo, J., Naqvi, S.: Conflict resolution using logic programming. IEEE Transactions on Knowledge and Data Engineering 15(1), 244–249 (2003)

    Article  Google Scholar 

  2. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Mileo, A.: Preference Specification and Enforcement in Declarative Policies. PhD thesis, Universitá degli Studi di Milano (2006)

    Google Scholar 

  4. Bertino, E., Mileo, A., Provetti, A.: PDL with preferences. In: Proc. of POLICY 2005 (2005)

    Google Scholar 

  5. Brewka, G.: Logic programming with ordered disjunction. In: Proc. of AAAI 2002. Extended version presented at NMR 2002 (2002)

    Google Scholar 

  6. Brewka, G., Niemelä, I., Syrjänen, T.: Implementing ordered disjunction using answer set solvers for normal programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 444–455. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Sakama, C., Inoue, K.: An alternative approach to the semantics of disjunctive logic programs and deductive databases. J. Autom. Reasoning 13(1), 145–172 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics 138(1-2), 181–234 (2002)

    Google Scholar 

  9. Liu, L., Truszczynski, M.: Properties of programs with monotone and convex constraints. In: Proc. of AAAI 2005, pp. 701–706 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mileo, A., Schaub, T. (2007). Qualitative Constraint Enforcement in Advanced Policy Specification. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75256-1_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75255-4

  • Online ISBN: 978-3-540-75256-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics