Skip to main content

2019 | OriginalPaper | Buchkapitel

5. Programs with Negation

verfasst von : Vladimir Lifschitz

Erschienen in: Answer Set Programming

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Our next goal is to extend the definition of a stable model from Sect. 4.​4 to propositional programs that contain negation, and to apply this generalization to clingo programs with negation and choice. We begin with an informal discussion of a few examples.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
13.
Zurück zum Zitat Nicole Bidoit and Christine Froidevaux. Minimalism subsumes default logic and circumscription in stratified logic programming. In Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, pages 89–97, 1987. Nicole Bidoit and Christine Froidevaux. Minimalism subsumes default logic and circumscription in stratified logic programming. In Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, pages 89–97, 1987.
38.
Zurück zum Zitat Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5(1–2):45–74, 2005.MathSciNetCrossRef Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5(1–2):45–74, 2005.MathSciNetCrossRef
40.
Zurück zum Zitat Kit Fine. The justification of negation as failure. In Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, pages 263–301. North Holland, 1989. Kit Fine. The justification of negation as failure. In Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, pages 263–301. North Holland, 1989.
44.
Zurück zum Zitat Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, and Torsten Schaub. Abstract gringo. Theory and Practice of Logic Programming, 15:449–463, 2015.MathSciNetCrossRef Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, and Torsten Schaub. Abstract gringo. Theory and Practice of Logic Programming, 15:449–463, 2015.MathSciNetCrossRef
48.
Zurück zum Zitat Michael Gelfond. On stratified autoepistemic theories. In Proceedings of National Conference on Artificial Intelligence (AAAI), pages 207–211, 1987. Michael Gelfond. On stratified autoepistemic theories. In Proceedings of National Conference on Artificial Intelligence (AAAI), pages 207–211, 1987.
51.
Zurück zum Zitat Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Proceedings of International Logic Programming Conference and Symposium, pages 1070–1080. MIT Press, 1988. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Proceedings of International Logic Programming Conference and Symposium, pages 1070–1080. MIT Press, 1988.
53.
Zurück zum Zitat Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.CrossRef Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.CrossRef
68.
Zurück zum Zitat Carol Ruth Karp. Languages with expressions of infinite length. North-Holland, Amsterdam, 1964. Carol Ruth Karp. Languages with expressions of infinite length. North-Holland, Amsterdam, 1964.
79.
Zurück zum Zitat Vladimir Lifschitz. Thirteen definitions of a stable model. In Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of his 70th Birthday, pages 488–503. Springer, 2010. Vladimir Lifschitz. Thirteen definitions of a stable model. In Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of his 70th Birthday, pages 488–503. Springer, 2010.
83.
Zurück zum Zitat Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369–389, 1999.MathSciNetCrossRef Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369–389, 1999.MathSciNetCrossRef
84.
Zurück zum Zitat Vladimir Lifschitz and Hudson Turner. Splitting a logic program. In Pascal Van Hentenryck, editor, Proceedings of International Conference on Logic Programming (ICLP), pages 23–37, 1994. Vladimir Lifschitz and Hudson Turner. Splitting a logic program. In Pascal Van Hentenryck, editor, Proceedings of International Conference on Logic Programming (ICLP), pages 23–37, 1994.
96.
99.
Zurück zum Zitat Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491–521. Kluwer, 2000. Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491–521. Kluwer, 2000.
111.
Zurück zum Zitat Dana Scott and Alfred Tarski. The sentential calculus with infinitely long expressions. In Colloquium Mathematicae, volume 6, pages 165–170, 1958. Dana Scott and Alfred Tarski. The sentential calculus with infinitely long expressions. In Colloquium Mathematicae, volume 6, pages 165–170, 1958.
116.
Zurück zum Zitat Miroslaw Truszczynski. Connecting first-order ASP and the logic FO(ID) through reducts. In Esra Erdem, Joohyung Lee, Yuliya Lierler, and David Pearce, editors, Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz, pages 543–559. Springer, 2012. Miroslaw Truszczynski. Connecting first-order ASP and the logic FO(ID) through reducts. In Esra Erdem, Joohyung Lee, Yuliya Lierler, and David Pearce, editors, Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz, pages 543–559. Springer, 2012.
118.
Zurück zum Zitat Maarten van Emden and Keith Clark. The logic of two-person games. In Micro-PROLOG: Programming in Logic, pages 320–340. Prentice Hall, 1984. Maarten van Emden and Keith Clark. The logic of two-person games. In Micro-PROLOG: Programming in Logic, pages 320–340. Prentice Hall, 1984.
Metadaten
Titel
Programs with Negation
verfasst von
Vladimir Lifschitz
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-24658-7_5

Premium Partner