Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureResearch graph
References from Constructing interpretations of deductive databases using reduction and dynamic stratification. Local targets link to admitted publications; unresolved targets remain external evidence.
The strong semantics for logic programs
10.1007/bf01928539 · 1995 · External reference
Semantics of logic programs: their intuition and formal properties
1995 · External reference
The stable model semantics for logic programming
1988 · External reference
Unresolved reference
External reference
Unresolved reference
External reference
Hard problems for simple default logics
1989 · External reference
Unresolved reference
1992 · External reference
Autoepistemic logic
10.1145/116825.116836 · 1991 · External reference
On the declarative semantics of deductive databases and logic programs
1988 · External reference
On the declarative and procedural semantics of logic programs
10.1007/bf00243002 · 1989 · External reference
Every logic program has a natural stratification and an iterated least fixed point model
1989 · External reference
The well-founded semantics coincides with the three-valued stable semantics
10.3233/fi-1990-13404 · 1990 · External reference
Weakly stratified logic programs
10.3233/fi-1990-13106 · 1990 · External reference
Two simple characterisations of well-founded semantics
1992 · External reference
Well-founded and stationary models of logic programs
10.1007/bf01530784 · 1994 · External reference
The well-founded semantics for general logic programs
10.1145/116825.116838 · 1991 · External reference
