Sciweavers

2432 search results - page 319 / 487
» Cryptographic logical relations
Sort
View
173
Voted
ICLP
2004
Springer
16 years 12 days ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
193
Voted
LPAR
2004
Springer
16 years 12 days ago
Weighted Answer Sets and Applications in Intelligence Analysis
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
175
Voted
COMPSAC
2003
IEEE
16 years 10 days ago
Automated Metamorphic Testing
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs fo...
Arnaud Gotlieb, Bernard Botella
WECWIS
2003
IEEE
97views ECommerce» more  WECWIS 2003»
16 years 9 days ago
Matchmaking for Business Processes
Web services have a potential to enhance B2B ecommerce over the Internet by allowing companies and organizations to publish their business processes on service directories where p...
Andreas Wombacher, Peter Fankhauser, Bendick Mahle...
233
Voted
AI
2003
Springer
16 years 8 days ago
A Formal Theory for Describing Action Concepts in Terminological Knowledge Bases
This paper introduces a formal theory for describing actions in terminological knowledge bases, closely related to description logics. It deals in particular with the problem of ad...
Christel Kemke