Sciweavers

2845 search results - page 229 / 569
» Constraints over Ontologies
Sort
View
DLOG
2011
14 years 9 months ago
The Complexity of Conjunctive Query Abduction in DL-Lite
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
Diego Calvanese, Magdalena Ortiz, Mantas Simkus, G...
ICPR
2008
IEEE
16 years 7 months ago
Continuous graph cuts for prior-based object segmentation
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
Anders Heyden, Christian Gosch, Christoph Schn&oum...
CAV
2003
Springer
145views Hardware» more  CAV 2003»
15 years 11 months ago
Monitoring Temporal Rules Combined with Time Series
Run-time monitoring of temporal properties and assertions is used for testing and as a component of execution-based model checking techniques. Traditional run-time monitoring howev...
Doron Drusinsky
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 6 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin
136
Voted
CONCUR
2004
Springer
15 years 11 months ago
Model Checking Timed Automata with One or Two Clocks
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
François Laroussinie, Nicolas Markey, Ph. S...