Pages that link to "Item:Q4245932"
From MaRDI portal
The following pages link to The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1 (Q4245932):
Displayed 28 items.
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- A functorial framework for constraint normal logic programming (Q934677) (← links)
- Semantics of temporal constrained objects (Q1996867) (← links)
- A semantics for hybrid probabilistic logic programs with function symbols (Q2238621) (← links)
- On quantified linear implications (Q2254606) (← links)
- Totally correct logic program transformations via well-founded annotations (Q2271905) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- Attributed Graph Constraints (Q3540405) (← links)
- A non-termination criterion for binary constraint logic programs (Q3621267) (← links)
- The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments (Q3648356) (← links)
- (Q4499254) (← links)
- An iterative approach to precondition inference using constrained Horn clauses (Q4559813) (← links)
- <i>CLP(H):</i>Constraint logic programming for hedges (Q4593022) (← links)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- Inference in probabilistic logic programs with continuous random variables (Q4911131) (← links)
- Selective Unification in (Constraint) Logic Programming* (Q4988929) (← links)
- Generalization-Driven Semantic Clone Detection in CLP (Q5097639) (← links)
- Anti-unification in Constraint Logic Programming (Q5108501) (← links)
- Concolic Testing in CLP (Q5140007) (← links)
- A Transformation-based implementation for CLP with qualification and proximity (Q5410260) (← links)
- HM(X) type inference is CLP(X) solving (Q5451969) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)