Sciweavers

42 search results - page 7 / 9
» Levels of Modalities for BDI Logic
Sort
View
IANDC
2010
95views more  IANDC 2010»
13 years 5 months ago
Structured anaphora to quantifier domains
The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with...
Adrian Brasoveanu
CAV
1997
Springer
102views Hardware» more  CAV 1997»
13 years 11 months ago
Efficient Model Checking Using Tabled Resolution
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular,...
Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramak...
IANDC
2006
113views more  IANDC 2006»
13 years 7 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
ICALP
2010
Springer
14 years 12 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
POPL
2005
ACM
14 years 8 months ago
Enterprise privacy promises and enforcement
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
Adam Barth, John C. Mitchell