Sciweavers

10542 search results - page 175 / 2109
» A General Notion of Useful Information
Sort
View
AAAI
2006
15 years 8 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
GG
2008
Springer
15 years 7 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
JFP
2006
113views more  JFP 2006»
15 years 6 months ago
Consistency of the theory of contexts
The Theory of Contexts is a type-theoretic axiomatization aiming to give a metalogical account of the fundamental notions of variable and context as they appear in Higher stract S...
Anna Bucalo, Furio Honsell, Marino Miculan, Ivan S...
ENTCS
2007
116views more  ENTCS 2007»
15 years 6 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
BSL
2000
153views more  BSL 2000»
15 years 6 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon