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

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.

[1]  Marina De Vos,et al.  Specifying and Reasoning About Multiple Institutions , 2006, COIN@AAMAS/ECAI.

[2]  J. Searle.  The Construction of Social Reality , 1997 .

[3]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[4]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2003, Theory Pract. Log. Program..

[5]  Marina De Vos,et al.  Answer Set Programming for Representing and Reasoning About Virtual Institutions , 2006, CLIMA.

[6]  Pablo Cayetano Noriega Blanco-Vigil.  Agent mediated auctions: the fishmarket metaphor , 1998 .

[7]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[8]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[9]  Fausto Giunchiglia,et al.  Agent-Oriented Software Engineering III , 2003, Lecture Notes in Computer Science.

[10]  Pablo Noriega,et al.  FM96.5 A Java-based Electronic Auction House , 1997, PAAM.

[11]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[12]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[13]  Marina De Vos,et al.  AQL: A Query Language for Action Domains Modelled Using Answer Set Programming , 2009, LPNMR.

[14]  Robert A. Kowalski,et al.  Reconciling the Event Calculus With the Situation Calculus , 1997, J. Log. Program..

[15]  Alexander Artikis,et al.  Specifying norm-governed computational societies , 2009, TOCL.

[16]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[17]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[18]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[19]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[20]  Diego Calvanese,et al.  Reasoning about Actions and Planning in LTL Action Theories , 2002, KR.

[21]  Owen Cliffe,et al.  Specifying and Analyzing Institutions in Multi-Agent Systems using Answer Set Programming , 2009, The Knowledge Engineering Review.

[22]  Alexander Artikis,et al.  Specifying Electronic Societies with the Causal Calculator , 2002, AOSE.

[23]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.