2272 search results - page 65 / 455 » Capture Complexity by Partition |
117
click to vote
AMSTERDAM
2009
14 years 7 months ago
2009
Abstract. Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in ...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
SEMWEB
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Much data is published on the Web in XML format satisfying schemas, and to make the Semantic Web a reality, such data needs to be interpreted with respect to ontologies. ...
IFIP
2000
Springer
15 years 1 months ago
2000
Springer
New non-desktop technologies may turn out to be of a more open and generic nature than traditional information technologies. These technologies consequently pose novel challenges ...