KR2023Proceedings of the 20th International Conference on Principles of Knowledge Representation and ReasoningProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning

Rhodes, Greece. September 2-8, 2023.

Edited by
  1. Pierre Marquis,
  2. Tran Cao Son
  3. Gabriele Kern-Isberner

ISSN: 2334-1033
ISBN: 978-1-956792-02-7

Sponsored by
Published by

Copyright © 2023 International Joint Conferences on Artificial Intelligence Organization

Omega-Completeness of the Logic of Here-and-There and Strong Equivalence of Logic Programs

  1. Jorge Fandinno(University of Nebraska Omaha)
  2. Vladimir Lifschitz(The University of Texas Austin)
PDF
BibTeX
https://doi.org/10.24963/kr.2023/24

Keywords

  1. Logic programming, answer set programming
  2. Nonmonotonic logics, default logics, conditional logics

Abstract

Theory of strongly equivalent transformations is an essential part of the methodology of representing knowledge in answer set programming. Strong equivalence of two programs can be sometimes characterized as the possibility of deriving the rules of each program from the rules of the other in some deductive system. This paper describes a system with this property for the language mini-GRINGO. The key to the proof is an ω-completeness theorem for the many-sorted logic of here-and-there.