CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Members
Events
Projects
Software
Publications
Contact
Light
Dark
Automatic
Montanari Angelo
Latest
Decidability and Complexity of Action-Based Temporal Planning over Dense Time
Reactive Synthesis from Extended Bounded Response LTL Specifications
A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL
An event-based data warehouse to support decisions in multi-channel, multi-service contact centers
A game-theoretic approach to timeline-based planning with uncertainty
One-pass and tree-shaped tableau systems for TPTL and TPTLb+past
Bounded Timed Propositional Temporal Logic with past captures timeline-based planning with bounded constraints
Complexity of timeline-based planning
A New Tableau-based Satisfiability Checker for Linear Temporal Logic
Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning
A graph-theoretic approach to map conceptual designs to XML schemas
From entity relationship to XML Schema: A graph-theoretic approach (extended abstract)
Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD)
Ehrenfeucht Games on Labelled Successor Structures: Remoteness and Optimal Strategies
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
Games on Strings with a Limited Order Relation
Extensions of S1S and the composition method
Decidability of Interval Temporal Logics over Split-Frames via Granularity
Extending Kamp's Theorem to Model Time Granularity
The taming (timing) of the states
Modal deduction in second-order logic and set theory. II
Modal deduction in second-order logic and set theory. I
Cite
×