DROPS

Document

DOI: 10.4230/OASIcs.ICLP.2016.7

Intelligent Instantiation and Supersafe Rules

Authors: Vladimir Lifschitz

Published in: OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

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.

Cite as

Vladimir Lifschitz. Intelligent Instantiation and Supersafe Rules. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{lifschitz:OASIcs.ICLP.2016.7,
  author =	{Lifschitz, Vladimir},
  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 =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.7},
  URN =		{urn:nbn:de:0030-drops-67375},
  doi =		{10.4230/OASIcs.ICLP.2016.7},
  annote =	{Keywords: answer set programming}
}

Document

DOI: 10.4230/LIPIcs.ICLP.2012.259

Two-Valued Logic Programs

Authors: Vladimir Lifschitz

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)

Abstract

We define a nonmonotonic formalism that shares some features with three other systems of nonmonotonic reasoning—default logic, logic programming with strong negation, and nonmonotonic causal logic—and study its possibilities as a language for describing actions.

Cite as

Vladimir Lifschitz. Two-Valued Logic Programs. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 259-266, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{lifschitz:LIPIcs.ICLP.2012.259,
  author =	{Lifschitz, Vladimir},
  title =	{{Two-Valued Logic Programs}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{259--266},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.259},
  URN =		{urn:nbn:de:0030-drops-36279},
  doi =		{10.4230/LIPIcs.ICLP.2012.259},
  annote =	{Keywords: Answer set programming, Non monotonic reasoning, Foundations}
}

Document

DOI: 10.4230/LIPIcs.ICLP.2011.11

Yet Another Characterization of Strong Equivalence

Authors: Alexander Bochman and Vladimir Lifschitz

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

Abstract

Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas.

Cite as

Alexander Bochman and Vladimir Lifschitz. Yet Another Characterization of Strong Equivalence. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 11-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{bochman_et_al:LIPIcs.ICLP.2011.11,
  author =	{Bochman, Alexander and Lifschitz, Vladimir},
  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 =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.11},
  URN =		{urn:nbn:de:0030-drops-31674},
  doi =		{10.4230/LIPIcs.ICLP.2011.11},
  annote =	{Keywords: Strong equivalence, logic program}
}

Search Results

Documents authored by Lifschitz, Vladimir

Intelligent Instantiation and Supersafe Rules

Abstract

Cite as

Two-Valued Logic Programs

Abstract

Cite as

Yet Another Characterization of Strong Equivalence

Abstract

Cite as

Thanks for your feedback!

Could not send message