Characterizations of the stable semantics by partial evaluation
From MaRDI portal
Recommendations
- Characterizations of the disjunctive stable semantics by partial evaluation
- Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
- An Algorithm for Computing Semi-stable Semantics
- An extension of the stable semantics via Lukasiewicz logic
- On stable-like semantics for logic programs
- Well-Founded and Partial Stable Semantics Logical Aspects
- Semi-stable semantics
- Partial evaluation and \(\omega\)-completeness of algebraic specifications
- Characteristic formulae for fixed-point semantics: a general framework
- Characteristic formulae for fixed-point semantics: a general framework
Cites work
- Characterizations of the disjunctive stable semantics by partial evaluation
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- scientific article; zbMATH DE number 741348 (Why is no real title available?)
- Partial deduction in disjunctive logic programming
- Semantics of (disjunctive) logic programs based on partial evaluation
- Static semantics for normal and disjunctive logic programs
Cited in
(11)- A simple fixed point characterization of three-valued stable model semantics
- Stability of weak second-order semantics
- Unfold/fold transformations for disjunctive logic programs
- A framework for goal-directed query evaluation with negation
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- Characterizations of the disjunctive stable semantics by partial evaluation
- Semantics of (disjunctive) logic programs based on partial evaluation
- scientific article; zbMATH DE number 6163261 (Why is no real title available?)
- Characterizing D-WFS: confluence and iterated GCWA
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Transformation-based bottom-up computation of the well-founded model
This page was built for publication: Characterizations of the stable semantics by partial evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101443)