Abstract
In the context of Network management, Chomicki, Lobo and Naqvi have defined the specification language PDL (Policy Description Language) and later extended it by introducing monitors: constraints on the actions that the network manager cannot execute simultaneously.
We argue that PDL with monitors is an appealing language that can be applied to specification and implementation of intelligent systems beyond network management. To do so, we discuss two extensions of it. In the first extension monitors are defined as computing a maximum set of actions compatible with the constraints, rather than a maximal one. The inevitably higher computational complexity of this extension is assessed. In the second extension, negative events, a device already introduced by Chomicki et al., are treated as equivalent to regular events, thus allowing more intuitive results from monitor application.
This work was partially funded by the Information Society Technologies programme of the European Commission, Future and Emerging Technologies under the IST-2001-33058 PANDA and IST-2001-37004 WASP projects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chomicki, J., Lobo, J., Naqvi, S.: A logic programming approach to conflict resolution in policy management. In: Proc. of KR 2000, 7th Int’l Conference on Principles of Knowledge Representation and Reasoning, pp. 121–132. Morgan Kaufmann, San Francisco (2000)
Chomicki, J., Lobo, J.: Monitors for history-based policies. In: Sloman, M., Lobo, J., Lupu, E.C. (eds.) POLICY 2001. LNCS, vol. 1995, pp. 57–72. Springer, Heidelberg (2001)
Chomicki, J., Lobo, J., Naqvi, S.: Conflict Resolution using Logic Programming. To appear on IEEE Transactions on Knowledge and Data Engineering (TKDE) 15(1), 244–249 (2003), Available from http://www.cs.buffalo.edu/~chomicki/
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing, 365–387 (1991)
Liberatore, P.: Algorithms and Experiments on Finding Minimal Models. Tech. Report 09–99, DIS, University of Rome “La Sapienza.” (1999)
Lobo, J., Bhatia, R., Naqvi, S.: A Policy Description Language. In: AAAI/IAAI, pp. 291–298 (1999)
Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading (1994)
Schlipf, J.: The expressive powers of the logic programming semantics. Journal of Computer and Systems Sciences 51, 64–86 (1995)
Web location of the most known ASP solvers, aspps: http://www.cs.uky.edu/ai/aspps/ , CCalc: http://www.cs.utexas.edu/users/tag/cc/ , Cmodels: http://www.cs.utexas.edu/users/tag/cmodels.html , DLV: http://www.dbai.tuwien.ac.at/proj/dlv/ , NoMoRe: http://www.cs.uni-potsdam.de/linke/nomore/ , SMODELS: http://www.tcs.hut.fi/Software/smodels/
Virmani, J., Lobo, L., Kohli, M.: NETMON: Network Management for the SARAS Softswitch. In: Proc. of IEEE/IFIP Network Operations and Management Symp. (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertino, E., Mileo, A., Provetti, A. (2003). PDL with Maximum Consistency Monitors. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds) Foundations of Intelligent Systems. ISMIS 2003. Lecture Notes in Computer Science(), vol 2871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39592-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-39592-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20256-1
Online ISBN: 978-3-540-39592-8
eBook Packages: Springer Book Archive