Sciweavers

LOGCOM
2000
93views more  LOGCOM 2000»
13 years 11 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
LOGCOM
2000
69views more  LOGCOM 2000»
13 years 11 months ago
Measuring similarity in belief revision
Pavlos Peppas, Norman Y. Foo, Abhaya C. Nayak
LOGCOM
2000
103views more  LOGCOM 2000»
13 years 11 months ago
A geometric proof of confluence by decreasing diagrams
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
LOGCOM
2000
63views more  LOGCOM 2000»
13 years 11 months ago
Reflection principles in computational logic
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Co...
LOGCOM
2000
69views more  LOGCOM 2000»
13 years 11 months ago
Object calculi in linear logic
Several calculi of objects have been studied in the recent literature, that support the central features of object-based languages: messages, inheritance, dynamic dispatch, object...
Michele Bugliesi, Giorgio Delzanno, Luigi Liquori,...
LOGCOM
2000
63views more  LOGCOM 2000»
13 years 11 months ago
Similarity relations in concept lattices
Radim Belohlávek