Sciweavers

1818 search results - page 92 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
JAR
2000
137views more  JAR 2000»
13 years 8 months ago
A Benchmark Method for the Propositional Modal Logics K, KT, S4
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
Peter Balsiger, Alain Heuerding, Stefan Schwendima...
NGC
2000
Springer
124views Communications» more  NGC 2000»
13 years 8 months ago
Temporal Disjunctive Logic Programming
In this paper we introduce the logic programminglanguage Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive C...
Manolis Gergatsoulis, Panos Rondogiannis, Themis P...
TCS
1998
13 years 8 months ago
A Computational Model for Metric Spaces
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
Abbas Edalat, Reinhold Heckmann
TOPLAS
2002
116views more  TOPLAS 2002»
13 years 8 months ago
Type-preserving compilation of Featherweight Java
We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavio...
Christopher League, Zhong Shao, Valery Trifonov
IANDC
2010
119views more  IANDC 2010»
13 years 7 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder