Sciweavers

5550 search results - page 288 / 1110
» Different Approaches to Proof Systems
Sort
View
TABLEAUX
2005
Springer
16 years 4 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
AISC
1998
Springer
15 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
ICST
2009
IEEE
16 years 1 months ago
Transforming and Selecting Functional Test Cases for Security Policy Testing
In this paper, we consider typical applications in which the business logic is separated from the access control logic, implemented in an independent component, called the Policy ...
Tejeddine Mouelhi, Yves Le Traon, Benoit Baudry
DSOM
2007
Springer
16 years 26 days ago
Efficient Web Services Event Reporting and Notifications by Task Delegation
Web Services are an XML technology recently viewed as capable of being used for network management. A key aspect of WS in this domain is event reporting. WS-based research in this ...
Aimilios Chourmouziadis, George Pavlou
RTA
2007
Springer
16 years 24 days ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...