2490 search results - page 142 / 498 » Complexity of Contextual Reasoning |
133
click to vote
RR
2010
Springer
15 years 3 months ago
2010
Springer
The development and use of ontologies may require users with no training in formal logic to handle complex concept descriptions. To aid such users, we propose a new visualization f...
117
Voted
DLOG
2010
15 years 2 months ago
2010
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
160
click to vote
ESSLLI
2009
Springer
15 years 2 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
181
Voted
LICS
2012
IEEE
13 years 7 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
140
click to vote
KRDB
2001
15 years 6 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...