Fandinno, J., Pearce, D., Vidal, C., & Woltran, S. (2022). Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs. Algorithms, 15(6), Article 201. https://doi.org/10.3390/a15060201
answer set programming; equilibrium logic; forks in ASP; intertheory relations; projective entailment
Answer Set Programming (ASP) is a well established logical approach in artificial intelligence that is widely used for knowledge representation and problem solving. Equilibrium logic extends answer set semantics to more general classes of programs and theories. When intertheory relations are studied in ASP, or in the more general form of equilibrium logic, they are usually under-stood in the form of comparisons of the answer sets or equilibrium models of theories or programs. This is the case for strong and uniform equivalence and their relativised and projective versions. However, there are many potential areas of application of ASP for which query answering is relevant and a comparison of programs in terms of what can be inferred from them may be important. We formulate and study some natural equivalence and entailment concepts for programs and theories that are couched in terms of inference and query answering. We show that, for the most part, these new intertheory relations coincide with their model-theoretic counterparts. We also extend some previous results on projective entailment for theories and for the new connective called ork.
European Cooperation in Science & Technology (COST) Ministerio de Ciencia e Innovación, Spain Consellería de Educación, Universidade e Formación Profesional Consellería de Educación, Universidade e Formación Profesional Austrian Science Fund (FWF)