License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2016.7
URN: urn:nbn:de:0030-drops-67375
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6737/
Lifschitz, Vladimir
Intelligent Instantiation and Supersafe Rules
Abstract
In the input languages of most answer set solvers, a rule with variables has, conceptually, infinitely many instances. The primary role of the process of intelligent instillation is to identify a finite set of ground instances of rules of the given program that are "essential" for generating its stable models. This process can be launched only when all rules of the program are safe. If a program contains arithmetic operations or comparisons then its rules are expected to satisfy conditions that are even stronger than safety. This paper is an attempt to make the idea of an essential instance and the need for "supersafety" in the process of intelligent instantiation mathematically
precise.
BibTeX - Entry
@InProceedings{lifschitz:OASIcs:2016:6737,
author = {Vladimir Lifschitz},
title = {{Intelligent Instantiation and Supersafe Rules}},
booktitle = {Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
pages = {7:1--7:14},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-007-1},
ISSN = {2190-6807},
year = {2016},
volume = {52},
editor = {Manuel Carro and Andy King and Neda Saeedloei and Marina De Vos},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6737},
URN = {urn:nbn:de:0030-drops-67375},
doi = {10.4230/OASIcs.ICLP.2016.7},
annote = {Keywords: answer set programming}
}
|
Keywords: |
|
answer set programming |
|
Collection: |
|
Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
11.11.2016 |
