Sciweavers

83 search results - page 4 / 17
» Generality and Equivalence Relations in Default Logic
Sort
View
NIL
1991
13 years 11 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
MSCS
2007
117views more  MSCS 2007»
13 years 7 months ago
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
Michele Pagani
JUCS
2006
126views more  JUCS 2006»
13 years 7 months ago
Behavioral Institutions and Refinements in Generalized Hidden Logics
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
Manuel A. Martins
POPL
2012
ACM
12 years 3 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
APAL
2005
73views more  APAL 2005»
13 years 7 months ago
Finite information logic
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
Rohit Parikh, Jouko A. Väänänen