471 search results - page 49 / 95 » Computational complexity: a conceptual perspective |
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
ECAL
2007
Springer
14 years 3 months ago
2007
Springer
There is an ongoing debate about whether the words in the first languages spoken by humans expressed single concepts or complex holophrases. A computer model was used to investigat...
ISCOPE
1998
Springer
14 years 1 months ago
1998
Springer
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
EDBTW
2006
Springer
14 years 16 days ago
2006
Springer
Scientific workflows facilitate automation, reuse, and reproducibility of scientific data management and analysis tasks. Scientific workflows are often modeled as dataflow networks...
GRAMMARS
1998
13 years 8 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...