550 search results - page 84 / 110 » Context Semantics, Linear Logic and Computational Complexity |
ICCD
2001
IEEE
15 years 6 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
ECCC
2006
14 years 9 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
107
click to vote
DLOG
2008
15 years 1 days ago
2008
Abstract. Fuzzy Description Logics (f-DLs) have been proposed as extensions of classical Description Logics able to handle imprecise and vague knowledge. Although several extension...
DEXA
2009
Springer
15 years 4 months ago
2009
Springer
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
SEMCO
2007
IEEE
15 years 4 months ago
2007
IEEE
Recognizing textual entailment (TE) is a complex task involving knowledge from many different sources. One major source of information in this task is event factuality, since the ...