The following pages link to Gianfranco Rossi (Q206866):
Displaying 29 items.
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Using Prolog for building FROG, a hybrid knowledge representation system (Q1115205) (← links)
- Extending Horn clause logic with implication goals (Q1186427) (← links)
- A set solver for finite set relation algebra (Q1617837) (← links)
- Automated proof of Bell-LaPadula security properties (Q2031424) (← links)
- An automatically verified prototype of the Tokeneer ID station specification (Q2069869) (← links)
- Solving quantifier-free first-order constraints over finite sets and binary relations (Q2303241) (← links)
- A decision procedure for restricted intensional sets (Q2405250) (← links)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- {log}: A language for programming in logic with finite sets (Q3129506) (← links)
- Integrating Finite Domain and Set Constraints into a Set-based Constraint Language (Q3400565) (← links)
- GASP: Answer Set Programming with Lazy Grounding (Q3400569) (← links)
- Set unification (Q3422416) (← links)
- Logic Programming in Italy: A Historical Perspective (Q3578388) (← links)
- (Q3991208) (← links)
- (Q4264105) (← links)
- (Q4385450) (← links)
- (Q4474008) (← links)
- (Q4506398) (← links)
- Adding partial functions to Constraint Logic Programming with sets (Q4593005) (← links)
- A Decision Procedure for Sets, Binary Relations and Partial Functions (Q4633533) (← links)
- Constraint Logic Programming with Polynomial Constraints over Finite Domains (Q4686512) (← links)
- (Q4944864) (← links)
- (Q5087785) (← links)
- Logic Programming (Q5191486) (← links)
- A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form (Q5215368) (← links)
- A uniform approach to constraint-solving for lists, multisets, compact lists, and sets (Q5277804) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers (Q6653095) (← links)
