The following pages link to Maurizio Gabbrielli (Q276550):
Displaying 50 items.
- Portfolio approaches for constraint optimization problems (Q276552) (← links)
- The expressive power of CHR with priorities (Q388222) (← links)
- Transformations of CLP modules (Q671648) (← links)
- Programming languages: Principles and paradigms (Q1049892) (← links)
- (Q1126258) (redirect page) (← links)
- Differential logic programs: Programming methodologies and semantics (Q1126260) (← links)
- Unfolding and fixpoint semantics of concurrent constraint logic programs (Q1200981) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- (Q1308985) (redirect page) (← links)
- Reasoning about termination of pure Prolog programs (Q1308986) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- Time-extraction for temporal logic -- logic programming and local process time (Q1333399) (← links)
- Constraint logic programming with dynamic scheduling: A semantics based on closure operators (Q1368380) (← links)
- Confluence in concurrent constraint programming (Q1391102) (← links)
- A timed concurrent constraint language. (Q1854359) (← links)
- First-order theories for pure Prolog programs with negation (Q1892097) (← links)
- Observable behaviors and equivalences of logic programs (Q1900312) (← links)
- A temporal logic for proving properties of topologically general executions (Q1917070) (← links)
- Self-reconfiguring microservices (Q2026795) (← links)
- A methodology for granularity-based control of parallelism in logic programs (Q2365139) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- (Q2736350) (← links)
- Comparative analysis of the expressiveness of shared dataspace coordination (Q2841273) (← links)
- SUNNY: a Lazy Portfolio Approach for Constraint Solving (Q2931261) (← links)
- A compositional semantics for CHR (Q2946569) (← links)
- On the Expressive Power of Multiple Heads in CHR (Q2946654) (← links)
- (Q2974797) (← links)
- A closer look at declarative interpretations (Q3129509) (← links)
- NESTED GUARDED HORN CLAUSES (Q3358219) (← links)
- (Q3566722) (← links)
- Concurrent and Reactive Constraint Programming (Q3578398) (← links)
- Decidability properties for fragments of CHR (Q3585171) (← links)
- Expressiveness of Multiple Heads in CHR (Q3599074) (← links)
- A Compositional Semantics for CHR with Propagation Rules (Q3616886) (← links)
- On the expressive power of recursion, replication and iteration in process calculi (Q3655762) (← links)
- (Q4036549) (← links)
- (Q4221353) (← links)
- (Q4222884) (← links)
- (Q4259953) (← links)
- The s-semantics approach: Theory and applications (Q4305626) (← links)
- (Q4449170) (← links)
- Unfolding for CHR programs (Q4592981) (← links)
- Timed soft concurrent constraint programs: An interleaved and a parallel approach (Q4593013) (← links)
- SUNNY-CP and the MiniZinc challenge (Q4603429) (← links)
- Probabilistic Recursion Theory and Implicit Computational Complexity (Q4621181) (← links)
- (Q4681453) (← links)
- Layered modes (Q4700390) (← links)
- (Q4738216) (← links)
- Observable Semantics for Constraint Logic Programs (Q4763533) (← links)
- (Q4858579) (← links)
