The well-founded semantics for general logic programs

By A. V. Gelder, K. A. Ross, J. Schlipf. 1991

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Martin Gebser
2. Benjamin Kaufmann
3. Torsten Schaub
4. Andreas Holzinger
5. Randy Goebel
6. Vasile Palade
7. Walter Alexandre Carnielli
8. Paul E. S. Dunne

Citations in the corpus

• DeepProbLog: Neural Probabilistic Logic Programming (2018, neutral): “We follow the well-founded semantics here [14].”
• Extending and implementing the stable model semantics (2000, background): “The Well-founded Semantics Since the definition of the well-founded semantics [65] is somewhat complicated, we make use of an equivalent definition that suits our needs better.”
• Abstract Dialectical Frameworks (2010, background): “(cid:50) We finally establish the relationship between logic programs under the well-founded semantics (Gelder, Ross, and Schlipf 1991) and their associated ADFs.”
• Under Consideration for Publication in Theory and Practice of Logic Programming Inference and Learning in Probabilistic Logic Programs Using Weighted Boolean Formulas (methodology): “We refer to Van Gelder et al. (1991) for details.”
• Semi-stable semantics (2006, background): “It can be mentioned that several alternative semantics for default logic and logic programming have been specified, such as [33, 39, 7].”
• Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP (1997, background): “For normal logic programs the leading declarative approaches are the stable model semantics [8] and the well-founded semantics [ 15 ].”
• Towards Integrative Machine Learning and Knowledge Extraction (2017, background): “, [54,55]), they just become recently very popular due the success of convolutional neural networks [56,57].”
• Complexity and expressive power of logic programming (1997, background): “Well-Founded Negation Roughly speaking, the well-founded se­mantics (WFS) [van Gelder et al. 1991] as­signs value unknown to an atom A,ifit is de.ned by unstrati.ed negation.”
• Conflict-driven answer set solving: From theory to practice (2012, background): “On the one hand, well-founded semantics is based on unfounded sets [124], viz.”
• Conflict-Driven Answer Set Solving (2007, background): “Only if Π is non-tight, we check whether an un-founded set [van Gelder et al. , 1991] (accumulated in U ) has to be falsified.”
• Weighted Rules under the Stable Model Semantics (2016, unknown): “Proven in (Van Gelder, Ross, and Schlipf 1991).”