Sciweavers

2905 search results - page 332 / 581
» Formal Memetic Algorithms
Sort
View
138
Voted
AAAI
2007
15 years 6 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
145
Voted
AAAI
2008
15 years 6 months ago
Argument Theory Change Applied to Defeasible Logic Programming
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Program...
Martín O. Moguillansky, Nicolás D. R...
142
Voted
DLOG
2007
15 years 6 months ago
Exploiting Conjunctive Queries in Description Logic Programs
We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics kno...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...
132
Voted
DLOG
2007
15 years 6 months ago
SEMilarity: Towards a Model-Driven Approach to Similarity
Enabling the Semantic Web requires solving the semantic heterogeneity problem, for which ontology matching methods have been proposed. These methods rely on similarity measures tha...
Rudi Araújo, Helena Sofia Pinto
CAISE
2008
Springer
15 years 5 months ago
Timed Transition Discovery from Web Service Conversation Logs
Web service business protocols are of importance to both clients and providers, as they model the external behaviour of services. However, the business protocol is not always publ...
Didier Devaurs, Kreshnik Musaraj, Fabien De Marchi...