Sciweavers

764 search results - page 77 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
ACL
1997
15 years 1 months ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell
POPL
2012
ACM
13 years 7 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...
ICFP
2004
ACM
15 years 11 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
KR
2004
Springer
15 years 5 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
MMMACNS
2001
Springer
15 years 4 months ago
Analyzing Separation of Duties in Petri Net Workflows
Abstract. With the rise of global networks like the Internet the importance of workflow systems is growing. However, security questions in such environments often only address secu...
Konstantin Knorr, Harald Weidner