A denotational semantics for equilibrium logic

DOI10.1017/S1471068415000277zbMATH Open1379.68032arXiv1507.06915MaRDI QIDQ4593002FDOQ4593002

Authors:

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: In this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as G"odel's G3 logic) that relies on the idea of "denotation" of a formula, that is, a function that collects the set of models of that formula. Using the three-valued logic G3 as a starting point and an ordering relation (for which equilibrium/stable models are minimal elements) we provide several elementary operations for sets of interpretations. By analysing structural properties of the denotation of formulas, we show some expressiveness results for G3 such as, for instance, that conjunction is not expressible in terms of the other connectives. Moreover, the denotational semantics allows us to capture the set of equilibrium models of a formula with a simple and compact set expression. We also use this semantics to provide several formal definitions for entailment relations that are usual in the literature, and further introduce a new one called "strong entailment". We say that $alpha$ strongly entails $$ when the equilibrium models of $alphawedgegamma$ are also equilibrium models of $$ for any context $gamma$. We also provide a characterisation of strong entailment in terms of the denotational semantics, and give an example of a sufficient condition that can be applied in some cases.

Full work available at URL: https://arxiv.org/abs/1507.06915

Recommendations

• The Modal Logic of Equilibrium Models
• Interpolable formulas in equilibrium logic and answer set programming
• Capturing equilibrium models in modal logic
• Equilibrium logic
• scientific article; zbMATH DE number 1696829

zbMATH Keywords

answer set programmingequilibrium logic

Mathematics Subject Classification ID

Logic programming (68N17) Logic in computer science (03B70)

Cites Work

• Partial equilibrium logic
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Strongly equivalent logic programs
• Equilibrium logic
• Logic programs with stable model semantics as a constraint programming paradigm
• Results on the propositional \(\mu\)-calculus
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Propositional theories are strongly equivalent to logic programs
• The rise and fall of semantic rule updates based on SE-models
• Minimal Logic Programs
• Temporal equilibrium logic: a survey
• A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
• Model-based recasting in answer-set programming

Cited In (12)

• Equilibrium graphs
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• EQ-logics with delta connective
• Infinitary Equilibrium Logic and Strong Equivalence
• Syntactic ASP forgetting with forks
• Forgetting auxiliary atoms in forks
• Title not available (Why is that?)
• Gelfond-Zhang aggregates as propositional formulas
• Temporal here and there
• Syntactic ASP forgetting with forks
• Capturing equilibrium models in modal logic
• A Semantical Approach to Equilibria and Rationality

Uses Software

• PVS

This page was built for publication: A denotational semantics for equilibrium logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593002)