Propositional theories are strongly equivalent to logic programs

被引:44
|
作者
Cabalar, Pedro [1 ]
Ferraris, Paolo [2 ]
机构
[1] Univ A Coruna, Dept Comp Sci, Corunna, Spain
[2] Univ Texas Austin, Dept Comp Sci, Austin, TX USA
基金
美国国家科学基金会;
关键词
answer sets; equilibrium logic; logic of here-and-there; strong equivalence;
D O I
10.1017/S1471068407003110
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents a property of propositional theories under the answer sets semantics (called Equilibrium Logic for this general syntax): any theory can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two different proofs for this result: one involving a syntactic transformation, and one that constructs a program starting from the countermodels of the theory in the intermediate logic of here-and-there.
引用
收藏
页码:745 / 759
页数:15
相关论文
共 50 条
  • [1] Reducing propositional theories in equilibrium logic to logic programs
    Cabalar, P
    Pearce, D
    Valverde, A
    [J]. PROGRESS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, 3808 : 4 - 17
  • [2] Strongly Equivalent Temporal Logic Programs
    Aguado, Felicidad
    Cabalar, Pedro
    Perez, Gilberto
    Vidal, Concepcion
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5293 : 8 - 20
  • [3] Infinitary equilibrium logic and strongly equivalent logic programs
    Harrison, Amelia
    Lifschitz, Vladimir
    Pearce, David
    Valverde, Agustin
    [J]. ARTIFICIAL INTELLIGENCE, 2017, 246 : 22 - 33
  • [4] Discovering Classes of Strongly Equivalent Logic Programs
    Lin, Fangzhen
    Chen, Yin
    [J]. 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 516 - 521
  • [5] Discovering classes of strongly equivalent logic programs
    Lin, Fangzhen
    Chen, Yin
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2007, 28 : 431 - 451
  • [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] Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
    Truszczynski, Miroslaw
    [J]. ARTIFICIAL INTELLIGENCE, 2010, 174 (16-17) : 1285 - 1306
  • [8] Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
    Truszczynski, Miroslaw
    [J]. LOGIC PROGRAMMING, 2009, 5649 : 175 - 189
  • [9] 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
  • [10] Theories of the Classical Propositional Logic and Substitutions
    I. A. Gorbunov
    [J]. Mathematical Notes, 2021, 110 : 887 - 893