A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There

DOI10.1017/S1471068410000542zbMath1218.68070OpenAlexW2178463746MaRDI QIDQ3008405

Michael Fink

Publication date: 15 June 2011

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

Full work available at URL: https://doi.org/10.1017/s1471068410000542

zbMATH Keywords

knowledge representationanswer-set programminguniform equivalencerelativized equivalence

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (5)

Applying Visible Strong Equivalence in Answer-Set Program Transformations ⋮ Model-based recasting in answer-set programming ⋮ A denotational semantics for equilibrium logic ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Forgetting auxiliary atoms in forks

Uses Software

• GNT
• ASSAT
• clasp

This page was built for publication: A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There