Pages that link to "Item:Q799098"

The following pages link to Closures and fairness in the semantics of programming logic (Q799098):

Displaying 28 items.

• Fully abstract compositional semantics for an algebra of logic programs (Q672703) (← links)
• Program generic set: Semantics of medium logic program described by forcing (Q674717) (← links)
• Why a single parallelization strategy is not enough in knowledge bases (Q686639) (← links)
• Negation in rule-based database languages: A survey (Q753476) (← links)
• Closures and fairness in the semantics of programming logic (Q799098) (← links)
• Is there an axiomatic semantics for standard pure Prolog? (Q805224) (← links)
• Conditional equational theories and complete sets of transformations (Q918541) (← links)
• Recursion equation sets computing logic programs (Q920624) (← links)
• S-semantics for logic programming: a retrospective look (Q1035702) (← links)
• Optimal fixedpoints of logic programs (Q1069694) (← links)
• Maximal unifiable subsets and minimal non-unifiable subsets (Q1075061) (← links)
• Semantics of infinite tree logic programming (Q1090469) (← links)
• Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions (Q1101250) (← links)
• Contributions to the semantics of logic perpetual processes (Q1113661) (← links)
• Unfold/fold transformation of stratified programs (Q1177929) (← links)
• Complete extension of general logic programs (Q1190477) (← links)
• Paraconsistent logic programming (Q1262746) (← links)
• Semantics of distributed definite clause programs (Q1262747) (← links)
• A semantics for modular general logic programs (Q1274967) (← links)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
• A compositional semantics for logic programs (Q1314414) (← links)
• Definite clause programs are canonical (over a suitable domain) (Q1356204) (← links)
• Weak generalized closed world assumption (Q1825049) (← links)
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
• The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) (Q2639644) (← links)
• Sémantique logique et dénotationnelle des interpréteurs PROLOG (Q3798220) (← links)
• Efficient analysis of concurrent constraint logic programs (Q4630298) (← links)
• \(\exists\)-Universal termination of logic programs (Q5940923) (← links)