Sciweavers

1055 search results - page 29 / 211
» Enumerations in computable structure theory
Sort
View
CSL
2010
Springer
13 years 11 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
SARA
2000
Springer
14 years 1 months ago
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
Eyal Amir, Sheila A. McIlraith
DIGRA
2005
Springer
14 years 3 months ago
Role Theory: The Line Between Roles as Design and Socialization in EverQuest
For a player to enter the game-world of EverQuest, they must choose a character. Each character fulfills a particular, functional role within the game that defines the game-play e...
Kelly Boudreau
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
COLING
2010
13 years 5 months ago
Expressing OWL axioms by English sentences: dubious in theory, feasible in practice
With OWL (Web Ontology Language) established as a standard for encoding ontologies on the Semantic Web, interest has begun to focus on the task of verbalising OWL code in controll...
Richard Power, Allan Third