Well-Founded Unions

被引:0
|
作者
Dawson, Jeremy [1 ]
Dershowitz, Nachum [2 ]
Gore, Rajeev [1 ]
机构
[1] Australian Natl Univ, Res Sch Comp Sci, Canberra, ACT, Australia
[2] Tel Aviv Univ, Sch Comp Sci, Tel Aviv, Israel
来源
基金
澳大利亚研究理事会;
关键词
TERMINATION;
D O I
10.1007/978-3-319-94205-6_9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Given two or more well-founded (terminating) binary relations, when can one be sure that their union is likewise well-founded? We suggest new conditions for an arbitrary number of relations, generalising known conditions for two relations. We also provide counterexamples to several potential weakenings. All proofs have been machine checked.
引用
收藏
页码:117 / 133
页数:17
相关论文
共 50 条
  • [1] A well-founded, scientifically well-founded Basic Education
    Beratung, Technische
    [J]. ELEKTROTECHNIK UND INFORMATIONSTECHNIK, 2009, 126 (10):
  • [2] Efficient Approximation of Well-Founded Justification and Well-Founded Domination
    Drescher, Christian
    Walsh, Toby
    [J]. LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR 2013), 2013, 8148 : 277 - 289
  • [3] 'Well-Founded Fear'
    Rosen, R
    [J]. FILM COMMENT, 2000, 36 (02) : 46 - 46
  • [4] Well-founded fear
    Jaffe, H
    [J]. AMERICAN BOOK REVIEW, 2001, 22 (02) : 16 - 16
  • [5] 'Well-Founded Fear'
    Santella, A
    [J]. NEW YORK TIMES BOOK REVIEW, 2000, : 35 - 35
  • [6] THE WELL-FOUNDED ALGEBRAS
    MONTAGNA, F
    [J]. ALGEBRA UNIVERSALIS, 1983, 16 (01) : 38 - 46
  • [7] WELL-FOUNDED FEAR
    Washington, John
    [J]. NATION, 2020, 310 (13) : 22 - 26
  • [8] A WELL-FOUNDED FEAR
    FRANEY, R
    [J]. NEW STATESMAN & SOCIETY, 1989, 2 (69): : 18 - 19
  • [9] The basis for well-founded simulations
    Meyer, O.
    Rall, M.
    Baschnegger, H.
    Lazarovici, M.
    Urban, B.
    [J]. ANAESTHESIST, 2016, 65 (12): : 943 - 950
  • [10] On Signings and the Well-Founded Semantics
    Maher, Michael J. J.
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2022, 22 (01) : 115 - 127