Franceschet, Massimo - Dipartimento di Matematica e Informatica, Università degli Studi di Udine

• Towards an automata-theoretic counterpart of combined temporal logics
• The Complexity of Model Checking in Modal Event Calculi with Quantifiers
• Model Checking Hybrid Logics (With an Application
• Universit`a degli Studi di Udine Dipartimento di Matematica e Informatica
• CTL Model Checking for Processing Simple XPath Queries Loredana Afanasiev1
• Guarded fragments with constants Balder ten Cate (balder.tencate@uva.nl)
• Linkoping Electronic Articles in Computer and Information Science
• Cellular/Molecular Stimulus History Reliably Shapes Action Potential
• Modal logic and navigational XPath: an experimental comparison
• On the Complexity of Hybrid Logics with Binders
• Definability and decidability of binary predicates for time granularity
• A logical approach to represent and reason about calendars
• A cluster analysis of scholar and journal bibliometric indicators Massimo Franceschet
• Mapping spatio-temporal conceptual schemas into XML Schema documents Massimo Franceschet and Angelo Montanari
• The effect of scholar collaboration on impact and quality of academic papers
• The role of conference publications in computer science: a bibliometric view
• "Time Granularities in Databases, Data Mining, and Temporal Reasoning" (Book Review)
• Baltzer Journals November 10, 2002 A Graph-Theoretic Approach to Efficiently
• Modal Event Calculi with Preconditions Iliano Cervesato
• Branching within Time: an Expressively Complete and Elementarily Decidable Temporal
• A combined approach to temporal logics for time granularity
• A Hierarchy of Modal Event Calculi: Expressiveness and Complexity
• Journal influence factors6 Massimo Franceschet
• XCheck: a Platform for Benchmarking XQuery Engines L. Afanasiev1
• A Logic-based Approach to Cache Answerability for XPath Queries
• an XPath Benchmark for the XMark Generated Data
• Representing and reasoning about temporal granularities Carlo Combi (corresponding author)
• Model checking for combined logics with an application to mobile systems
• Model Checking for Hybrid Logics Massimo Franceschet
• Hybrid Logics on Linear Structures: Expressivity and Complexity
• A Guided Tour through some Extensions of the Event Calculus
• Model Checking for Combined Logics Massimo Franceschet1
• A graph-theoretic approach to efficiently reason about partially ordered events in the Event Calculus
• Pairing Transitive Closure and Reduction to Efficiently Reason about
• Event Calculus with Explicit Quantifiers Iliano Cervesato
• The Complexity of Model Checking in Modal Event Calculi
• Ten good reasons to use the EigenfactorTM Massimo Franceschet
• Under consideration for publication in Theory and Practice of Logic Programming 1 Temporalized logics and automata
• From Entity Relationship to XML Schema: a graph-theoretic approach
• A comparison of bibliometric indicators for computer science scholars and journals on
• The difference between popularity and prestige in the sciences and in the social sciences
• Indexing by Shape of Image Databases Based on Extended Grid Files Carlo Combi, Gian Luca Foresti, Massimo Franceschet, Angelo Montanari