Sciweavers

3047 search results - page 386 / 610
» On the Meaning of Logical Completeness
Sort
View
COMMA
2010
14 years 5 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
HICSS
2011
IEEE
190views Biometrics» more  HICSS 2011»
14 years 2 months ago
Validating Cyber Security Requirements: A Case Study
Vulnerabilities in a system may have widely varying impacts on system security. In practice, security should not be defined as the absence of vulnerabilities. In practice, securit...
Robert K. Abercrombie, Frederick T. Sheldon, Ali M...
ENTCS
2008
137views more  ENTCS 2008»
14 years 11 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells
IRES
2002
63views more  IRES 2002»
14 years 10 months ago
The Semantic Web, universalist ambition and some lessons from librarianship
Building the semantic web encounters problems similar to building large bibliographic systems. The experience of librarianship in controlling large, heterogeneous collections of b...
Terrence A. Brooks
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 2 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman