Proving infinitary formulas

DOI10.1017/S1471068416000302zbMath1379.68069arXiv1608.01626MaRDI QIDQ4593059

Amelia Harrison, Vladimir Lifschitz, Julian Michael

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/1608.01626

Mathematics Subject Classification ID

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

Related Items (1)

Infinitary equilibrium logic and strongly equivalent logic programs

Uses Software

• Gringo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz
• On intermediate many-valued logics
• Infinitary Equilibrium Logic and Strong Equivalence
• On equivalence of infinitary formulas under the stable model semantics
• Abstract gringo
• A Characterization of Strong Equivalence for Logic Programs with Variables

This page was built for publication: Proving infinitary formulas