InstQL: A Query Language for Virtual Institutions Using Answer Set Programming

  • Luke Hopton
  • Owen Cliffe
  • Marina De Vos
  • Julian Padget
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6214)


Institutions provide a mechanism to capture and reason about “correct” and “incorrect” behaviour within a social context. While institutions can be studied in their own right, their real potential is as instruments to govern open software architectures like multi-agent and service-oriented systems. Our domain-specific action language for normative frameworks, InstAL aims to help focus designers’ attention on the expression of issues such as permission, violation and power but does not help the designer in verifying or querying the model they have specified. In this paper we present the query language InstQL which includes a number of powerful features including temporal constraints over events and fluents that can be used in conjunction with InstAL to specify those traces that are of interest in order to investigate and reason over the underlying normative models. The semantics of the query language is provided by translating InstQL queries into AnsProlog, the same computational language as InstAL. The result is a simple, high-level query and constraint language that builds on and uses the reasoning power of ASP.


Logic Program Query Language Linear Temporal Logic Action Language Normative Framework 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Artikis, A., Sergot, M., Pitt, J.: Specifying electronic societies with the Causal Calculator. In: Giunchiglia, F., Odell, J.J., Weiss, G. (eds.) AOSE 2002. LNCS, vol. 2585, pp. 1–15. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Artikis, A., Sergot, M., Pitt, J.: Specifying norm-governed computational societies. ACM Trans. Comput. Logic 10(1), 1–42 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge Press, Cambridge (2003)Google Scholar
  4. 4.
    Calvanese, D., Vardi, M.Y.: Reasoning about actions and planning in LTL action theories. In: Proc. KR 2002 (2002)Google Scholar
  5. 5.
    Cliffe, O.: Specifying and Analysing Institutions in Multi-Agent Systems using Answer Set Programming. PhD thesis, University of Bath (2007)Google Scholar
  6. 6.
    Cliffe, O., De Vos, M., Padget, J.: Answer set programming for representing and reasoning about virtual institutions. In: Inoue, K., Satoh, K., Toni, F. (eds.) CLIMA 2006. LNCS (LNAI), vol. 4371, pp. 60–79. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Cliffe, O., De Vos, M., Padget, J.: Specifying and reasoning about multiple institutions. In: Noriega, P., Vázquez-Salceda, J., Boella, G., Boissier, O., Dignum, V., Fornara, N., Matson, E. (eds.) COIN 2006. LNCS (LNAI), vol. 4386, pp. 63–81. Springer, Heidelberg (2007)Google Scholar
  8. 8.
    Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR system dlv: Progress report, comparisons and benchmarks. In: Cohn, A.G., Schubert, L., Shapiro, S.C. (eds.) KR 1998: Principles of Knowledge Representation and Reasoning, pp. 406–417. Morgan Kaufmann, San Francisco (1998)Google Scholar
  9. 9.
    Allen Emerson, E.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 995–1072. Elsevier, Amsterdam (1990)Google Scholar
  10. 10.
    Emerson, E.A., Halpern, J.Y.: “sometimes” and “not never” revisited: on branching versus linear time temporal logic. Journal of the ACM 33(1), 151–178 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence 153, 49–104 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence 153, 49–104 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-Driven Answer Set Solving. In: Proceeding of IJCAI 2007, pp. 386–392 (2007)Google Scholar
  14. 14.
    Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–386 (1991)CrossRefzbMATHGoogle Scholar
  15. 15.
    Gelfond, M., Lifschitz, V.: Action languages. Electron. Trans. Artif. Intell. 2, 193–210 (1998)MathSciNetGoogle Scholar
  16. 16.
    Heljanko, K., Niemelä, I.: Bounded LTL model checking with stable models. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 200–212. Springer, Heidelberg (2001)Google Scholar
  17. 17.
    Hopton, L., Cliffe, O., De Vos, M., Padget, J. A.: Aql: A query language for action domains modelled using answer set programming. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 437–443. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Searle, J.R.: The Construction of Social Reality. The Penguin Press, Allen Lane (1995)Google Scholar
  19. 19.
    Kowalski, R.A., Sadri, F.: Reconciling the event calculus with the situation calculus. Journal of Logic Programming 31(1-3), 39–58 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Niemelä, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal LP. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265, pp. 420–429. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  21. 21.
    Noriega, P.: Agent mediated auctions: The Fishmarket Metaphor. PhD thesis, Universitat Autonoma de Barcelona (1997)Google Scholar
  22. 22.
    Pnueli, A.: The Temporal Logic of Programs. In: 19th Annual Symp. on Foundations of Computer Science (1977)Google Scholar
  23. 23.
    Rodríguez, J.-A., Noriega, P., Sierra, C., Padget, J.: FM 96.5 A Java-based Electronic Auction House. In: Proceedings of 2nd Conference on Practical Applications of Intelligent Agents and MultiAgent Technology (PAAM 1997), pp. 207–224 (1997) ISBN 0-9525554-6-8Google Scholar
  24. 24.
    Sergot, M.: \(\mathcal{C+}^{++}\): An action language for modelling norms and institutions. Technical Report 8, Department of Computing, Imperial College, London (2004)Google Scholar
  25. 25.
    Sistla, A.P., Clarke, E.M.: The complexity of propostional linear temporal logics. Journal of the ACM 32(3), 733–749 (1985)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Luke Hopton
    • 1
  • Owen Cliffe
    • 1
  • Marina De Vos
    • 1
  • Julian Padget
    • 1
  1. 1.Department of Computer ScienceUniversity of BathBATHUK

Personalised recommendations