The following pages link to (Q4035697):
Displaying 14 items.
- Is there an axiomatic semantics for standard pure Prolog? (Q805224) (← links)
- S-semantics for logic programming: a retrospective look (Q1035702) (← links)
- Abstract interpretation of resolution-based semantics (Q1035705) (← links)
- Transforming constraint logic programs (Q1274969) (← links)
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
- The reduced relative power operation on abstract domains (Q1285656) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- Programs, Recursion and Unbounded Choice (Q4023579) (← links)
- Towards a Semantics of Unsatisfiability Proofs with Inprocessing (Q4645727) (← links)
- (Q4896256) (← links)
- Unfolding and fixpoint semantics of concurrent constraint logic programs (Q5096197) (← links)
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog (Q5458800) (← links)
- Guided unfoldings for finding loops in standard term rewriting (Q6085974) (← links)
