Sciweavers

8 search results - page 2 / 2
» logcom 2000
Sort
View
LOGCOM
2000
103views more  LOGCOM 2000»
13 years 4 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
93views more  LOGCOM 2000»
13 years 4 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
63views more  LOGCOM 2000»
13 years 4 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...