scientific article; zbMATH DE number 25193
From MaRDI portal
Publication:3983046
Recommendations
- On generalized well-founded models for logic programs
- Generalized well-founded semantics for logic programs
- A note on the stable model semantics for logic programs
- On the relations between stable and well-founded semantics of logic programs
- The well-founded semantics for general logic programs
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- Fixpoint semantics for logic programming a survey
- Expressiveness of logic programs under the general stable model semantics
- On well-founded models for logic programs
- On stable-like semantics for logic programs
Cited in
(17)- Generalized metrics and uniquely determined logic programs.
- What is answer set programming to propositional satisfiability
- A model-theoretic reconstruction of the operational semantics of logic programs
- The meaning of negative premises in transition system specifications. II
- Thirteen Definitions of a Stable Model
- Ordered completion for first-order logic programs on finite structures
- scientific article; zbMATH DE number 517024 (Why is no real title available?)
- scientific article; zbMATH DE number 1114052 (Why is no real title available?)
- Modeling the suppression task under weak completion and well-founded semantics
- Finite model reasoning over existential rules
- On the coincidence of semantics for uniquely determined programs
- Stability, supportedness, minimality and Kleene answer set programs
- Twelve Definitions of a Stable Model
- Generalized well-founded semantics for logic programs
- Embedding justification theory in approximation fixpoint theory
- Update programs versus revision programs
- On program completion, with an application to the sum and product puzzle
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983046)
