<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T23:57:48Z</responseDate>
  <request identifier="921" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:921</identifier>
        <datestamp>2024-03-06T11:07:26Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>On the Logic of Normative Systems</dc:title>
          <dc:creator>Ågotnes, Thomas</dc:creator>
          <dc:creator>van der Hoek, Wiebe</dc:creator>
          <dc:creator>Rodriguez-Aguilar, Juan A.</dc:creator>
          <dc:creator>Sierra, Carles</dc:creator>
          <dc:creator>Wooldridge, Michael</dc:creator>
          <dc:subject>Normative systems</dc:subject>
          <dc:subject>normative temporal logic</dc:subject>
          <dc:subject>deontic logic</dc:subject>
          <dc:description>We introduce emph{Normative Temporal Logic} (acro{ntl}), a logic for&#13;
reasoning about normative systems. acro{ntl} is a generalisation of&#13;
the well-known branching-time temporal logic acro{ctl}, in which the&#13;
path quantifiers $Apath$ (``on all pathsldots'') and $Epath$ (``on&#13;
some pathldots'') are replaced by the indexed deontic operators&#13;
$O{&#13;
s}$ and $P{&#13;
s}$, where for example $O{&#13;
s}phi$ means&#13;
``$phi$ is obligatory in the context of normative system $&#13;
s$''.&#13;
After defining the logic, we give a sound and complete axiomatisation,&#13;
and discuss the logic's relationship to standard deontic logics.  We&#13;
present a symbolic representation language for models and normative&#13;
systems, and identify four different model checking problems,&#13;
corresponding to whether or not a model is represented symbolically or&#13;
explicitly, and whether or not we are given an interpretation for the&#13;
normative systems named in formulae to be checked. We show that the&#13;
complexity of model checking varies from acro{p}-complete up to&#13;
acro{exptime}-hard for these variations.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Thomas Ågotnes and Wiebe van der Hoek and Juan A. Rodriguez-Aguilar and Carles Sierra and Michael Wooldridge</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7122, Normative Multi-agent Systems (2007)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.07122.24</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-9210</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07122.24</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
