Sciweavers

72 search results - page 14 / 15
» Reducing the Derivation of Redundant Clauses in Reasoning Sy...
Sort
View
FTCS
1998
144views more  FTCS 1998»
13 years 8 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski
TABLEAUX
2005
Springer
14 years 28 days ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
ANCS
2009
ACM
13 years 5 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
GIS
2002
ACM
13 years 7 months ago
Mapping Dilution of Precision (MDOP) and map-matched GPS
A novel method of map matching using the Global Positioning System (GPS) has been developed which uses digital mapping and height data to augment point position computation. This m...
Geoffrey Blewitt, George E. Taylor
ECIS
2003
13 years 8 months ago
An empirical investigation of determinants to buy application services from ASPs
The Application Service Provider (ASP) is a pivotal point in the organization of information systems, since it brings up a new paradigm: “make, buy or rent”. An ASP is a compa...
Vincenzo Morabito