Learn More
  • Marina De Vos, Gizem Doğa, Johannes Kisa, Jörg Oetsch, Hans Pührer, Tompits +7 others
  • 2012
While past research in answer-set programming (ASP) mainly focused on theory, ASP solver technology, and applications, the present work situates itself in the context of a quite recent research trend: development support for ASP. In particular, we propose to augment answer-set programs with additional meta-information formulated in a dedicated annotation(More)
It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in other safety-critical scenarios, it is possible to prove that particular properties do or do not hold for all possible encounters. In contrast to symbolic model-checking, answer set(More)
Norms guide multi-agent systems away from being potentially an-archic towards a coordinated and collaborative society. Institutions provide an explicit, external representation of norms as well as the means to detect violations and other conditions. Each institution can be crafted individually to capture their designers' goals, but this creates a challenge(More)
This paper discusses the background, algorithms and implementation techniques to support programmers in 'debugging' logic programs under the answer set semantics. We first investigate what constitutes an error in such programs and which classes of errors exist. This is used to motivate techniques and algorithms that respectively eliminate certain classes of(More)
Correctly specifying the behaviour of normative systems such as contracts and institutions is a troublesome problem. Designers are faced with two concurrent, difficult tasks: firstly specifying the relationships (over time) of agents' actions and their effects, and secondly combining this model with another that captures the agents' permissions and(More)
In this paper we discuss the use of the Answer Set Programming paradigm for representing and analysing specifications of agent-based institutions. We outline the features of institutions we model, and describe how they are translated into ASP programs which can then be used to verify properties of the specifications. We demonstrate the effectiveness of this(More)
This version is made available in accordance with publisher policies. Please cite only the published version using the reference above. Abstract. The composition of most styles of music is governed by rules. The natural statement of these rules is declarative (" The highest and lowest notes in a piece must be separated by a consonant interval ") and non(More)
Over the last ten years Answer Set Programming (ASP) has grown from a pure theoretical knowledge representation and reasoning formalism to a computational approach with a very strong formal backing. At present, ASP is seen as the computational embodiment of non-monotonic reasoning incorporating techniques of databases, knowledge representation, logic and(More)