Discovering Classes of Strongly Equivalent Logic Programs

被引：0
|
作者：
Lin, Fangzhen [1 ]
Chen, Yin [1 ]
机构：
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
来源：
19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05) | 2005年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We report on a successful experiment of computer-aided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a set of a rule and the empty set, a set of a rule and another set of a rule, a set S of two rules and a subset of S with one rule, a set of two rules and a set of another rule, and a set S of three rules and a subset of S with two rules. We prove some general theorems that can help us verify the correctness of these conditions, and discuss the usefulness of our results in program simplification.
引用
收藏
页码：516 / 521
页数：6
相关论文
共 50 条
  • [1] Discovering classes of strongly equivalent logic programs
    Lin, Fangzhen
    Chen, Yin
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2007, 28 : 431 - 451
  • [2] Discovering Classes of Strongly Equivalent Logic Programs with Negation as Failure in the Head
    Ji, Jianmin
    [J]. KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, KSEM 2015, 2015, 9403 : 147 - 153
  • [3] Strongly Equivalent Temporal Logic Programs
    Aguado, Felicidad
    Cabalar, Pedro
    Perez, Gilberto
    Vidal, Concepcion
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5293 : 8 - 20
  • [4] Infinitary equilibrium logic and strongly equivalent logic programs
    Harrison, Amelia
    Lifschitz, Vladimir
    Pearce, David
    Valverde, Agustin
    [J]. ARTIFICIAL INTELLIGENCE, 2017, 246 : 22 - 33
  • [5] Propositional theories are strongly equivalent to logic programs
    Cabalar, Pedro
    Ferraris, Paolo
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2007, 7 : 745 - 759
  • [6] Characterization of strongly equivalent logic programs in intermediate logics
    De Jongh, DHJ
    Hendriks, L
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2003, 3 : 259 - 270
  • [7] EQUIVALENT LOGIC PROGRAMS
    CHAN, KH
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1990, 8 (03): : 187 - 199
  • [8] Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
    Heuer, Jan
    Wernhard, Christoph
    [J]. AUTOMATED REASONING, IJCAR 2024, PT I, 2024, 14739 : 172 - 193
  • [9] Classes of terminating logic programs
    Pedreschi, D
    Ruggieri, S
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2002, 2 : 369 - 418
  • [10] STRONGLY EQUIVALENT CLASSES OF FUNCTIONS ON FINITE SETS
    CHAO, CY
    HAN, SC
    [J]. CHINESE SCIENCE BULLETIN, 1990, 35 (16): : 1401 - 1402
12345