Sciweavers

2432 search results - page 341 / 487
» Cryptographic logical relations
Sort
View
LPNMR
2005
Springer
16 years 10 hour ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
TLCA
2005
Springer
15 years 12 months ago
L3: A Linear Language with Locations
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
Greg Morrisett, Amal J. Ahmed, Matthew Fluet
CAISE
2004
Springer
15 years 12 months ago
Information Modeling and Higher-order Types
: While some information modeling approaches (e.g. the Relational Model, and Object-Role Modeling) are typically formalized using first-order logic, other approaches to information...
Terry A. Halpin
NMR
2004
Springer
15 years 12 months ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
SDMW
2004
Springer
15 years 12 months ago
PeerTrust: Automated Trust Negotiation for Peers on the Semantic Web
Abstract. Researchers have recently begun to develop and investigate policy languages to describe trust and security requirements on the Semantic Web. Such policies will be one com...
Wolfgang Nejdl, Daniel Olmedilla, Marianne Winslet...