Sciweavers

1032 search results - page 141 / 207
» Extended Computation Tree Logic
Sort
View
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 2 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
DAC
2006
ACM
15 years 10 months ago
Automatic invariant strengthening to prove properties in bounded model checking
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
Mohammad Awedh, Fabio Somenzi
ICCS
2009
Springer
15 years 4 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
Jean-François Baget, Madalina Croitoru, J&e...
TABLEAUX
2007
Springer
15 years 3 months ago
Axiom Pinpointing in General Tableaux
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing ...
Franz Baader, Rafael Peñaloza
CCECE
2006
IEEE
15 years 3 months ago
AOP Extension for Security Testing of Programs
The purpose of this paper is to use the aspect-oriented programming (AOP) paradigm for security testing. AOP allows security experts to develop and inject separate modules for con...
Nadia Belblidia, Mourad Debbabi, Aiman Hanna, Zhen...