Sciweavers

124 search results - page 18 / 25
» Automata can show PSpace results for description logics
Sort
View
AGP
2003
IEEE
14 years 28 days ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 7 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
ICTAI
2007
IEEE
14 years 1 months ago
Harnessing Ontologies for Argument-Based Decision-Making in Breast Cancer
We introduce a novel Ontology-based Argumentation Framework (OAF) that links a logic-based argumentation formalism and description logic ontologies. We show how these two formalis...
Matt Williams, Anthony Hunter
ICST
2009
IEEE
13 years 5 months ago
Timed Testing under Partial Observability
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
ICCBR
2009
Springer
13 years 5 months ago
On Similarity Measures Based on a Refinement Lattice
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...
Santiago Ontañón, Enric Plaza