scientific article; zbMATH DE number 176531
From MaRDI portal
Publication:4035697
Recommendations
Cited in
(18)- A compositional semantics for logic programs
- S-semantics for logic programming: a retrospective look
- Towards a Semantics of Unsatisfiability Proofs with Inprocessing
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog
- Fixpoint semantics for logic programming a survey
- scientific article; zbMATH DE number 936828 (Why is no real title available?)
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- On Negative Unfolding in the Answer Set Semantics
- scientific article; zbMATH DE number 2059537 (Why is no real title available?)
- Abstract interpretation of resolution-based semantics
- Is there an axiomatic semantics for standard pure Prolog?
- Guided unfoldings for finding loops in standard term rewriting
- Programs, Recursion and Unbounded Choice
- Transforming constraint logic programs
- The reduced relative power operation on abstract domains
- scientific article; zbMATH DE number 1754691 (Why is no real title available?)
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
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 Q4035697)