Sciweavers

1545 search results - page 221 / 309
» Defeasible Description Logics
Sort
View
SAC
2002
ACM
13 years 7 months ago
Dynamically generating web application fragments from page templates
Web-based applications are typically required to be highly customizable and configurable. New application requirements have to be introduced rapidly, often without stopping the ru...
Uwe Zdun
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
IANDC
2010
95views more  IANDC 2010»
13 years 5 months ago
Structured anaphora to quantifier domains
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
Adrian Brasoveanu
WWW
2011
ACM
13 years 2 months ago
A better uncle for OWL: nominal schemas for integrating rules and ontologies
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
Markus Krötzsch, Frederick Maier, Adila Krisn...
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...