Abstract
Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas.
BibTeX - Entry
@InProceedings{bochman_et_al:LIPIcs:2011:3167,
author = {Alexander Bochman and Vladimir Lifschitz},
title = {{Yet Another Characterization of Strong Equivalence}},
booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) },
pages = {11--15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-31-6},
ISSN = {1868-8969},
year = {2011},
volume = {11},
editor = {John P. Gallagher and Michael Gelfond},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3167},
URN = {urn:nbn:de:0030-drops-31674},
doi = {10.4230/LIPIcs.ICLP.2011.11},
annote = {Keywords: Strong equivalence, logic program}
}
Keywords: |
|
Strong equivalence, logic program |
Collection: |
|
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) |
Issue Date: |
|
2011 |
Date of publication: |
|
27.06.2011 |