Sciweavers

2225 search results - page 207 / 445
» Logical Structures in the Lexicon
Sort
View
AAAI
2007
15 years 9 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
ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
15 years 8 months ago
BDD-based two variable sharing extraction
It has been shown that Binary Decision Diagram (BDD) based logic synthesis enjoys faster runtime than the classic logic synthesis systems based on Sum of Product (SOP) form. Howev...
Dennis Wu, Jianwen Zhu
AMW
2010
15 years 8 months ago
Updating ABoxes in DL-Lite
Abstract. We study the problem of instance level (ABox) updates for Knowledge Bases (KBs) represented in Description Logics of the DL-Lite family. DLLite is at the basis of OWL 2 Q...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 6 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini
ESWA
2002
76views more  ESWA 2002»
15 years 6 months ago
Supporting software development through declaratively codified programming patterns
In current-day software development, programmers often use programming patterns to clarify their intents and to increase the understandability of their programs. Unfortunately, mo...
Kim Mens, Isabel Michiels, Roel Wuyts