default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLouwe B. Kuijer
Person information
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Rustam Galimullin, Louwe B. Kuijer:
Varieties of Distributed Knowledge. AiML 2024: 379-400- [c17]Rustam Galimullin, Louwe B. Kuijer:
Synthesizing Social Laws with ATL Conditions. AAMAS 2024: 2270-2272 - 2023
- [j11]Hans van Ditmarsch, Mo Liu, Louwe B. Kuijer, Igor Sedlár:
Almost APAL. J. Log. Comput. 33(6): 1350-1378 (2023) - [c16]Hans van Ditmarsch, Louwe B. Kuijer, Mo Liu:
An Arrow-Based Dynamic Logic of Normative Systems and Its Decidability. LORI 2023: 63-76 - [c15]Philippe Balbiani, Wiebe van der Hoek
, Louwe B. Kuijer:
Simple Axioms for Local Properties. TARK 2023: 82-92 - [c14]Rustam Galimullin, Louwe B. Kuijer:
Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ11-hard. TARK 2023: 260-271 - [i5]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. CoRR abs/2303.16699 (2023) - 2022
- [j10]Davide Grossi, Wiebe van der Hoek, Louwe B. Kuijer:
Reasoning about general preference relations. Artif. Intell. 313: 103793 (2022) - [j9]Wiebe van der Hoek, Louwe B. Kuijer, Yì N. Wáng:
Who Should Be My Friends? Social Balance from the Perspective of Game Theory. J. Log. Lang. Inf. 31(2): 189-211 (2022) - 2021
- [c13]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. MFCS 2021: 47:1-47:19 - [i4]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. CoRR abs/2105.04176 (2021) - 2020
- [j8]Hans van Ditmarsch, Wiebe van der Hoek, Louwe B. Kuijer:
The logic of gossiping. Artif. Intell. 286: 103306 (2020) - [j7]Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer:
Arrow update synthesis. Inf. Comput. 275: 104544 (2020) - [c12]Hans van Ditmarsch, Mo Liu, Louwe B. Kuijer, Igor Sedlár:
Expressivity of Some Versions of APAL. DaLí 2020: 120-136 - [c11]Wiebe van der Hoek, Louwe B. Kuijer, Yì N. Wáng:
Logics of Allies and Enemies: A Formal Approach to the Dynamics of Social Balance Theory. IJCAI 2020: 210-216 - [c10]Davide Grossi, Wiebe van der Hoek, Louwe B. Kuijer:
Logics of Preference when There Is No Best. KR 2020: 455-464
2010 – 2019
- 2019
- [j6]Hans van Ditmarsch, Malvin Gattinger, Louwe B. Kuijer, Pere Pardo:
Strengthening Gossip Protocols using Protocol-Dependent Knowledge. FLAP 6(1): 157-203 (2019) - [c9]Wiebe van der Hoek, Louwe B. Kuijer, Yì N. Wáng:
Who Should Be My Friends? - Social Balance from the Perspective of Game Theory. LORI 2019: 370-384 - [c8]Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer:
Reachability of Five Gossip Protocols. RP 2019: 218-231 - [c7]Hans van Ditmarsch, Louwe B. Kuijer:
Knowledge Without Complete Certainty. WoLLIC 2019: 619-632 - [i3]Hans van Ditmarsch, Malvin Gattinger, Louwe B. Kuijer, Pere Pardo:
Strengthening Gossip Protocols using Protocol-Dependent Knowledge. CoRR abs/1907.12321 (2019) - 2018
- [j5]Francesco Belardinelli, Wiebe van der Hoek, Louwe B. Kuijer:
Second-order propositional modal logic: Expressiveness and completeness results. Artif. Intell. 263: 3-45 (2018) - [i2]Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer:
Arrow Update Synthesis. CoRR abs/1802.00914 (2018) - 2017
- [j4]Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer:
Arbitrary arrow update logic. Artif. Intell. 242: 80-106 (2017) - [j3]Hans van Ditmarsch, Wiebe van der Hoek, Louwe B. Kuijer:
The undecidability of arbitrary arrow update logic. Theor. Comput. Sci. 693: 1-12 (2017) - [c6]Louwe B. Kuijer:
Arbitrary Arrow Update Logic with Common Knowledge is neither RE nor co-RE. TARK 2017: 373-381 - 2016
- [c5]Hans van Ditmarsch, Wiebe van der Hoek, Louwe B. Kuijer:
Fully Arbitrary Public Announcements. Advances in Modal Logic 2016: 252-267 - [c4]Valentin Goranko, Louwe B. Kuijer:
On the Length and Depth of Temporal Formulae Distinguishing Non-bisimilar Transition Systems. TIME 2016: 177-185 - [i1]Hans van Ditmarsch, Wiebe van der Hoek, Louwe B. Kuijer:
The Undecidability of Arbitrary Arrow Update Logic. CoRR abs/1609.05686 (2016) - 2015
- [j2]Louwe B. Kuijer:
The expressivity of update logics. J. Log. Comput. 25(3): 719-742 (2015) - 2014
- [j1]Louwe B. Kuijer:
The Expressivity of Factual Change in Dynamic Epistemic Logic. Rev. Symb. Log. 7(2): 208-221 (2014) - 2013
- [c3]Louwe Bouke Kuijer:
How Arbitrary Are Arbitrary Public Announcements? ESSLLI Student Sessions 2013: 109-123 - [c2]Louwe B. Kuijer:
Sequent Systems for Nondeterministic Propositional Logics without Reflexivity. LORI 2013: 190-203 - 2012
- [c1]Louwe B. Kuijer:
Sanction Semantics and Contrary-to-Duty Obligations. DEON 2012: 76-90
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
