Pith. sign in

REVIEW 3 minor 102 references

Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica

T0 review · 0 major / 3 minor · reviewed 2026-06-28 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A ground atom is true in a Logica program if it persists in all further derivations from every reachable state.

desk verdict The paper defines a stabilization-based DO semantics for Logica programs mixing recursion and aggregation, using rewrite systems over derivation states with game and modal equivalents, plus omega-limits for non-fixpoint convergence. read the letter →

arxiv 2606.02926 v2 pith:DMP3ZNNW submitted 2026-06-01 cs.LO

Evgeny Skvortsov , Yilin Xia , Ojaswa Garg , Shawn Bowers , Bertram Ludäscher This is my paper · ORCID
classification cs.LO
keywords stabilizationsemanticsdefendant-opponentlogicprogrammingrecursionandaggregationnonmonotonicreasoningDatalogomega-limitinterpretationsmodalS4
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper defines a stabilization semantics for logic programs that combine recursion and aggregation without restrictions. Evaluation is treated as a rewrite system on derivation states, and an atom counts as true when, no matter which state is reached, some continuation exists in which the atom remains present forever after. This yields two equivalent views: a three-turn game in which a Defendant can always force persistence against any Opponent, and a modal formula []<>[]t on the derivation graph seen as a Kripke frame. The resulting semantics recovers least-fixpoint behavior on positive Datalog, aligns with well-founded and stable-model semantics, and supplies ω-limit interpretations for iterative computations such as PageRank that converge without ever reaching a fixpoint.

What carries the argument

Defendant-Opponent semantics, which declares an atom true exactly when it persists under some continuation from every reachable state in the rewrite system of derivations.

What would settle it

A concrete Logica program together with its actual iterative execution trace in which an atom the semantics declares true fails to persist in the observed sequence of states, or vice versa.

Watch

Extended reading notes

Core claim

A ground atom t is true under Defendant-Opponent semantics precisely when, from every reachable derivation state, there exists a continuation in which t appears in every subsequent state. This condition is equivalent both to Defendant having a winning strategy in a three-turn game against any Opponent and to the modal formula []<>[]t holding in the derivation graph viewed as a Kripke structure; the same framework therefore places nonmonotonic reasoning inside S4 while assigning rigorous meaning to programs that converge without a fixpoint via their ω-limit interpretations.

Load-bearing premise

That treating evaluation as a rewrite system over derivation states is enough to capture the intended meaning of unrestricted aggregation and recursion.

Editorial extensions

If this is right

  • DO semantics coincides with least-fixpoint semantics on positive Datalog programs.
  • It is compatible with both well-founded semantics and stable-model semantics.
  • Programs that converge without a fixpoint receive a rigorous meaning through their ω-limit interpretations.
  • Nonmonotonic reasoning is placed inside the modal logic S4 via the []<>[] characterization.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The persistence view may let implementers replace fixpoint iteration with simpler loop detection in SQL engines.
  • The three-turn game formulation could be used to certify answers in a distributed setting without materializing the full derivation graph.
  • The modal embedding suggests that existing S4 model checkers might be repurposed to decide truth under DO semantics for finite derivation graphs.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The paper introduces Defendant-Opponent (DO) semantics, a stabilization-based framework for nonmonotonic logic programs supporting unrestricted aggregation and recursion in Logica. Evaluation is modeled as a rewrite system over derivation states; a ground atom is true if, from every reachable state, some continuation makes the atom persist in all further derivations. This admits equivalent characterizations as a three-turn Defendant-Opponent game and as the modal formula []<>[]t in the derivation graph viewed as a Kripke structure (placing the reasoning in S4). The semantics coincides with least-fixpoint semantics on positive Datalog, is compatible with well-founded and stable-model semantics, and supplies ω-limit interpretations for convergent non-fixpoint programs such as PageRank.

Significance. If the equivalences and compatibilities hold, the framework is significant because it supplies rigorous meaning to iterative computations that converge without reaching a fixpoint, extending beyond classical fixpoint semantics while remaining compatible with existing nonmonotonic semantics. The game-theoretic and modal characterizations are explicit strengths that place nonmonotonic reasoning inside S4 and could aid analysis of practical SQL-compiled logic programs.

minor comments (3)
  1. [Abstract] Abstract: the claim that the three characterizations are equivalent is central but the abstract supplies no derivation or proof sketch; the main text should include a short outline of the equivalence proof (e.g., in the section presenting the rewrite relation) so readers can assess the load-bearing step without reading the full appendix.
  2. The description of the rewrite system over derivation states is introduced without an explicit definition of the state space or the transition relation; adding a formal definition (perhaps as a displayed equation or small example) would clarify how replacement-style aggregation is encoded.
  3. The paper states compatibility with well-founded and stable-model semantics but does not cite a specific theorem number or subsection where the embedding or simulation is proved; a dedicated compatibility subsection with a short statement of the result would improve traceability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our work on Defendant-Opponent semantics, its game-theoretic and modal characterizations, and its compatibility with existing semantics. The recommendation of minor revision is noted; absent any specific major comments, we interpret this as a request for minor clarifications or polishing that we will address in the revised manuscript.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The paper defines Defendant-Opponent semantics directly from a rewrite system over derivation states, with truth characterized as stabilization (persistence from every reachable state onward). This core definition is not reduced to any fitted parameter, prior result, or self-citation; the game-theoretic and modal ([]<>[]t) characterizations are derived as equivalent reformulations inside the same framework. Compatibility with least-fixpoint, well-founded, and stable-model semantics is presented as a consistency property rather than a justificatory premise, and no uniqueness theorem or ansatz is imported from the authors' prior work. The derivation is therefore self-contained against external benchmarks.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

Abstract provides no explicit free parameters, axioms, or invented entities; full text would be required to audit them.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica." pith.science (2026). https://pith.science/paper/DMP3ZNNW

@misc{pith2026260602926,
  author       = {Pith},
  title        = {Pith review of: Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DMP3ZNNW}},
  note         = {Machine review of arXiv:2606.02926}
}
read the original abstract

Logica is an open-source logic programming language that compiles to SQL and runs on DuckDB, SQLite, PostgreSQL, and BigQuery. Unlike classic Datalog, it freely combines recursion and aggregation, concisely expressing algorithms from shortest paths to PageRank. This expressiveness raises semantic challenges: aggregates update by replacement rather than accumulation, evaluation depends on rule scheduling, and programs may converge to meaningful results without reaching a fixpoint, placing them outside traditional fixpoint semantics. We address this with Defendant-Opponent (DO) semantics, a stabilization-based framework for nonmonotonic logic programs. Evaluation is modeled as a rewrite system over derivation states, and a ground atom is true if, from every reachable state, some continuation makes the atom persist in all further derivations. This admits two equivalent characterizations: game-theoretically, truth is what a Defendant can defend against any Opponent in a three-turn game; and modally, truth corresponds to []<>[]t in the derivation graph viewed as a Kripke structure, placing nonmonotonic reasoning within S4. DO semantics coincides with least fixpoint semantics for positive Datalog and is compatible with both Well-Founded and Stable Model Semantics. For programs that converge without a fixpoint, {\omega}-limit interpretations give rigorous meaning to iterative computations such as PageRank.

Figures

Figures reproduced from arXiv: 2606.02926 by the authors.

Figure 1
Figure 1. The seven distinct S4 modalities (left, strongest □ t at bottom) with their DO-semantics interpretations (right). Here □ is “necessarily” and □ is “possibly” in the standard modal reading; the right side shows what each modality means for derivations. Arrows point upward in the direction of implication: a lower (stronger) modality entails a higher (weaker) one, e.g., □ □□ t (theorem) implies □ □t (always derivable).… view at source ↗
Figure 2
Figure 2. Two logic programs and their derivation graphs. Monotonic program (left): derivation flows upward to the unique fixpoint {a, b, c, d}. Nonmonotonic program (right): we causes oscil￾lation (red edges) between {a, b, d} and {a, b, d, e}; {a, c, d} is a separate fixpoint. Green nodes are axioms; blue nodes are static interpretations (sink SCC nodes). Edge labels identify rewrite rules; gray self-loops indicate rules th… view at source ↗
Figure 3
Figure 3. Derivation graph for the Left/Right program (L and R abbreviate Left and Right). Green: axiom; blue: sole static interpretation (fixpoint). The left branch stabilizes; the right diverges (X grows without bound). Since the blue node is unreachable from the right branch, no irreducible truth exists. Dashed gray: self-loops. For finite systems, however, static interpretations do characterize all truths. We for￾malize t… view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Left: derivation graph for the program with rules wb: {b ← a,¬ b} and wc: {c ← b; c ← c}. Right: Ground nonmonotonic system with rules wp(a): {p(a) ← ¬q(a)}; wp(b): {p(b) ← ¬q(b)}; wq(a): {q(a) ← ¬p(a)}; and wq(b): {q(b) ← ¬p(b)}. In both figures, green nodes represent…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

102 extracted references · 20 canonical work pages

  1. [1]

    1998 , xnote =

    Computer Networks , volume =. 1998 , xnote =

    1998

  2. [2]

    1988 , publisher=

    Principles of Database and Knowledge-Base Systems , author=. 1988 , publisher=

    1988

  3. [3]

    van Emden, M. H. and Kowalski, R. A. , title =. J. ACM , volume =

  4. [4]

    and Ross, K

    Van Gelder, A. and Ross, K. A. and Schlipf, J. S. , title=. J. ACM , volume=. 1991 , publisher=

    1991

  5. [5]

    and Lifschitz, V

    Gelfond, M. and Lifschitz, V. , title =. Logic Programming: Proceedings of ICLP , pages =

  6. [6]

    Mumick, I. S. and Pirahesh, H. and Ramakrishnan, R. , title=. VLDB , pages=

  7. [7]

    J. Comput. Syst. Sci. , volume =. 1997 , author =

    1997

  8. [8]

    , title =

    Skvortsov, E. , title =

Show all 102 references
  1. [9]

    and Leone, N

    Faber, W. and Leone, N. and Pfeifer, G. JELIA. 2004

    2004

  2. [10]

    J. Comput. Syst. Sci. , volume =. 1993 , author =

    1993

  3. [11]

    and Ramakrishnan, Raghu and Srivastava, Divesh and Ullman, Jeffrey D

    Kemp, David B. and Ramakrishnan, Raghu and Srivastava, Divesh and Ullman, Jeffrey D. , title =. Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) , pages =. 1989 , publisher =

    1989

  4. [12]

    Kemp and Peter J

    David B. Kemp and Peter J. Stuckey , title =. Proceedings of the 1991 International Symposium on Logic Programming (

    1991

  5. [13]

    Intl.\ Conf.\ on Database Theory (ICDT) , publisher =

    Flum, J. Intl.\ Conf.\ on Database Theory (ICDT) , publisher =

  6. [14]

    Order , volume = 17, number = 1, pages =

    Flum, J. Order , volume = 17, number = 1, pages =

  7. [15]

    Algorithmica , month = sep, pages =

    Casteigts, Arnaud and Himmel, Anne-Sophie and Molter, Hendrik and Zschoche, Philipp , title =. Algorithmica , month = sep, pages =. 2021 , volume =

    2021

  8. [17]

    Kempe, David and Kleinberg, Jon and Kumar, Amit , title =. J. Comput. Syst. Sci. , month = jun, pages =. 2002 , volume =

    2002

  9. [18]

    Aho, A. V. and Garey, M. R. and Ullman, J. D. , title =. SIAM Journal on Computing , volume =

  10. [19]

    SIAM Journal on Computing , volume =

    Tarjan, Robert , title =. SIAM Journal on Computing , volume =

  11. [20]

    Journal of Combinatorial Theory , volume = 1, number = 1, pages =

    Graphs and composite games , author =. Journal of Combinatorial Theory , volume = 1, number = 1, pages =

  12. [21]

    Gelfond , xeditor =

    M. Gelfond , xeditor =. Handbook of Knowledge Representation , xseries =

  13. [22]

    E. S. Skvortsov and Y. Xia and B. Lud. EDBT , pages =

  14. [23]

    E. S. Skvortsov and Y. Xia and S. Bowers and B. Lud. Datalog-2.0 , series =

  15. [24]

    2005 , note =

    Electronic Notes in Theoretical Computer Science , volume =. 2005 , note =

    2005

  16. [25]

    Graph Transformation in Molecular Biology https://doi.org/10.1007/978-3-540-31847-7_7

    Rossell \'o , Francesc and Valiente, Gabriel. Graph Transformation in Molecular Biology https://doi.org/10.1007/978-3-540-31847-7_7. Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday. 2005

    2005 doi

  17. [26]

    Graph Rewriting Systems and their Application in Biology

    Nagl, Manfred. Graph Rewriting Systems and their Application in Biology. Mathematical Models in Medicine. 1976

    1976

  18. [27]

    International Workshop on Rewriting Logic and Its Applications , series =

    Maribel Fern. International Workshop on Rewriting Logic and Its Applications , series =

  19. [28]

    2023 , booktitle =

    Kr\". 2023 , booktitle =

    2023

  20. [29]

    2014 , pages=

    de la Parra, Francisco and Dean, Thomas , booktitle=. 2014 , pages=

    2014

  21. [30]

    Software System Modeling , year =

    de Lara, Juan and Guerra, Esther and Bottoni, Paolo , title =. Software System Modeling , year =

  22. [31]

    Datalog 2.0 2022 , series =

    Reinhard Pichler , title =. Datalog 2.0 2022 , series =

    2022

  23. [32]

    1998 , booktitle =

    Brin, Sergey and Page, Lawrence , title =. 1998 , booktitle =

    1998

  24. [33]

    and Kaminski, R

    Gebser, M. and Kaminski, R. and Kaufmann, B. and Schaub, T. , title =. TPLP , volume =. 2019 , pages =

    2019

  25. [34]

    , month = sep, year =

    Skvortsov, E. , month = sep, year =

  26. [35]

    Yedalog: Exploring Knowledge at Scale , xauthor=

    Chin, Brian and von Dincklage, Daniel and Ercegovac, Vuk and Hawkins, Peter and Miller, Mark and others , journal=. Yedalog: Exploring Knowledge at Scale , xauthor=

  27. [36]

    and Och, Franz and Olston, Christopher and Pereira, Fernando , year =

    Chin, Brian and von Dincklage, Daniel and Ercegovac, Vuk and Hawkins, Peter and Miller, Mark S. and Och, Franz and Olston, Christopher and Pereira, Fernando , year =. Yedalog:

  28. [37]

    Skvortsov, Evgeny and Xia, Yilin and Ludäscher, Bertram , month = dec, year =. Logica:

  29. [38]

    Skvortsov, Evgeny and Xia, Yilin and Bowers, Shawn and Ludäscher, Bertram , year =. The

  30. [39]

    ACM SIGMOD Record , author =

    Query Languages for Graph Databases , volume =. ACM SIGMOD Record , author =. 2012 , pages =

    2012

  31. [40]

    and Köhler, Sven and Bowers, Shawn and Ludäscher, Bertram , editor =

    Dey, Saumen C. and Köhler, Sven and Bowers, Shawn and Ludäscher, Bertram , editor =. Datalog as a Lingua Franca for Provenance Querying and Reasoning , xurl =. 4th Workshop on the Theory and Practice of Provenance (TaPP) , publisher =

  32. [41]

    IBM Systems Journal , author =

    Query-by-. IBM Systems Journal , author =. 1977 , xnote =

    1977

  33. [42]

    Logica Project , url =

    Skvortsov, Evgeny , year =. Logica Project , url =

  34. [43]

    Skvortsov, Evgeny , month = dec, year =. Logica

  35. [44]

    Naik, Aaditya and Mendelson, Jonathan and Sands, Nathaniel and Wang, Yuepeng and Naik, Mayur and Raghothaman, Mukund , month = oct, year =. Sporq:. 34th

  36. [45]

    , month = may, year = 2015, keywords =

    Green, Todd J. , month = may, year = 2015, keywords =

    2015

  37. [46]

    The VLDB Journal , author =

    Formal semantics and high performance in declarative machine learning using. The VLDB Journal , author =. 2021 , pages =

    2021

  38. [47]

    and Hellerstein, Joseph M

    Loo, Boon Thau and Condie, Tyson and Garofalakis, Minos and Gay, David E. and Hellerstein, Joseph M. and Maniatis, Petros and others , month = jun, year =. Declarative networking: language, execution and optimization , isbn =

  39. [48]

    On fast large-scale program analysis in

    Scholz, Bernhard and Jordan, Herbert and Subotić, Pavle and Westmann, Till , month = mar, year = 2016, keywords =. On fast large-scale program analysis in. 25th

    2016

  40. [49]

    Soufflé:

    Jordan, Herbert and Scholz, Bernhard and Subotić, Pavle , xeditor =. Soufflé:. Computer. 2016 , keywords =

    2016

  41. [50]

    , xeditor =

    Eisner, Jason and Filardo, Nathaniel W. , xeditor =. Dyna:. Datalog

  42. [51]

    2011 , xurl =

    Datalog Reloaded: 1st Intl.\ Workshops , series =. 2011 , xurl =

    2011

  43. [52]

    2022 , xurl =

    4th Intl.\ Workshop on the Resurgence of Datalog in Academia and Industry , series =. 2022 , xurl =

    2022

  44. [53]

    Journal of the ACM , author =

    The. Journal of the ACM , author =. 1991 , keywords =

    1991

  45. [54]

    Journal of Computer and System Sciences , author =

    Datalog extensions for database queries and updates , volume =. Journal of Computer and System Sciences , author =. 1991 , pages =

    1991

  46. [55]

    and Hull, R

    Abiteboul, S. and Hull, R. and Vianu, V. , year =. Foundations of

  47. [56]

    and Vianu, V , title =

    Abiteboul, S. and Vianu, V , title =. Ann Math Artif Intell , volume =

  48. [57]

    SIGMOD Record , author =

    The declarative imperative: experiences and conjectures in distributed logic , volume =. SIGMOD Record , author =. 2010 , xnote =

    2010

  49. [59]

    2012 , file =

    Datalog in. 2012 , file =

    2012

  50. [60]

    2011 , file =

    Datalog. 2011 , file =

    2011

  51. [61]

    Gottlob, Georg and Koch, Christoph and Baumgartner, Robert and Herzog, Marcus and Flesca, Sergio , year =. The. Proceedings of the. doi:10.1145/1055558.1055560 , abstract =

    doi

  52. [62]

    2011 , keywords =

    Electronic Notes in Theoretical Computer Science , author =. 2011 , keywords =. doi:10.1016/j.entcs.2011.02.011 , urldate =

    2011 doi

  53. [63]

    Data & Knowledge Engineering , author =

    Query evaluation in recursive databases: bottom-up and top-down reconciled , volume =. Data & Knowledge Engineering , author =. 1990 , keywords =. doi:10.1016/0169-023X(90)90017-8 , abstract =

    1990 doi

  54. [64]

    , year =

    Eisner, Jason and Filardo, Nathaniel W. , year =. Dyna:. Datalog. doi:10.1007/978-3-642-24206-9_11 , pages =

    doi

  55. [65]

    Bellomarini, Luigi and Fayzrakhmanov, Ruslan R. and Gottlob, Georg and Kravchenko, Andrey and Laurenza, Eleonora and Nenov, Yavor and Reissfelder, Stéphane and Sallinger, Emanuel and Sherkhonov, Evgeny and Wu, Lianlong , xeditor =. Data. Model and. 2018 , keywords =

    2018

  56. [66]

    VLDB , author =

    The. VLDB , author =. 2018 , pages =

    2018

  57. [67]

    Electronic Communications of the EASST , author =

    Towards. Electronic Communications of the EASST , author =. 2014 , file =. doi:10.14279/tuj.eceasst.64.985 , language =

    2014 doi

  58. [68]

    Expert Systems with Applications , author =

    Relational calculi in a deductive system , volume =. Expert Systems with Applications , author =. 2018 , keywords =

    2018

  59. [69]

    Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium: Principles of Database Systems , author =

    Explicit control of logic programs through rule algebra , issn =. Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium: Principles of Database Systems , author =. 1988 , pages =

    1988

  60. [70]

    Annals of Mathematics and Artificial Intelligence , author =

    Rule-based languages , volume =. Annals of Mathematics and Artificial Intelligence , author =. 1997 , keywords =. doi:10.1023/A:1018907806177 , abstract =

    1997 doi

  61. [71]

    Alviano, Mario and Faber, Wolfgang and Leone, Nicola and Perri, Simona and Pfeifer, Gerald and Terracina, Giorgio , editor =. The. Datalog. 2011 , keywords =

    2011

  62. [72]

    2017 , pages =

    TPLP , author =. 2017 , pages =

    2017

  63. [73]

    2019 , note =

    The VLDB Journal , author =. 2019 , note =. doi:10.1007/s00778-018-0518-5 , language =

    2019 doi

  64. [74]

    Bry, François and Furche, Tim and Ley, Clemens and Marnette, Bruno and Linse, Benedikt and Schaffert, Sebastian , editor =. Datalog. Datalog. 2011 , keywords =. doi:10.1007/978-3-642-24206-9_19 , abstract =

    2011 doi

  65. [75]

    arXiv:1901.01930 [cs] , author =

    Keeping. arXiv:1901.01930 [cs] , author =. 2019 , note =

    1901 arXiv

  66. [76]

    arXiv:1907.05045 [cs] , author =

    Provenance for. arXiv:1907.05045 [cs] , author =. 2019 , note =

    1907 arXiv

  67. [77]

    Vianu, Victor , month = jun, year =

  68. [78]

    Future Generation Computer Systems , author =

    Data science with. Future Generation Computer Systems , author =. 2022 , keywords =

    2022

  69. [79]

    Foundations and Trends® in Databases , author =

    Data. Foundations and Trends® in Databases , author =. 2021 , note =. doi:10.1561/1900000068 , abstract =

    2021 doi

  70. [80]

    and Tekle, K

    Maier, D. and Tekle, K. T. and Kifer, M. and Warren, D. S. , xmonth = sep, year =. Datalog: concepts, history, and outlook , xvolume =. Declarative Logic Programming , xpublisher =

  71. [81]

    Aggregates in

    Mohapatra, Abhijeet , year =. Aggregates in

  72. [82]

    ACM Transactions on Programming Languages and Systems , author =

    Debugging. ACM Transactions on Programming Languages and Systems , author =. 2020 , keywords =. doi:10.1145/3379446 , abstract =

    2020 doi

  73. [83]

    and Gottlob, G

    Ceri, S. and Gottlob, G. and Tanca, L. , year =

  74. [84]

    Reasoning over financial scenarios with the vadalog system , url =

    Baldazzi, Teodoro and Bellomarini, Luigi and Sallinger, Emanuel , editor =. Reasoning over financial scenarios with the vadalog system , url =. 2023 , note =. doi:10.48786/edbt.2023.66 , booktitle =

    2023 doi

  75. [85]

    Logic and

    Minker, Jack and Seipel, Dietmar and Zaniolo, Carlo , editor =. Logic and. Handbook of the. 2014 , xdoi =

    2014

  76. [86]

    Theory and Practice of Logic Programming , author =

    Transformation-based bottom-up computation of the well-founded model , volume =. Theory and Practice of Logic Programming , author =. 2001 , note =. doi:10.1017/S147106840100103X , abstract =

    2001 doi

  77. [87]

    Logic Comput

    J. Logic Comput. , author =. 2022 , pages =

    2022

  78. [88]

    Neven, Frank , month = jun, year =. Logical. Proceedings of the 35th. doi:10.1145/2902251.2902307 , abstract =

    doi

  79. [89]

    CACM , author =

    Keeping. CACM , author =. 2020 , pages =

    2020

  80. [90]

    Journal of Computer and System Sciences , author =

    Positive. Journal of Computer and System Sciences , author =. 2014 , keywords =. doi:10.1016/j.jcss.2014.01.005 , abstract =

    2014 doi

  81. [91]

    Datalog and emerging applications: an interactive tutorial , isbn =

    Huang, Shan Shan and Green, Todd Jeffrey and Loo, Boon Thau , month = jun, year =. Datalog and emerging applications: an interactive tutorial , isbn =. Proceedings of the 2011. doi:10.1145/1989323.1989456 , abstract =

    2011 doi

  82. [92]

    Logic and data bases , isbn =

    Symposium on Logic. Logic and data bases , isbn =. 1978 , keywords =

    1978

  83. [93]

    and Pichler, Reinhard and Suciu, Dan and Remy Wang, Yisu , title =

    Khamis, Mahmoud Abo and Ngo, Hung Q. and Pichler, Reinhard and Suciu, Dan and Remy Wang, Yisu , title =. SIGMOD Rec. , month =. 2022 , issue_date =. doi:10.1145/3552490.3552492 , abstract =

    2022 doi

  84. [94]

    ACM Trans

    Denecker, Marc and Ternovska, Eugenia , title =. ACM Trans. Comput. Logic , month =. 2008 , issue_date =. doi:10.1145/1342991.1342998 , abstract =

    2008 doi

  85. [95]

    Mathematical Logic , year =

    Stephen Cole Kleene , editor =. Mathematical Logic , year =

  86. [96]

    König, Barbara , title =

  87. [97]

    , title =

    Lorenzen, P. , title =. Infinitistic Methods , pages =. 1961 , publisher =

    1961

  88. [98]

    Chellas, B. F. , year=. Modal Logic: An Introduction , publisher=

  89. [99]

    Meyer, C. D. , title =

  90. [100]

    and Han, W

    Atkinson, K. and Han, W. and Stewart, D. E. , title =

  91. [101]

    and Schneider, F

    Alpern, B. and Schneider, F. B. , title =. Inf. Process. Lett. , volume =

  92. [102]

    Proceedings of the 41st International Conference on Logic Programming (ICLP 2025) , series =

    Trinh, Van-Giang and Soliman, Sylvain and Fages, Fran. Proceedings of the 41st International Conference on Logic Programming (ICLP 2025) , series =. 2026 , publisher =

    2025

  93. [103]

    Trinh, Van-Giang and Benhamou, Belaid and Soliman, Sylvain and Fages, Fran

  94. [104]

    Bertsekas, D. P. and Tsitsiklis, J. N. , title =

Pith tools

Reviewed June 28, 2026 · model on record in the stance chip above.