A denotational semantics for equilibrium logic

DOI10.1017/S1471068415000277zbMath1379.68032arXiv1507.06915MaRDI QIDQ4593002

No author found.

Publication date: 9 November 2017

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

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

zbMATH Keywords

answer set programmingequilibrium logic

Mathematics Subject Classification ID

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

Related Items (max. 100)

Syntactic ASP forgetting with forks ⋮ Syntactic ASP forgetting with forks ⋮ Gelfond-Zhang aggregates as propositional formulas ⋮ Equilibrium graphs ⋮ Temporal Here and There ⋮ Forgetting auxiliary atoms in forks

Uses Software

• PVS

Cites Work

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

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