Sciweavers

2022 search results - page 277 / 405
» Complexity of Non-Monotonic Logics
Sort
View
AAAI
2010
15 years 7 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
AMW
2010
15 years 7 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
FORTE
2007
15 years 7 months ago
Specifying and Composing Interaction Protocols for Service-Oriented System Modelling
Abstract. We present and discuss a formal, high-level approach to the specification and composition of interaction protocols for service-oriented systems. This work is being develo...
João Abreu, Laura Bocchi, José Luiz ...
IJCAI
2007
15 years 7 months ago
Learning to Count by Think Aloud Imitation
Although necessary, learning to discover new solutions is often long and difficult, even for supposedly simple tasks such as counting. On the other hand, learning by imitation pr...
Laurent Orseau
PTS
2008
123views Hardware» more  PTS 2008»
15 years 7 months ago
Model-Based Firewall Conformance Testing
Firewalls are a cornerstone of todays security infrastructure for networks. Their configuration, implementing a firewall policy, is inherently complex, hard to understand, and diff...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...