The following pages link to Salvatore Ruggieri (Q293339):
Displaying 23 items.
- (Q197387) (redirect page) (← links)
- Weakest preconditions for pure Prolog programs (Q293340) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Bounded nondeterminism of logic programs (Q702093) (← links)
- On computing the semi-sum of two integers (Q1014396) (← links)
- On logic programs that always succeed. (Q1426033) (← links)
- Sequential pattern mining for ICT risk assessment and management (Q1633339) (← links)
- On quantified linear implications (Q2254606) (← links)
- (Q3455602) (← links)
- Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs (Q3522065) (← links)
- Verification of meta-interpreters (Q4340422) (← links)
- Classes of terminating logic programs (Q4452620) (← links)
- (Q4499240) (← links)
- Decidability of logic program semantics and applications to testing (Q4520178) (← links)
- Termination of constraint logic programs (Q4572011) (← links)
- Verification of logic programs (Q4700388) (← links)
- (Q4707741) (← links)
- (Q5214189) (← links)
- On proving left termination of constraint logic programs (Q5267429) (← links)
- Program Development in Computational Logic (Q5712539) (← links)
- \(\exists\)-Universal termination of logic programs (Q5940923) (← links)
- Declarative reasoning on explanations using constraint logic programming (Q6545527) (← links)
