Generalized well-founded semantics for logic programs
From MaRDI portal
Recommendations
Cites work
- A fixpoint semantics for disjunctive logic programs
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
- Generalized disjunctive well-founded semantics for logic programs.
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4147555 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 4185011 (Why is no real title available?)
- The Semantics of Predicate Logic as a Programming Language
Cited in
(13)- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Founded semantics and constraint semantics of logic rules
- Well-supported semantics for logic programs with generalized rules
- An analysis of the equational properties of the well-founded fixed point
- scientific article; zbMATH DE number 25193 (Why is no real title available?)
- A procedural semantics for well-founded negation in logic programs
- The well-founded semantics for general logic programs
- A computable semantics for general logic programs
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- On generalized well-founded models for logic programs
- scientific article; zbMATH DE number 1453067 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2004
- On Signings and the Well-Founded Semantics
This page was built for publication: Generalized well-founded semantics for logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488525)
