Sciweavers

29908 search results - page 544 / 5982
» On the Complexity of
Sort
View
MFCS
2005
Springer
16 years 21 days ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
OOPSLA
2005
Springer
16 years 20 days ago
Using dependency models to manage complex software architecture
An approach to managing the architecture of large software systems is presented. Dependencies are extracted from the code by a conventional static analysis, and shown in a tabular...
Neeraj Sangal, Ev Jordan, Vineet Sinha, Daniel Jac...
OTM
2005
Springer
16 years 20 days ago
Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...
Yuan An, Alexander Borgida, John Mylopoulos
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
16 years 20 days ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang
SEMWEB
2005
Springer
16 years 20 days ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst