pith. sign in

arxiv: 1907.09124 · v1 · pith:NNEBEWVPnew · submitted 2019-07-22 · 💻 cs.LO

An Algebraic Approach for Action Based Default Reasoning

Pablo F. Castro , Valentin Cassano , Raul Fervari , Carlos Areces This is my paper

Pith reviewed 2026-05-24 17:57 UTC · model grok-4.3

classification 💻 cs.LO
keywords default reasoningdeontic logicaction logicBoolean algebraalgebraic semanticscompletenessnormative reasoningSegerberg logic
0
0 comments X

The pith

Default reasoning about actions extends Segerberg's deontic action logic via Boolean algebra tools while preserving algebraic completeness.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a formalism that adds default reasoning to a deontic logic focused on actions, allowing conclusions such as an action being permitted when not explicitly forbidden. This addresses scenarios with incomplete norms, such as those faced by autonomous computing systems. The work builds directly on Segerberg's deontic action logic and adapts Boolean algebra techniques to handle defaults. A reader would care because the result supplies a sound algebraic foundation for normative reasoning about actions rather than propositions alone.

Core claim

We propose a logical formalism for default reasoning over a deontic action logic. The novelty is that the formalism deals with actions and action operators based on Segerberg's original deontic action logic, and that Boolean algebra tools extend Segerberg's algebraic completeness result to the setting of Default Logics.

What carries the argument

Boolean algebra tools that lift Segerberg's algebraic semantics and completeness proof to a default extension over actions.

If this is right

  • The formalism supports formal reasoning about assumptions such as permission by default in incomplete normative systems.
  • Algebraic completeness carries over from the base deontic action logic to its default extension.
  • Decisions in autonomous systems can be modeled using default operators on actions rather than only on propositions.
  • The approach distinguishes permitted and forbidden actions through default mechanisms grounded in Boolean structure.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same Boolean algebra lifting technique might apply to other modal action logics beyond Segerberg's base system.
  • Implementation in automated reasoners could allow checking consistency of default normative specifications for robotic agents.
  • Connections to existing work on algebraic semantics for dynamic logics could yield hybrid systems for planning under norms.

Load-bearing premise

Segerberg's algebraic semantics and completeness techniques for deontic action logic can be lifted to defaults without breaking the Boolean algebra structure or introducing inconsistencies.

What would settle it

An explicit default rule over actions in the extended logic whose algebraic interpretation violates Boolean algebra axioms or whose completeness proof fails.

Figures

Figures reproduced from arXiv: 1907.09124 by Carlos Areces, Pablo F. Castro, Raul Fervari, Valentin Cassano.

Figure 1
Figure 1. Figure 1: Algebraic Extension (P,F) of Φ under ∆ Intuitively, on the algebraic side, ideals play the role that deductively closed sets of formulas play in Reiter’s notion of extension (c.f., Def. 2.9). We bring attention to an important characteristic of the definition of an algebraic extension. Algebraic extensions are ideals in a deontic action algebra. This has the following implication. In contrast to standard d… view at source ↗
Figure 2
Figure 2. Figure 2: Algebraic Extension (P,F) of Φ under ∆ Suppose that, to the scenario above, we add the fact that it is not permitted to overtake, formalized as ¬P(o), e.g., because the road is under construction. Let Φ0 = Φ∪ {¬P(o)}; we have that LΦ0 = LΦ, i.e., the Lindenbaum-Tarski algebra of Φ0 and Φ coincide. Turning to permitted and forbidden ideals, we [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
read the original abstract

Often, we assume that an action is permitted simply because it is not explicitly forbidden; or, similarly, that an action is forbidden simply because it is not explicitly permitted. This kind of assumptions appear, e.g., in autonomous computing systems where decisions must be taken in the presence of an incomplete set of norms regulating a particular scenario. Combining default and deontic reasoning over actions allows us to formally reason about such assumptions. With this in mind, we propose a logical formalism for default reasoning over a deontic action logic. The novelty of our approach is twofold. First, our formalism for default reasoning deals with actions and action operators, and it is based on the deontic action logic originally proposed by Segerberg. Second, inspired by Segerberg's approach, we use tools coming from the theory of Boolean Algebra. These tools allow us to extend Segerberg's algebraic completeness result to the setting of Default Logics.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper proposes a logical formalism for default reasoning over Segerberg's deontic action logic. It uses tools from Boolean algebra to extend Segerberg's algebraic completeness result to the setting of default logics, with the goal of handling assumptions about permitted or forbidden actions in the presence of incomplete norms, such as in autonomous computing systems.

Significance. If the algebraic construction and completeness proof hold, the work would supply a Boolean-algebra semantics for default extensions of deontic action logic, furnishing a parameter-free algebraic completeness result that builds directly on Segerberg's prior framework. This could support formal verification of default deontic reasoning over actions.

major comments (1)
  1. The abstract asserts an extension of Segerberg's algebraic completeness to default logics but supplies neither a definition of the default operator nor a sketch of the construction that preserves the Boolean algebra structure; without these details the central claim cannot be verified from the provided text.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive comment. We address it point-by-point below and agree that a revision is warranted to improve verifiability of the central claim.

read point-by-point responses

  1. Referee: The abstract asserts an extension of Segerberg's algebraic completeness to default logics but supplies neither a definition of the default operator nor a sketch of the construction that preserves the Boolean algebra structure; without these details the central claim cannot be verified from the provided text.

    Authors: We agree that the abstract is too concise to include the formal definition of the default operator or a sketch of the Boolean-algebra construction. These elements are developed in the body of the manuscript (the default operator is introduced in Section 3 and the algebraic extension that preserves Segerberg's completeness result is constructed in Sections 4–5). To make the central claim verifiable already from the abstract, we will revise the abstract to incorporate a brief definition of the default operator together with a high-level outline of the algebraic construction. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper's derivation extends Segerberg's external deontic action logic and algebraic completeness result to a default setting via Boolean algebra tools. No step reduces by construction to a self-definition, fitted input renamed as prediction, or load-bearing self-citation chain; the cited foundation is independent prior work by a different author, and the extension construction is presented as a lifting that preserves the original structure without internal circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review; cannot enumerate concrete free parameters, axioms, or invented entities without the full definitions, semantics, and proof. The work rests on Segerberg's existing deontic action logic as background.

axioms (1)
  • domain assumption Segerberg's deontic action logic axioms and algebraic semantics
    The paper states it builds directly on this prior logic and extends its completeness result.

pith-pipeline@v0.9.0 · 5690 in / 1168 out tokens · 23698 ms · 2026-05-24T17:57:00.010214+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Antoniou (1997): Nonmonotonic Reasoning

    G. Antoniou (1997): Nonmonotonic Reasoning. Artificial Intelligence, The MIT Press

    work page 1997

  2. [2]

    Antoniou & K

    G. Antoniou & K. Wang (2007): Default Logic . In D. Gabbay & J. Woods, editors: The Many Val- ued and Nonmonotonic Turn in Logic , Handbook of the History of Logic 8, North-Holland, pp. 517–555, doi:10.1016/S1874-5857(07)80011-2

    work page doi:10.1016/s1874-5857(07)80011-2 2007

  3. [3]

    Åqvist (2007): Deontic Logic

    L. Åqvist (2007): Deontic Logic. In D. Gabbay & F. Guenthner, editors: Handbook of Philosophical Logic, 8, Springer, pp. 147–264, doi:10.1007/978-94-010-0387-2_3

    work page doi:10.1007/978-94-010-0387-2_3 2007

  4. [4]

    Asher & D

    N. Asher & D. Bonevac (1997): Common Sense Obligation. In Nute [23], pp. 159–204, doi:10.1007/978-94- 015-8851-5_8

    work page doi:10.1007/978-94- 1997

  5. [5]

    Barrett, R

    C. Barrett, R. Sebastiani, S. Seshia & C. Tinelli (2009): Satisfiability Modulo Theories . In: Handbook of Satisfiability, pp. 825–885, doi:10.3233/978-1-58603-929-5-825

    work page doi:10.3233/978-1-58603-929-5-825 2009

  6. [6]

    Blackburn, J

    P. Blackburn, J. van Benthem & F. Wolter, editors (2007): Handbook of Modal Logic. Elsevier

    work page 2007

  7. [7]

    Bryant (2018): Binary Decision Diagrams

    R. Bryant (2018): Binary Decision Diagrams . In E. Clarke, T. Henzinger, H. Veith & R. Bloem, editors: Handbook of Model Checking, Springer, pp. 191–217, doi:10.1007/978-3-319-10575-8_7

    work page doi:10.1007/978-3-319-10575-8_7 2018

  8. [8]

    Cassano, R

    V . Cassano, R. Fervari, C. Areces & P. Castro (2019): Interpolation and Beth Definability in Default Logics. In F. Calimeri, N. Leone & M. Manna, editors:16th European Conference on Logics in Artificial Intelligence (JELIA 2019), LNCS 11468, Springer, pp. 675–691, doi:10.1007/978-3-030-19570-0_44

    work page doi:10.1007/978-3-030-19570-0_44 2019

  9. [10]

    Castilho, A

    M. Castilho, A. Herzig & I. Varzinczak (2002): It depends on the context! A decidable logic of actions and plans based on a ternary dependence relation . In S. Benferhat & E. Giunchiglia, editors: 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), pp. 343–348

    work page 2002

  10. [11]

    Castro (2017): Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity

    P. Castro (2017): Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity. Studia Logica 105(2), pp. 229–251, doi:10.1007/s11225-016-9688-6

    work page doi:10.1007/s11225-016-9688-6 2017

  11. [12]

    Chellas (1980): Modal Logic (An Introduction)

    B. Chellas (1980): Modal Logic (An Introduction). Cambridge U Press, doi:10.1017/CBO9780511621192

    work page doi:10.1017/cbo9780511621192 1980

  12. [13]

    van Dalen (2004): Logic and structure, 5th edition

    D. van Dalen (2004): Logic and structure, 5th edition. Springer, doi:10.1007/978-1-4471-4558-5

    work page doi:10.1007/978-1-4471-4558-5 2004

  13. [14]

    Davey & Hilary A

    B Davey & H. Priestley (2002): Introduction to Lattices and Order , 2 edition. Cambridge U Press, doi:10.1017/CBO9780511809088

    work page doi:10.1017/cbo9780511809088 2002

  14. [15]

    Delgrande, T

    J. Delgrande, T. Schaub & W. Jackson (1994): Alternative Approaches to Default Logic . Artificial Intelli- gence 70(1-2), pp. 167–237, doi:10.1016/0004-3702(94)90106-6

    work page doi:10.1016/0004-3702(94)90106-6 1994

  15. [16]

    Froidevaux & J

    C. Froidevaux & J. Mengin (1994): Default Logics: A Unified View . Computational Intelligence 10, pp. 331–369, doi:10.1111/j.1467-8640.1994.tb00168.x

    work page doi:10.1111/j.1467-8640.1994.tb00168.x 1994

  16. [17]

    Givant & P

    S. Givant & P. Halmos (2009): Introduction to Boolean Algebras . Undergraduate Texts in Mathematics, Springer, doi:10.1007/978-0-387-68436-9

    work page doi:10.1007/978-0-387-68436-9 2009

  17. [18]

    An Ontology-based Representation for Shaping Product Evolution in Regulated Industries,

    J. Horty (1997): Nonmonotonic Foundations for Deontic Logic. In Nute [23], pp. 17–46, doi:10.1007/978- 94-015-8851-5_2

    work page doi:10.1007/978- 1997

  18. [19]

    Jipsen (1992): Computer-aided Investigations of Relation Algebras

    P. Jipsen (1992): Computer-aided Investigations of Relation Algebras. Ph.D. thesis. Vanderbilt University

    work page 1992

  19. [20]

    Łukaszewicz (1988): Considerations on Default Logic: An Alternative Approach

    W. Łukaszewicz (1988): Considerations on Default Logic: An Alternative Approach. Computational Intelli- gence 4, pp. 1–16, doi:10.1111/j.1467-8640.1988.tb00086.x. Castro, Cassano, Fervari & Areces 105

    work page doi:10.1111/j.1467-8640.1988.tb00086.x 1988

  20. [21]

    Makinson (2005): Bridges from Classical to Nonmonotonic Logic

    D. Makinson (2005): Bridges from Classical to Nonmonotonic Logic. Texts in Computing 5, College Publi- cations

    work page 2005

  21. [22]

    Wagner (1984): Aggregating Subjective Probabilities: Some Limitative Theorems

    J. Meyer (1988): A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic . Notre Dame Journal of Formal Logic 29(1), pp. 109–136, doi:10.1305/ndjfl/1093637776

    work page doi:10.1305/ndj 1988

  22. [23]

    Nute, editor (1997): Defeasible Deontic Logic

    D. Nute, editor (1997): Defeasible Deontic Logic . Synthese Library (Studies in Epistemology, Logic, Methodology, and Philosophy of Science) 263, Springer, doi:10.1007/978-94-015-8851-5

    work page doi:10.1007/978-94-015-8851-5 1997

  23. [24]

    Reiter (1980): A Logic for Default Reasoning

    R. Reiter (1980): A Logic for Default Reasoning. AI 13(1-2), pp. 81–132

    work page 1980

  24. [25]

    Royakkers & F

    L. Royakkers & F. Dignum (1997): Defeasible Reasoning with Legal Rules . In Nute [23], pp. 263–283, doi:10.1007/978-94-015-8851-5_11

    work page doi:10.1007/978-94-015-8851-5_11 1997

  25. [26]

    Y . Ryu & R. Lee (1997): Deontic Logic Viewed as Defeasible Reasoning . In Nute [23], pp. 123–138, doi:10.1007/978-94-015-8851-5_6

    work page doi:10.1007/978-94-015-8851-5_6 1997

  26. [27]

    Segerberg (1982): A deontic logic of action

    K. Segerberg (1982): A deontic logic of action. Studia Logica 41(2), pp. 269–282, doi:10.1007/BF00370348

    work page doi:10.1007/bf00370348 1982

  27. [28]

    van der Torre & Y-H

    L. van der Torre & Y-H. Tan (1997): The Many Faces of Defeasibility in Defeasible Deontic Logic. In Nute [23], pp. 79–122, doi:10.1007/978-94-015-8851-5_5

    work page doi:10.1007/978-94-015-8851-5_5 1997

  28. [29]

    Trypuz & P

    R. Trypuz & P. Kulicki (2015): On deontic action logics based on Boolean algebra . Journal of Logic and Computation 25(5), pp. 1241–1260, doi:10.1093/logcom/ext057

    work page doi:10.1093/logcom/ext057 2015

  29. [30]

    G. H. V on Wright (1951): Deontic logic. Mind 60(237), pp. 1–15, doi:10.1093/mind/LX.237.1

    work page doi:10.1093/mind/lx.237.1 1951