Answer Set
Jump to navigation
Jump to search
An Answer Set is a Logic Programming of declarative semantics with no negation as failure.
- AKA: Stable Model Semantics, Stable Model.
- See: Answer Set Programming, Logic Programming, Negation as Failure, Completion Semantics, Well-Founded Semantics, Declarative Programming Language.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Stable_model_semantics Retrieved:2017-5-21.
- The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program completion and the well-founded semantics. The stable model semantics is the basis of