Sciweavers

6618 search results - page 346 / 1324
» Natural Logic for Natural Language
Sort
View
SIGSOFT
2005
ACM
16 years 7 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
16 years 5 days ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
UML
2004
Springer
16 years 4 days ago
Modeling Business Processes in Web Applications with ArgoUWE
Abstract. The CASE tool ArgoUWE supports the systematic design of Web applications using the UML-based Web Engineering (UWE) approach. The design methodology of UWE is based on a m...
Alexander Knapp, Nora Koch, Gefei Zhang, Hanns-Mar...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 11 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
BDA
2004
15 years 8 months ago
A new way of optimizing OLAP queries
For around 10 years, the academic research in database has attempted to define a commonly agreed logical modeling for the multidimensional and hierarchical nature of data manipulat...
Arnaud Giacometti, Dominique Laurent, Patrick Marc...