Sciweavers

616 search results - page 63 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
IPL
2010
94views more  IPL 2010»
13 years 7 months ago
Partial model checking via abstract interpretation
model checking via abstract interpretation N. De Francesco, G. Lettieri∗ , L. Martini, G. Vaglini Universit`a di Pisa, Dipartimento di Ingegneria dell’Informazione, sez. Inform...
Nicoletta De Francesco, Giuseppe Lettieri, Luca Ma...
UC
2005
Springer
14 years 2 months ago
On Model-Checking of P Systems
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
DLOG
2010
13 years 6 months ago
Towards Soundness Preserving Approximation for ABox Reasoning of OWL2
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 9 months ago
Practical Automated Partial Verification of Multi-Paradigm Real-Time Models
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
Carlo A. Furia, Matteo Pradella, Matteo Rossi
LICS
2006
IEEE
14 years 2 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco