Sciweavers

1545 search results - page 127 / 309
» Defeasible Description Logics
Sort
View
EACL
2003
ACL Anthology
13 years 9 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
SAC
2010
ACM
14 years 2 months ago
Towards the induction of terminological decision trees
A concept learning framework for terminological representations is introduced. It is grounded on a method for inducing logic decision trees as an adaptation of the classic tree in...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
ER
2006
Springer
157views Database» more  ER 2006»
13 years 11 months ago
Representing Transitive Propagation in OWL
Transitive propagation along properties can be modelled in various ways in the OWL description logic. Doing so allows existing description logic reasoners based on the tableaux alg...
Julian Seidenberg, Alan L. Rector
EON
2008
13 years 9 months ago
Debugging OWL Ontologies - A Reality Check
One of the arguments for choosing description logics as the basis for the Web Ontology Language is the ability to support the development of complex ontologies through logical reas...
Heiner Stuckenschmidt
JWSR
2007
89views more  JWSR 2007»
13 years 7 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...