Sciweavers

92 search results - page 5 / 19
» Decidable Reasoning over Timestamped Conceptual Models
Sort
View
DLOG
2010
13 years 5 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
DLOG
2007
13 years 9 months ago
Prospects for and Issues with Mapping the Object-Role Modeling language into DLRifd
Object-Role modellers miss the advantages of automated reasoning over their ORM conceptual models, which could be addressed by DL reasoners. DLs are not considered user-friendly an...
C. Maria Keet
CSL
2006
Springer
13 years 10 months ago
Reasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
DAGSTUHL
2007
13 years 8 months ago
An analytic solution to the alibi query in the bead model for moving object data
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
Bart Kuijpers, Walied Othman
ISI
2006
Springer
13 years 7 months ago
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...
Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tib&...