Sciweavers

174 search results - page 15 / 35
» Existential Fixed-Point Logic
Sort
View
CSFW
2008
IEEE
15 years 4 months ago
DKAL: Distributed-Knowledge Authorization Language
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
Yuri Gurevich, Itay Neeman
CP
2006
Springer
15 years 1 months ago
Inferring Variable Conflicts for Local Search
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...
Magnus Ågren, Pierre Flener, Justin Pearson
ENTCS
2006
153views more  ENTCS 2006»
14 years 10 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
JAPLL
2006
109views more  JAPLL 2006»
14 years 10 months ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
PODS
2004
ACM
139views Database» more  PODS 2004»
15 years 10 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis