50 Search Results for "Delgrande, James"

Document
Research
DOI: 10.4230/TGDK.4.1.4
Native Provenance Computation for Federated and Non-Federated SPARQL Queries

Authors: Zubaria Asma, Daniel Hernández, Luis Galárraga, Giorgos Flouris, Irini Fundulaki, and Katja Hose

Published in: TGDK, Volume 4, Issue 1 (2026). Transactions on Graph Data and Knowledge, Volume 4, Issue 1

Abstract
The popularity of knowledge graphs (KGs) owes credit to their flexible data model, which is suitable for data integration from multiple sources. Several KG-based applications, such as trust assessment, view maintenance, or data valuation on dynamic data, rely on the ability to compute provenance explanations for query results. This need becomes more urgent in federated query processing systems, which allow the online consumption of heterogeneous and decentralized Web data. However, the problem of computing and interacting with provenance has received little attention, especially in the federated setting. On those grounds, this paper introduces the NPCS (Native Provenance Computation for SPARQL) approach, and its federated variant Fed-NPCS, that compute provenance for SPARQL query results. Both approaches build upon spm-semirings to annotate the results of monotonic and non-monotonic SPARQL queries with their provenance. Due to their reliance on query rewriting techniques, the approaches are directly applicable to already deployed SPARQL engines and federations using different reification schemes, including RDF-star. Our experimental evaluation shows that our novel query rewriting approach brings significant run-time improvements w.r.t. the state-of-the-art across both centralized and federated settings. In centralized settings, our tests on two popular SPARQL engines (GraphDB and Stardog) reveal substantial runtime gains over existing query rewriting solutions, enabling scalability to RDF graphs with billions of triples. In federated settings, our experiments on the FedShop benchmark with GraphDB show the viability of Fed-NPCS for federations with up to 200 sources.
Cite as

Zubaria Asma, Daniel Hernández, Luis Galárraga, Giorgos Flouris, Irini Fundulaki, and Katja Hose. Native Provenance Computation for Federated and Non-Federated SPARQL Queries. In Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 1, pp. 4:1-4:43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@Article{asma_et_al:TGDK.4.1.4,
  author =	{Asma, Zubaria and Hern\'{a}ndez, Daniel and Gal\'{a}rraga, Luis and Flouris, Giorgos and Fundulaki, Irini and Hose, Katja},
  title =	{{Native Provenance Computation for Federated and Non-Federated SPARQL Queries}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{4:1--4:43},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.4},
  URN =		{urn:nbn:de:0030-drops-259642},
  doi =		{10.4230/TGDK.4.1.4},
  annote =	{Keywords: native provenance computation, federated SPARQL queries, data provenance, NPCS, Fed-NPCS}
}
Document
DOI: 10.4230/LIPIcs.CP.2025.15
Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets

Authors: Hannes Ihalainen, Jeremias Berg, Matti Järvisalo, and Bart Bogaerts

Published in: LIPIcs, Volume 340, 31st International Conference on Principles and Practice of Constraint Programming (CP 2025)

Abstract
We propose symmetric core learning (SCL) as a novel approach to making the implicit hitting set approach (IHS) to constraint optimization more symmetry-aware. SCL has the potential of significantly reducing the number of iterations and, in particular, the number of calls to an NP decision solver for extracting individual unsatisfiable cores. As the technique is focused on generating symmetric cores to the hitting set component of IHS, SCL is generally applicable in IHS-style search for essentially any constraint optimization paradigm. In this work, we focus in particular on integrating SCL to IHS for pseudo-Boolean optimization (PBO), as earlier proposed static symmetry breaking through lex-leader constraints generated before search turns out to often degrade the performance of the IHS approach to PBO. In contrast, we show that SCL can improve the runtime performance of a state-of-the-art IHS approach to PBO and generally does not impose significant overhead in terms of runtime performance.
Cite as

Hannes Ihalainen, Jeremias Berg, Matti Järvisalo, and Bart Bogaerts. Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets. In 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 340, pp. 15:1-15:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{ihalainen_et_al:LIPIcs.CP.2025.15,
  author =	{Ihalainen, Hannes and Berg, Jeremias and J\"{a}rvisalo, Matti and Bogaerts, Bart},
  title =	{{Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets}},
  booktitle =	{31st International Conference on Principles and Practice of Constraint Programming (CP 2025)},
  pages =	{15:1--15:26},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-380-5},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{340},
  editor =	{de la Banda, Maria Garcia},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.15},
  URN =		{urn:nbn:de:0030-drops-238767},
  doi =		{10.4230/LIPIcs.CP.2025.15},
  annote =	{Keywords: Implicit hitting sets, symmetries, unsatisfiable cores, pseudo-Boolean optimization}
}
Document
DOI: 10.4230/LIPIcs.FSCD.2025.7
Combining Generalization Algorithms in Regular Collapse-Free Theories

Authors: Mauricio Ayala-Rincón, David M. Cerna, Temur Kutsia, and Christophe Ringeissen

Published in: LIPIcs, Volume 337, 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)

Abstract
We look at the generalization problem modulo some equational theories. This problem is dual to the unification problem: given two input terms, we want to find a common term whose respective two instances are equivalent to the original terms modulo the theory. There exist algorithms for finding generalizations over various equational theories. We focus on modular construction of equational generalization algorithms for the union of signature-disjoint theories. Specifically, we consider the class of regular and collapse-free theories, showing how to combine existing generalization algorithms to produce specific solutions in these cases. Additionally, we identify a class of theories that admit a generalization algorithm based on the application of axioms to resolve the problem. To define this class, we rely on the notion of syntactic theories, a concept originally introduced to develop unification procedures similar to the one known for syntactic unification. We demonstrate that syntactic theories are also helpful in developing generalization procedures similar to those used for syntactic generalization.
Cite as

Mauricio Ayala-Rincón, David M. Cerna, Temur Kutsia, and Christophe Ringeissen. Combining Generalization Algorithms in Regular Collapse-Free Theories. In 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 337, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{ayalarincon_et_al:LIPIcs.FSCD.2025.7,
  author =	{Ayala-Rinc\'{o}n, Mauricio and Cerna, David M. and Kutsia, Temur and Ringeissen, Christophe},
  title =	{{Combining Generalization Algorithms in Regular Collapse-Free Theories}},
  booktitle =	{10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)},
  pages =	{7:1--7:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-374-4},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{337},
  editor =	{Fern\'{a}ndez, Maribel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2025.7},
  URN =		{urn:nbn:de:0030-drops-236228},
  doi =		{10.4230/LIPIcs.FSCD.2025.7},
  annote =	{Keywords: Generalization, Anti-unification, Equational theories, Combination}
}
Document
DOI: 10.4230/DagMan.10.1.1
Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Perspectives Workshop 22282)

Authors: James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski, and Frank Wolter

Published in: Dagstuhl Manifestos, Volume 10, Issue 1 (2024)

Abstract
Knowledge Representation and Reasoning is a central, longstanding, and active area of Artificial Intelligence. Over the years it has evolved significantly; more recently it has been challenged and complemented by research in areas such as machine learning and reasoning under uncertainty. In July 2022,sser a Dagstuhl Perspectives workshop was held on Knowledge Representation and Reasoning. The goal of the workshop was to describe the state of the art in the field, including its relation with other areas, its shortcomings and strengths, together with recommendations for future progress. We developed this manifesto based on the presentations, panels, working groups, and discussions that took place at the Dagstuhl Workshop. It is a declaration of our views on Knowledge Representation: its origins, goals, milestones, and current foci; its relation to other disciplines, especially to Artificial Intelligence; and on its challenges, along with key priorities for the next decade.
Cite as

James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski, and Frank Wolter. Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Perspectives Workshop 22282). In Dagstuhl Manifestos, Volume 10, Issue 1, pp. 1-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{delgrande_et_al:DagMan.10.1.1,
  author =	{Delgrande, James P. and Glimm, Birte and Meyer, Thomas and Truszczynski, Miroslaw and Wolter, Frank},
  title =	{{Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Perspectives Workshop 22282)}},
  pages =	{1--61},
  journal =	{Dagstuhl Manifestos},
  ISSN =	{2193-2433},
  year =	{2024},
  volume =	{10},
  number =	{1},
  editor =	{Delgrande, James P. and Glimm, Birte and Meyer, Thomas and Truszczynski, Miroslaw and Wolter, Frank},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagMan.10.1.1},
  URN =		{urn:nbn:de:0030-drops-201403},
  doi =		{10.4230/DagMan.10.1.1},
  annote =	{Keywords: Knowledge representation and reasoning, Applications of logics, Declarative representations, Formal logic}
}
Document
DOI: 10.4230/DagRep.12.7.62
Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Seminar 22282)

Authors: James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski, Milene Santos Teixeira, and Frank Wolter

Published in: Dagstuhl Reports, Volume 12, Issue 7 (2023)

Abstract
The area of Knowledge Representation and Reasoning (KR) is a central area in Artificial Intelligence that deals with the explicit, declarative representation of knowledge along with inference procedures for deriving further, implicit information from this knowledge. The goal of this Perspectives Seminar was to assess the area of KR, including its history, current state, and future prospects, and from this assessment to provide suggestions and recommendations for advancing the field, increasing participation in the area, and furthering links with related areas. Over the course of 5 days, 25 participants from a cross-section of subareas in KR and areas adjacent to KR met to discuss these topics. The workshop was composed of a number of invited talks and panels for reviewing the history and state of the art of KR, along with several working groups and general open discussions. In common with other Perspectives Workshops, a Manifesto will be produced; as well, recommendations contained in the manifesto will be also forwarded to the steering committee of the Principles of Knowledge Representation and Reasoning conference series for their consideration.
Cite as

James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski, Milene Santos Teixeira, and Frank Wolter. Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Seminar 22282). In Dagstuhl Reports, Volume 12, Issue 7, pp. 62-79, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{delgrande_et_al:DagRep.12.7.62,
  author =	{Delgrande, James P. and Glimm, Birte and Meyer, Thomas and Truszczynski, Miroslaw and Teixeira, Milene Santos and Wolter, Frank},
  title =	{{Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Seminar 22282)}},
  pages =	{62--79},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{7},
  editor =	{Delgrande, James P. and Glimm, Birte and Meyer, Thomas and Truszczynski, Miroslaw and Teixeira, Milene Santos and Wolter, Frank},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.7.62},
  URN =		{urn:nbn:de:0030-drops-176126},
  doi =		{10.4230/DagRep.12.7.62},
  annote =	{Keywords: applications of logics, declarative representations, formal logic, knowledge representation and reasoning}
}
Document
DOI: 10.4230/DagRep.2.10.105
Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441)

Authors: James Delgrande, Thomas Meyer, and Ulrike Sattler

Published in: Dagstuhl Reports, Volume 2, Issue 10 (2013)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12441 "Foundations and Challenges of Change and Evolution in Ontologies", held from 28 October to 2 November 2012. The aim of the workshop was to bring together researchers working in the areas of logic-based ontologies, belief change, and database systems, along with researchers working in relevant areas in nonmonotonic reasoning, commonsense reasoning, and paraconsistent reasoning. The workshop provided a forum for discussions on the application of existing work in belief change, nonmonotonic reasoning, commonsense reasoning, and databases to logic-based ontologies. Overall the intent was to provide an interdisciplinary (with respect to computer science and mathematics) workshop for addressing both theoretical and computational issues in managing change and evolution in formal ontologies.
Cite as

James Delgrande, Thomas Meyer, and Ulrike Sattler. Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441). In Dagstuhl Reports, Volume 2, Issue 10, pp. 105-116, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{delgrande_et_al:DagRep.2.10.105,
  author =	{Delgrande, James and Meyer, Thomas and Sattler, Ulrike},
  title =	{{Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441)}},
  pages =	{105--116},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Delgrande, James and Meyer, Thomas and Sattler, Ulrike},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.10.105},
  URN =		{urn:nbn:de:0030-drops-39079},
  doi =		{10.4230/DagRep.2.10.105},
  annote =	{Keywords: Artificial intelligence, Belief change, Ontologies, Description logics}
}
Document
DOI: 10.4230/DagSemProc.09351.8
Speech acts as announcements

Authors: Nadine Guiraud, Andreas Herzig, and Emiliano Lorini

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
Our aim is to use the logic of public announcements and more generally dynamic epistemic logics as a logic of speech acts. To that end we start from a simple multimodal logic of beliefs and goals (without common belief), and add public announcements. We suppose that announcements do not modify goals. We then consider several variants of speech acts of assertive and directive force and provide a modelling in terms of speech acts.
Cite as

Nadine Guiraud, Andreas Herzig, and Emiliano Lorini. Speech acts as announcements. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{guiraud_et_al:DagSemProc.09351.8,
  author =	{Guiraud, Nadine and Herzig, Andreas and Lorini, Emiliano},
  title =	{{Speech acts as announcements}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.8},
  URN =		{urn:nbn:de:0030-drops-22935},
  doi =		{10.4230/DagSemProc.09351.8},
  annote =	{Keywords: Logic of belief, logic of goals, speech act theory, dynamic epistemic logic, public announcements}
}
Document
DOI: 10.4230/DagSemProc.09351.1
09351 Abstracts Collection – Information processing, rational belief change and social interaction

Authors: Giacomo Bonanno, James Delgrande, and Hans Rott

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
From 23.08. to 27.08.2009, the Dagstuhl Seminar 09351 ``Information processing, rational belief change and social interaction '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Giacomo Bonanno, James Delgrande, and Hans Rott. 09351 Abstracts Collection – Information processing, rational belief change and social interaction. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{bonanno_et_al:DagSemProc.09351.1,
  author =	{Bonanno, Giacomo and Delgrande, James and Rott, Hans},
  title =	{{09351 Abstracts Collection – Information processing, rational belief change and social interaction}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.1},
  URN =		{urn:nbn:de:0030-drops-22343},
  doi =		{10.4230/DagSemProc.09351.1},
  annote =	{Keywords: Social software, belief revision, conditionals, social choice, game theory, contraction, update, argumentation, preference aggregation, agency, inform}
}
Document
DOI: 10.4230/DagSemProc.09351.2
09351 Executive Summary – Information processing, rational belief change and social interaction

Authors: Giacomo Bonanno, James Delgrande, and Hans Rott

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
From August 23, 2009 to August 27, 2009, the Dagstuhl Seminar 09351 "Information processing, rational belief change and social interaction" was held at the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in these Proceedings. The Executive Summary describes the seminar topics and goals in general and contains the program of the workshop. Links to extended abstracts or full papers are provided, if available.
Cite as

Giacomo Bonanno, James Delgrande, and Hans Rott. 09351 Executive Summary – Information processing, rational belief change and social interaction. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{bonanno_et_al:DagSemProc.09351.2,
  author =	{Bonanno, Giacomo and Delgrande, James and Rott, Hans},
  title =	{{09351 Executive Summary – Information processing, rational belief change and social interaction}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.2},
  URN =		{urn:nbn:de:0030-drops-22273},
  doi =		{10.4230/DagSemProc.09351.2},
  annote =	{Keywords: Social software, belief revision, conditionals, social choice, game theory, contraction, update, argumentation, preference aggregation, agency, inform}
}
Document
DOI: 10.4230/DagSemProc.09351.3
Awareness and forgetting of facts and agents

Authors: Hans Van Ditmarsch and Tim French

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
We propose various logical semantics for change of awareness. The setting is that of multiple agents that may become aware of facts or other agents, or forget about them. We model these dynamics by quantifying over propositional variables and agent variables, in a multi-agent epistemic language with awareness operators, employing a notion of bisimulation with a clause for `same awareness'. The quantification is over all different ways in which an agent can become aware (or forget). Logics for change of awareness combine well with logics for informational change, as when a public announcement simultaneously makes you aware of an issue (`a plane just crashed on Schiphol Airport').
Cite as

Hans Van Ditmarsch and Tim French. Awareness and forgetting of facts and agents. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{vanditmarsch_et_al:DagSemProc.09351.3,
  author =	{Van Ditmarsch, Hans and French, Tim},
  title =	{{Awareness and forgetting of facts and agents}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.3},
  URN =		{urn:nbn:de:0030-drops-22286},
  doi =		{10.4230/DagSemProc.09351.3},
  annote =	{Keywords: Awareness, knowledge, multi-agent systems, dynamics}
}
Document
DOI: 10.4230/DagSemProc.09351.4
Deontic Epistemic stit Logic Distinguishing Modes of `Mens Rea'

Authors: Jan M. Broersen

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
Most juridical systems contain the principle that an act is only unlaw- ful if the agent conducting the act has a `guilty mind' (`mens rea'). Dif- ferent law systems distinguish different modes of mens rea. For instance, American law distinguishes between `knowingly' performing a criminal act, `recklessness', `strict liability', etc. I will show we can formalize several of these categories. The formalism I use is a complete stit-logic featuring operators for stit-actions taking effect in `next' states, S5-knowledge op- erators and SDL-type obligation operators. The different modes of `mens rea' correspond to the violation conditions of different types of obligation definable in the logic.
Cite as

Jan M. Broersen. Deontic Epistemic stit Logic Distinguishing Modes of `Mens Rea'. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{broersen:DagSemProc.09351.4,
  author =	{Broersen, Jan M.},
  title =	{{Deontic Epistemic stit Logic Distinguishing Modes of `Mens Rea'}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--22},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.4},
  URN =		{urn:nbn:de:0030-drops-22296},
  doi =		{10.4230/DagSemProc.09351.4},
  annote =	{Keywords: Product update, agency, stit theory, knowingly doing}
}
Document
DOI: 10.4230/DagSemProc.09351.5
Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences all together

Authors: Emiliano Lorini, François Schwarzentruber, and Andreas Herzig

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and enabling to reason about epistemic games in strategic form. We provide complexity results for EDLA. In the second part of the paper, we study in EDLA the epistemic and rationality conditions of some classical solution concepts like Nash equilibrium and Iterated Deletion of Strictly Dominated Strategies (IDSDS). In the last part of the paper we combine EDLA with Dynamic Epistemic Logic (DEL) in order to model epistemic game dynamics.
Cite as

Emiliano Lorini, François Schwarzentruber, and Andreas Herzig. Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences all together. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{lorini_et_al:DagSemProc.09351.5,
  author =	{Lorini, Emiliano and Schwarzentruber, Fran\c{c}ois and Herzig, Andreas},
  title =	{{Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences all together}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.5},
  URN =		{urn:nbn:de:0030-drops-22313},
  doi =		{10.4230/DagSemProc.09351.5},
  annote =	{Keywords: Modal logic, game theory, epistemic games}
}
Document
DOI: 10.4230/DagSemProc.09351.6
Interpreting Product Update as Reasoning about Observations and Meta-Observations

Authors: Jan M. Broersen

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
In this brief note, I would like to suggest that it makes sense to reinterpret product update, as introduced by Baltag, Moss and Solecki, as a system to account for observations and metaobservations, where a meta-observation is an observation of an observation. Under this interpretation we also take products of action models with meta-action models. I deliberate on some possible consequences of this extension to the interpretation of product update.
Cite as

Jan M. Broersen. Interpreting Product Update as Reasoning about Observations and Meta-Observations. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{broersen:DagSemProc.09351.6,
  author =	{Broersen, Jan M.},
  title =	{{Interpreting Product Update as Reasoning about Observations and Meta-Observations}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.6},
  URN =		{urn:nbn:de:0030-drops-22333},
  doi =		{10.4230/DagSemProc.09351.6},
  annote =	{Keywords: Product update, agency, stit theory, knowingly doing}
}
Document
DOI: 10.4230/DagSemProc.09351.7
Revealed preference, iterated belief revision and dynamic games

Authors: Giacomo Bonanno

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
In previous work (G. Bonanno, Rational choice and AGM belief revision, Artificial Intelligence, 2009) a semantics for AGM belief revision was proposed based on choice frames, borrowed from the rational choice literature. In this paper we discuss how to use choice frames to analyze extensive-form games. Given an extensive form with perfect recall, a choice frame can be used to represent a player's initial beliefs and her disposition to change those beliefs when she is informed that it is her turn to move. When some players move more than once along some play of the game, the issue of iterated belief revision arises. We provide a semantics for iterated belief revision in terms of choice frames and provide an outline of how to use choice frames to analyze solution concepts for extensive-form games.
Cite as

Giacomo Bonanno. Revealed preference, iterated belief revision and dynamic games. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{bonanno:DagSemProc.09351.7,
  author =	{Bonanno, Giacomo},
  title =	{{Revealed preference, iterated belief revision and dynamic games}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.7},
  URN =		{urn:nbn:de:0030-drops-22326},
  doi =		{10.4230/DagSemProc.09351.7},
  annote =	{Keywords: Choice function, AGM belief revision, extensive-form game, iterated belief revision}
}
Document
DOI: 10.4230/DagSemProc.09351.9
Systematic judgment aggregators: An algebraic connection between social and logical structure

Authors: Daniel Eckert and Frederik Herzberg

Published in: Dagstuhl Seminar Proceedings, Volume 9351, Information processing, rational belief change and social interaction (2009)

Abstract
We present several results that show that systematic (complete) judgment aggregators can be viewed as both (2-valued) Boolean homomorphisms and as syntatic versions of reduced (ultra)products. Thereby, Arrovian judgment aggregators link the Boolean algebraic structures of (i) the set of coalitions (ii) the agenda, and (iii) the set of truth values of collective judgments. Since filters arise naturally in the context of Boolean algebras, these findings provide an explanation for the extraordinary effectiveness of the filter method in abstract aggregation theory.
Cite as

Daniel Eckert and Frederik Herzberg. Systematic judgment aggregators: An algebraic connection between social and logical structure. In Information processing, rational belief change and social interaction. Dagstuhl Seminar Proceedings, Volume 9351, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{eckert_et_al:DagSemProc.09351.9,
  author =	{Eckert, Daniel and Herzberg, Frederik},
  title =	{{Systematic judgment aggregators: An algebraic connection between social and logical structure}},
  booktitle =	{Information processing, rational belief change and social interaction},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9351},
  editor =	{Giacomo Bonanno and James Delgrande and Hans Rott},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09351.9},
  URN =		{urn:nbn:de:0030-drops-22302},
  doi =		{10.4230/DagSemProc.09351.9},
  annote =	{Keywords: Judgment aggregation; social structure; Boolean homorphism; ultraproduct}
}
  • Refine by Type
  • 50 Document/PDF
  • 3 Document/HTML

  • Refine by Publication Year
  • 1 2026
  • 2 2025
  • 1 2024
  • 1 2023
  • 1 2013
  • Show More...

  • Refine by Author
  • 9 Delgrande, James
  • 8 Bonanno, Giacomo
  • 8 Rott, Hans
  • 6 Lang, Jérôme
  • 4 Herzig, Andreas
  • Show More...

  • Refine by Series/Journal
  • 2 LIPIcs
  • 1 TGDK
  • 1 DagMan
  • 2 DagRep
  • 44 DagSemProc

  • Refine by Classification
  • 2 Computing methodologies → Knowledge representation and reasoning
  • 2 Theory of computation → Complexity theory and logic
  • 1 Computing methodologies → Artificial intelligence
  • 1 Computing methodologies → Symbolic and algebraic manipulation
  • 1 Information systems → Data provenance
  • Show More...

  • Refine by Keyword
  • 11 Belief revision
  • 6 Belief change
  • 6 conditionals
  • 6 iterated belief revision
  • 6 social choice
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact