What Is Negation as Failure?
By Dov M. Gabbay. Logic Programs, Norms and Action, 2012
519 citations recorded by the source corpus.
An equational approach is used to give semantics to negation as failure. We offer an Equational Calculus and in it we define a new completion for programs with negation as failure in the body of clauses. This approach is compared with other approaches in the literature and a connection is established with argumentation theory.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/8bd9cb06587174b3d05c4fe3885405500cbb6048
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Benjamin Kaufmann
- Torsten Schaub
- Martin Gebser
- L. M. Pereira
- Steffen Hölldobler
- Emmanuelle-Anna Dietz
- Roland Kaminski
- Antti Hyttinen
Citations in the corpus
- On Conditionals (2015, background): “Conditionals are evaluated 2Note that undefined atoms are not identified with ⊥ as in the completion of P [5].”
- Potassco: The Potsdam Answer Set Solving Collection (2011, unknown): “7The models of the Clark completion [12] of a program are called supported models [2].”
- Conflict-driven answer set solving: From theory to practice (2012, methodology): “Hence, our representation is a conservative extension of the completion of Π , originally described without propositions for bodies [21].”